{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:11:43Z","timestamp":1747714303997,"version":"3.40.5"},"reference-count":53,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T00:00:00Z","timestamp":1424390400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The two main classes of grammars are (a)<jats:italic>hand-crafted grammars<\/jats:italic>, which are developed by language experts, and (b)<jats:italic>data-driven grammars<\/jats:italic>, which are extracted from annotated corpora. This paper introduces a statistical method for mapping the elementary structures of a<jats:italic>data-driven grammar<\/jats:italic>onto the elementary structures of a<jats:italic>hand-crafted grammar<\/jats:italic>in order to combine their advantages. The idea is employed in the context of<jats:italic>Lexicalized Tree-Adjoining Grammars<\/jats:italic>(LTAG) and tested on two LTAGs of English: the hand-crafted LTAG developed in the XTAG project, and the data-driven LTAG, which is automatically extracted from the Penn Treebank and used by the MICA parser. We propose a statistical model for mapping any elementary tree sequence of the MICA grammar onto a proper elementary tree sequence of the XTAG grammar. The model has been tested on three subsets of the WSJ corpus that have average lengths of 10, 16, and 18 words, respectively. The experimental results show that full-parse trees with average<jats:italic>F<\/jats:italic><jats:sub>1<\/jats:sub>-scores of 72.49, 64.80, and 62.30 points could be built from 94.97%, 96.01%, and 90.25% of the XTAG elementary tree sequences assigned to the subsets, respectively. Moreover, by reducing the amount of<jats:italic>syntactic lexical ambiguity<\/jats:italic>of sentences, the proposed model significantly improves the efficiency of parsing in the XTAG system.<\/jats:p>","DOI":"10.1017\/s1351324915000017","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T15:36:00Z","timestamp":1424446560000},"page":"215-255","source":"Crossref","is-referenced-by-count":0,"title":["A statistical model for grammar mapping"],"prefix":"10.1017","volume":"22","author":[{"given":"A.","family":"BASIRAT","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"FAILI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"NIVRE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,2,20]]},"reference":[{"key":"S1351324915000017_ref052","first-page":"1","volume-title":"Proceedings of LREC satellite workshop Using Evaluation within HLT Programs: Results and Trends","author":"Xia","year":"2000"},{"key":"S1351324915000017_ref026","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850223"},{"key":"S1351324915000017_ref041","first-page":"133","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing","author":"Ratnaparkhi","year":"1996"},{"key":"S1351324915000017_ref050","first-page":"398","volume-title":"Proceedings of the 5th Natural Language Processing Pacific Rim Symposium","author":"Xia","year":"1999"},{"key":"S1351324915000017_ref046","first-page":"479","article-title":"Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced","volume":"21","author":"Schabes","year":"1995","journal-title":"Computational Linguistics"},{"key":"S1351324915000017_ref018","doi-asserted-by":"crossref","unstructured":"DeNeefe S. , and Knight K. , 2009. Synchronous tree adjoining machine translation. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, EMNLP 2009, Association for Computational Linguistics. Singapore. vol. 2, pp. 727\u2013736.","DOI":"10.3115\/1699571.1699607"},{"key":"S1351324915000017_ref035","unstructured":"Kroch A. S. , and Joshi A. K. 1985. The linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-16. Department of Computer and Information Science, University of Pennsylvania."},{"key":"S1351324915000017_ref051","unstructured":"Xia F. 2001. Automatic grammar generation from two different perspectives, Ph.D. thesis, University of Pennsylvania."},{"key":"S1351324915000017_ref010","first-page":"303","volume-title":"Proceedings of the 20th International Conference on Computational Linguistics","author":"Bonfante","year":"2004"},{"key":"S1351324915000017_ref024","first-page":"1635","volume-title":"Proceedings of the 3rd International Conference on Language Resources and Evaluation","author":"Han","year":"2002"},{"key":"S1351324915000017_ref013","unstructured":"Chen J. 2001. Toward efficient statistical parsing using lexicalized grammatical information, Ph.D. thesis, University of Delaware."},{"key":"S1351324915000017_ref037","first-page":"1","article-title":"Detecting and correcting syntactic errors in machine translation using feature-based lexicalized tree adjoining grammars","volume":"17","author":"Ma","year":"2012","journal-title":"International Journal of Computational Linguistics and Chinese Language Processing (IJCLCLP)"},{"key":"S1351324915000017_ref039","first-page":"73","volume-title":"Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop","author":"Park","year":"2006"},{"key":"S1351324915000017_ref029","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0572-2_9"},{"key":"S1351324915000017_ref009","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697196"},{"key":"S1351324915000017_ref028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"S1351324915000017_ref027","first-page":"296","volume-title":"Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning","author":"Johnson","year":"2007"},{"key":"S1351324915000017_ref049","first-page":"198","volume-title":"Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics","author":"Stone","year":"1997"},{"volume-title":"Complexity of Lexical Descriptions and its Relevance to Natural Language Processing: A Supertagging Approach","year":"2007","author":"Sarkar","key":"S1351324915000017_ref043"},{"key":"S1351324915000017_ref045","doi-asserted-by":"publisher","DOI":"10.3115\/982023.982055"},{"key":"S1351324915000017_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0201-1_10"},{"key":"S1351324915000017_ref002","first-page":"306","volume-title":"Proceedings of the Workshop on Speech and Natural Language, ACL 1991","author":"Abney","year":"1991"},{"key":"S1351324915000017_ref003","first-page":"237","article-title":"Supertagging: an approach to almost parsing","volume":"25","author":"Bangalore","year":"1999","journal-title":"Computational Linguistics"},{"key":"S1351324915000017_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2013.02.001"},{"key":"S1351324915000017_ref004","first-page":"70","volume-title":"Proceedings of the 8th European Summer School In Logic, Language and Information","author":"Bangalore","year":"1996"},{"key":"S1351324915000017_ref006","first-page":"185","volume-title":"Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers","author":"Bangalore","year":"2009"},{"key":"S1351324915000017_ref007","first-page":"63","volume-title":"Proceedings of International Conference on Recent Advances in Natural Language Processing","author":"Basirat","year":"2011"},{"key":"S1351324915000017_ref011","unstructured":"Boullier P. , and Deschamp P. 1988. Le systeme SYNTAX\u2122 manuel d\u2019utilisation et de mise en oeuvre sous UNIX\u2122. http:\/\/syntax.gforge.inria.fr\/syntax3.8-manual.pdf."},{"key":"S1351324915000017_ref015","first-page":"1","volume-title":"Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms","author":"Chiang","year":"2006"},{"key":"S1351324915000017_ref012","first-page":"27","volume-title":"Proceedings of AAAI Symposium on NLP for the World Wide Web","author":"Chandrasekar","year":"1997"},{"key":"S1351324915000017_ref014","first-page":"456","volume-title":"Proceedings of the 38th Annual Meeting on Association for Computational Linguistics","author":"Chiang","year":"2000"},{"key":"S1351324915000017_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(59)90362-6"},{"key":"S1351324915000017_ref017","doi-asserted-by":"publisher","DOI":"10.3115\/992730.992795"},{"key":"S1351324915000017_ref019","doi-asserted-by":"crossref","unstructured":"Eddy B. , Bental D. , and Cawsey A. , 2001. An algorithm for efficiently generating summary paragraphs using tree-adjoining grammar. In Proceedings of the 8th European workshop on Natural Language Generation, EWNLG 2001, Association for Computational Linguistics. Toulouse, France. vol. 8, pp. 1\u20138.","DOI":"10.3115\/1117840.1117846"},{"key":"S1351324915000017_ref020","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024137719751"},{"key":"S1351324915000017_ref022","first-page":"123","volume-title":"Proceedings of the 10th Conference on European Chapter of the Association for Computational Linguistics","author":"Gardent","year":"2003"},{"key":"S1351324915000017_ref025","doi-asserted-by":"publisher","DOI":"10.3115\/116580.116613"},{"key":"S1351324915000017_ref034","first-page":"691","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000) and Twelfth Conference on Innovative Applications of Artificial Intelligence","author":"Kipper","year":"2000"},{"key":"S1351324915000017_ref005","unstructured":"Bangalore S. , Haffner P. , and Emami G. 2005. Factoring global inference by enriching local representations. Technical Report, AT&T Labs - Research."},{"key":"S1351324915000017_ref030","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511597855.007"},{"key":"S1351324915000017_ref031","unstructured":"Kaeshammer M. 2012. A German Treebank and Lexicon for Tree-Adjoining Grammars, Master thesis. Saarland University."},{"key":"S1351324915000017_ref032","first-page":"782","volume-title":"Proceedings of the 6th International Conference on Language Resources and Evaluation","author":"Kallmeyer","year":"2008"},{"key":"S1351324915000017_ref036","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505242"},{"key":"S1351324915000017_ref038","first-page":"313","article-title":"Building a arge annotated corpus of English: the penn treebank","volume":"19","author":"Marcus","year":"1993","journal-title":"Computational Linguistics - Special issue on using large corpora"},{"volume-title":"Head-Driven Phrase Structure Grammar","year":"1994","author":"Pollard","key":"S1351324915000017_ref040"},{"key":"S1351324915000017_ref042","first-page":"194","volume-title":"Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms","author":"Ryant","year":"2004"},{"key":"S1351324915000017_ref044","first-page":"173","article-title":"Tree-adjoining grammar parsing and boolean matrix multiplication","volume":"20","author":"Satta","year":"1994","journal-title":"Computational Linguistics"},{"volume-title":"Phrase Structure Composition and Syntactic Dependencies","year":"2004","author":"Frank","key":"S1351324915000017_ref021"},{"key":"S1351324915000017_ref047","doi-asserted-by":"publisher","DOI":"10.3115\/991146.991191"},{"key":"S1351324915000017_ref033","first-page":"173","volume-title":"The mental representation of grammatical relations","author":"Kaplan","year":"1982"},{"key":"S1351324915000017_ref048","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6591.001.0001","volume-title":"The Syntactic Process","author":"Steedman","year":"2000"},{"key":"S1351324915000017_ref053","unstructured":"XTAG-Group. 2001. A Lexicalized Tree Adjoining Grammar for English. Technical report IRCS 01\u201303, Institute for Research in Cognitive Science, University of Pennsylvania."},{"key":"S1351324915000017_ref023","doi-asserted-by":"publisher","DOI":"10.3115\/981863.981887"}],"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324915000017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T20:26:16Z","timestamp":1747686376000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324915000017\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,20]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["S1351324915000017"],"URL":"https:\/\/doi.org\/10.1017\/s1351324915000017","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"type":"print","value":"1351-3249"},{"type":"electronic","value":"1469-8110"}],"subject":[],"published":{"date-parts":[[2015,2,20]]}}}