Algorithm schemata and data structures in syntactic processing
Readings in natural language processing
Robust partial-parsing through incremental, multi-algorithm processing
Text-based intelligent systems
An efficient context-free parsing algorithm
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
Parsing with a small dictionary for applications such as text to speech
Computational Linguistics
Deterministic parsing of syntactic non-fluencies
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
The view from the trenches: issues in the ontology of restricted domains
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Machine Translation
Issues in the choice of a source for natural language generation
Computational Linguistics - Special issue on using large corpora: I
Understanding unsegmented user utterances in real-time spoken dialogue systems
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Integrated techniques for phrase extraction from speech
HLT '94 Proceedings of the workshop on Human Language Technology
Statistical language modeling combining N-gram and context-free grammars
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Towards a framework for abstractive summarization of multimodal documents
HLT-SS '11 Proceedings of the ACL 2011 Student Session
Improving the accessibility of line graphs in multimodal documents
SLPAT '11 Proceedings of the Second Workshop on Speech and Language Processing for Assistive Technologies
| Hi-index | 0.00 |
We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tailored to the problem of extracting specific information from unrestricted texts where many of the words are unknown and much of the text is irrelevant to the task. The parser gains algorithmic efficiency through a reduction of its search space. As each new edge is added to the chart, the algorithm checks only the topmost of the edges adjacent to it, rather than all such edges as in conventional treatments. The resulting spanning edges are insured to be the correct ones by carefully controlling the order in which edges are introduced so that every final constituent covers the longest possible span. This is facilitated through the use of phrase boundary heuristics based on the placement of function words, and by heuristic rules that permit certain kinds of phrases to be deduced despite the presence of unknown words. A further reduction in the search space is achieved by using semantic rather than syntactic categories on the terminal and nonterminal edges, thereby reducing the amount of ambiguity and thus the number of edges, since only edges with a valid semantic interpretation are ever introduced.