Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1162/COLI_a_00090 | COMPUTATIONAL LINGUISTICS |
Keywords | Field | DocType |
computational linguistics,tree adjoining grammar | Tree-adjoining grammar,Context-sensitive grammar,Context-free grammar,L-attributed grammar,Subcategorization,Computer science,Lexical functional grammar,Artificial intelligence,Natural language processing,Linguistics,Lexical grammar,Mildly context-sensitive grammar formalism | Journal |
Volume | Issue | ISSN |
38 | 3 | 1530-9312 |
Citations | PageRank | References |
3 | 0.40 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Kuhlmann | 1 | 309 | 23.06 |
| Giorgio Satta | 2 | 902 | 90.85 |