{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:22:00Z","timestamp":1725520920387},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1109\/grc.2007.113","type":"proceedings-article","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T13:13:14Z","timestamp":1209388394000},"page":"703-703","source":"Crossref","is-referenced-by-count":1,"title":["Syntactic Information Retrieval"],"prefix":"10.1109","author":[{"given":"Chang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sally","family":"Mcclean","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shengli","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.126"},{"key":"17","article-title":"An Optimal Decomposition Algorithm for Tree Edit Distance","author":"demaine","year":"2007","journal-title":"Proceedings of the 34th International Colloquium on Automata Languages and Programming (ICALP"},{"year":"2007","key":"18","article-title":"All Common Subtrees. Technical Report, University of Ulster"},{"year":"0","key":"15"},{"key":"16","first-page":"91","article-title":"Computing the edit-distance between unrooted ordered trees","author":"klein","year":"1998","journal-title":"Proceedings of the 6th annual European Symposium on Algorithms (ESA)"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.3115\/981574.981590"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"11","article-title":"Parsing English with a Link Grammar","author":"sleator","year":"1993","journal-title":"Proc 3rd Int Workshop Parsing Technologies"},{"year":"0","key":"12"},{"journal-title":"Modern Information Retrieval","year":"1999","author":"baeza-yates","key":"3"},{"year":"0","key":"20"},{"journal-title":"Information retrieval A survey","year":"2000","author":"greengrass","key":"2"},{"year":"0","key":"1"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(98)00030-2"},{"year":"0","key":"6"},{"key":"5","article-title":"An Analysis of Statistical and Syntactic Phrases","author":"mitra","year":"1997","journal-title":"Proceedings of RIAO-97 5th International Conference"},{"year":"0","key":"4"},{"year":"0","key":"9"},{"journal-title":"Dependency Syntax Theory and Practice","year":"1988","author":"melcuk","key":"8"}],"event":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","start":{"date-parts":[[2007,11,2]]},"location":"Fremont, CA, USA","end":{"date-parts":[[2007,11,4]]}},"container-title":["2007 IEEE International Conference on Granular Computing (GRC 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4403044\/4403045\/04403191.pdf?arnumber=4403191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T15:50:53Z","timestamp":1489679453000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4403191\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/grc.2007.113","relation":{},"subject":[],"published":{"date-parts":[[2007,11]]}}}