Nonminimal Derivations in Unification-based Parsing
Bibliographic Data
| ID | 12155658 |
|---|---|
| Authors | Noriko Tomuro (0009-0009-8673-5078, DePaul University, corresponding author), Steven L Lytinen (DePaul University) |
| Year | 2001 |
| Volume | 27 |
| Issue | 2 |
| Pages | 277-285 |
| Publication date | 2001-06-01 |
| 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/089120101750300535 |
| OpenAlex | W2133984075 |
| Language | EN |
| References cited | 3 |
Shieber's abstract parsing algorithm (Shieber 1992) for unification grammars is an extension of Earley's algorithm (Earley 1970) for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber's algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While Shieber's definition of parse tree allows for such nonminimal derivations, we claim that they should be viewed as invalid. We describe the sources of the nonminimal derivation problem, and propose a precise definition of minimal parse tree, as well as a modification to Shieber's algorithm which ensures minimality, although at some computational cost
Algorithm · Combinatorics · Context (archaeology · Context-free grammar · Extension (predicate logic · Feature (linguistics · L-attributed grammar · Linguistics · Natural language processing · Parse tree · Parsing · Programming language · Rule-based machine translation · S-attributed grammar · Tree (set theory · Unification · Computer Science · Logic, programming, and type systems · Mathematics · Natural Language Processing Techniques · semigroups and automata theory · Artificial Intelligence · Theoretical Computer Science
| Highly cited | No |
|---|