Abstract
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.
In contrast to previous works, we derive profit from a finer dynamic programming construction, leading to an improved computational behavior. We also introduce a deductive construction, which has the advantage of simplifying the task of description.
Research partially supported by the Spanish Government under projects TIC2000-0370-C02-01 and HP2002-0081, and the Autonomous Government of Galicia under projects PGIDT01PXI10506PN, PGIDIT02PXIB30501PR and PGIDIT02SIN01E.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, Inc., Reading (1986)
Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13(2), 94–102 (1970)
Lang, B.: Parsing incomplete sentences. In: Vargha, D. (ed.) COLING 1988, Budapest, Hungary, vol. 1, pp. 365–371 (1988)
Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In: Loeckx, J. (ed.) Automata, Languages and Programming. LNCS, vol. 14, pp. 255–269. Springer, Berlin (1974)
Sikkel, K.: Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands (1993)
Stainton, R.S.: The meaning of ‘sentences’. Noûs 34(3), 441–454 (2000)
Stolcke, A.: Linguistic knowledge and empirical methods in speech recognition. The AI Magazine 18(4), 25–31 (1998)
Tomita, M., Saito, H.: Parsing noisy sentences. In: COLING 1988, Budapest, Hungary, pp. 561–566 (1988)
Vilares, M.: Efficient Incremental Parsing for Context-Free Languages. PhD thesis, University of Nice, France (1992); ISBN 2-7261-0768-0
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilares, M., Darriba, V.M., Vilares, J. (2004). Parsing Incomplete Sentences Revisited. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2004. Lecture Notes in Computer Science, vol 2945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24630-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24630-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21006-1
Online ISBN: 978-3-540-24630-5
eBook Packages: Springer Book Archive