Parsing incomplete sentences
Open Access
- 1 January 1988
- conference paper
- Published by Association for Computational Linguistics (ACL)
- p. 365-371
- https://doi.org/10.3115/991635.991710
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...).Keywords
This publication has 0 references indexed in Scilit: