Name
Abstract | ||
|---|---|---|
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts . It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top-down, bottom-up, etc...). |
Year | DOI | Venue |
|---|---|---|
1988 | 10.3115/991635.991710 | International Conference on Computational Linguistics |
Keywords | Field | DocType |
unknown part,missing part,incomplete sentence,efficient context-free,finite form,possible parses,unknown length,bottom up,top down | Top-down parsing,S-attributed grammar,Pattern recognition,Computer science,Speech recognition,Bottom-up parsing,Chart,Natural language processing,Artificial intelligence,Parsing,Parser combinator,Schema (psychology) | Conference |
ISBN | Citations | PageRank |
9638431563 | 19 | 2.32 |
References | Authors | |
16 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Lang | 1 | 237 | 27.63 |