Paper: Parsing Incomplete Sentences

ACL ID C88-1075
Title Parsing Incomplete Sentences
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1988

An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It pa'oduees in finite form all possible parses (of- ten infinite in number) that could account for the missing parts. The algorithm is a variation oa the construction due to Earley. ltowever, its presentation is such that it can readily be adapted to any chart parsing schema (top- down, bottom-up, etc...).