liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Tree-Adjoining Grammars are not Closed Under Strong Lexicalization
Uppsala universitet, Institutionen för lingvistik och filologi. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
University of Padua, Padua, Italy.
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
Abstract [en]

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.
National Category
Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
URN: urn:nbn:se:liu:diva-100295DOI: 10.1162/COLI_a_00090ISI: 000308083100006OAI: diva2:661428
Available from: 2012-01-09 Created: 2013-11-04 Last updated: 2014-10-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Kuhlmann, Marco
In the same journal
Computational linguistics - Association for Computational Linguistics (Print)
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link