Parsing Incomplete Sentences Revisited

We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown parts of unknown length. It produces a finite shared-forest compiling all parses, often infinite in number, that could account for both the error and the missing parts.

[1]  Masaru Tomita,et al.  Parsing noisy sentences , 1988, COLING.

[2]  Manuel Vilares Ferro,et al.  Efficient incremental parsing for context-free languages , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[3]  Klaas Sikkel,et al.  Parsing Schemata , 1997, Texts in Theoretical Computer Science An EATCS Series.

[4]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[5]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[6]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7]  R. Stainton.  The Meaning of 'Sentences' , 2000 .

[8]  Andreas Stolcke,et al.  Linguistic Knowledge and Empirical Methods in Speech Recognition , 1997, AI Mag..

[9]  LanguagesManuel Vilares Ferro,et al.  Eecient Incremental Parsing for Context-free Languages , 1992 .

[10]  Bernard Lang,et al.  Parsing Incomplete Sentences , 1988, COLING.