Algorithm schemata and data structures in syntactic processing
Readings in natural language processing
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Computational properties of principle-based grammatical theories
Computational properties of principle-based grammatical theories
Computational Linguistics
Lexicalized context-free grammars
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Parsing with discontinuous phrases
Natural Language Engineering
Unscrambling English word order
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper describes a method for ensuring the termination of parsers using grammars that freely posit empty nodes. The basic idea is that each empty node must be associated with a lexical item appearing in the input string, called its sponsor. A lexical item, as well as labeling the node for the corresponding word, provides labels for a fixed number, possibly zero, of empty nodes. The number of nodes appearing in the parse tree is thus bounded before parsing begins. Termination follows trivially. The technique is applicable to any standard parsing algorithm.