Combining lexicon-driven parsing and phrase-structure-based parsing

Authors:
Musuru Tomlta
Affiliations:
Carnegie-Mellon University, Pittsburgh, PA
Venue:
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Year:
1988

Citing 2
Cited 1

An efficient augmented-context-free parsing algorithm

Computational Linguistics
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Automatic indexing and Government-Binding Theory

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lexicon-driven formalisms (e.g. Categorial Grammar; HPSG and GB Grammar), which do not have explicit phrase structure rules, are suitable for higher level syntax but not for low level language-specific constructions such as dates (July 15th, 15-JUL-1987, etc), which seem to require the power of phrase structure rules. This paper presents an implementation method to combine lexicon-driven parsing and phrase structure parsing, with a special means called graph-structured stack.