Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
Bibliographic Data
| ID | 12156294 |
|---|---|
| Authors | Rebecca Nesson (Harvard University, corresponding author), Giorgio Satta (0000-0001-7742-6438, Department of Information Engineering University of Padua), Stuart M Shieber (0000-0002-7733-8195, School of Engineering and Applied Sciences Harvard University) |
| Year | 2010 |
| Volume | 36 |
| Issue | 3 |
| Pages | 443-480 |
| Publication date | 2010-07-27 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Computational Linguistics (JOURNAL) |
| Journal identifiers | ISSN: 0891-2017 • E-ISSN: 1530-9312 |
| Publisher | Association for Computational Linguistics (PUBLISHER • US) |
| DOI | 10.1162/coli_a_00005 |
| OpenAlex | W2128505798 |
| Language | EN |
| References cited | 10 |
Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of locality within its elementary structures. Its multicomponent structure allows modeling of lexical items that may ultimately have elements far apart in a sentence, such as quantifiers and wh-words. When used as the base formalism for a synchronous grammar, its flexibility allows it to express both the close relationships and the divergent structure necessary to capture the links between the syntax and semantics of a single language or the syntax of two different languages. Its limited expressivity provides constraints on movement and, we posit, may have generated additional popularity based on a misconception about its parsing complexity. Although TL-MCTAG was shown to be equivalent in expressivity to TAG when it was first introduced, the complexity of TL-MCTAG is still not well understood. This article offers a thorough examination of the problem of TL-MCTAG recognition, showing that even highly restricted forms of TL-MCTAG are NP-complete to recognize. However, in spite of the provable difficulty of the recognition problem, we offer several algorithms that can substantially improve processing efficiency. First, we present a parsing algorithm that improves on the baseline parsing method and runs in polynomial time when both the fan-out and rank of the input grammar are bounded. Second, we offer an optimal, efficient algorithm for factorizing a grammar to produce a strongly equivalent TL-MCTAG grammar with the rank of the grammar minimized
Context-free grammar · Emergent grammar · Generalized phrase structure grammar · Generative grammar · Grammar · Linguistics · Natural language processing · Parse tree · Parsing · Relational grammar · Tree-adjoining grammar · Algorithms and Data Compression · Computer Science · Natural Language Processing Techniques · semigroups and automata theory · Artificial Intelligence · Theoretical Computer Science
| Highly cited | No |
|---|