Tree-Adjoining Grammars are not Closed Under Strong Lexicalization
2012 (English)In: Computational linguistics - Association for Computational Linguistics (Print), ISSN 0891-2017, E-ISSN 1530-9312, Vol. 38, no 3, 617-629 p.Article in journal (Refereed) Published
A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version. We show that such a procedure does not exist: Tree-adjoining grammars are not closed under strong lexicalization.
Place, publisher, year, edition, pages
Cambridge, MA, USA: MIT Press, 2012. Vol. 38, no 3, 617-629 p.
Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:liu:diva-100295DOI: 10.1162/COLI_a_00090ISI: 000308083100006OAI: oai:DiVA.org:liu-100295DiVA: diva2:661428