{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:53:51Z","timestamp":1743094431781,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416876"},{"type":"electronic","value":"9783540446866"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44686-9_48","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T19:07:27Z","timestamp":1187204847000},"page":"483-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate VLDC Pattern Matching in Shared-Forest"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Vilares","sequence":"first","affiliation":[]},{"given":"Francisco J.","family":"Ribadas","sequence":"additional","affiliation":[]},{"given":"Victor M.","family":"Darriba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Billot, S., Lang, B.: The structure of shared forest in ambiguous parsing. Proc. of 27\nthAnnual Meeting of the ACL, 1989.","DOI":"10.3115\/981623.981641"},{"key":"48_CR2","series-title":"Lect Notes Comput Sci","first-page":"159","volume-title":"Grammatical Tree Matching","author":"P. Kilpelainen","year":"1992","unstructured":"Kilpelainen, P., Mannila, H.: Grammatical Tree Matching. Lecture Notes in Computer Science644 (1992) 159\u2013171."},{"key":"48_CR3","unstructured":"Kilpelainen, P.: Tree Matching Problems with Applications to Structured Text Databases. Ph.D. Thesis, Department of Computer Science, University of Helsinki, 1992. Helsinki, Finland"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Smeaton, Alan F.: Incorporating Syntactic Information into a Document Retrieval Strategy: An Investigation. Proc. the 9\nthAnnual International ACM SIGIR Conference on Research and Development in Information Retrieval, 103\u2013113, 1986.","DOI":"10.1145\/253168.253193"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Smeaton, A. F. and van Rijsbergen, C. J.: Experiments on Incorporating Syntactic Processing of User Queries into a Document Retrieval Strategy. Proc. of the 11\nthInternational ACM-SIGIR Conference on Research and Development in Information Retrieval, pp. 31\u201354. Grenoble, France, 1988.","DOI":"10.1145\/62437.62439"},{"key":"48_CR6","unstructured":"Smeaton, A. F, O\u2019Donell, R. and Kelley, F.: Indexing Structures Derived from Syntax in TREC-3: System Description. Proc. of 3rd Text REtrieval Conference (TREC-3), D.K. Harman (ed.), NIST Special Publication, 1994."},{"key":"48_CR7","unstructured":"Vilares, M., Cabrero, D., Ribadas F. J.: Approximate matching in shared forest. Proc. of Sixth International Workshop on Natural Language Understanding and Logic Programming pp. 59\u201372, Las Cruces, NM (USA), 1999."},{"key":"48_CR8","unstructured":"Vilares, M., Dion, B. A.: Efficient incremental parsing for context-free languages. Proc. of the 5th IEEE International Conference on Computer Languages (1994) 241\u2013252, Toulouse, France."},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing (1989) 18 1245\u20131262.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"48_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"K. Zhang","year":"1994","unstructured":"Zhang, K. and Shasha, D. and Wang, J. T. L. Approximate Tree Matching in the Presence of Variable Length Don\u2019t Cares. Journal of Algorithms, pages 33\u201366, vol 16 (1), 1994","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computational Linguistics and Intelligent Text Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44686-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T02:07:27Z","timestamp":1588126047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44686-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416876","9783540446866"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44686-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"16 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}