Paper: An Efficient Chart-Based Algorithm For Partial-Parsing Of Unrestricted Texts

ACL ID A92-1027
Title An Efficient Chart-Based Algorithm For Partial-Parsing Of Unrestricted Texts
Venue Applied Natural Language Processing Conference
Session Main Conference
Year 1992
Authors

In the rest of this section we will look at some of the We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tai- lored to the problem of extracting specific information from unrestricted texts where many of the words are un- known and much of the text is irrelevant to the task. The parser gains algorithmic efficiency through a reduc- tion 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 con- ventional 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 throu...