Robust Parsing Using Dynamic Programming
A robust parser for context-free grammars, based on a dynamic programming architecture, is described. We integrate a regional error repair algorithm and a strategy to deal with incomplete sentences including unknown parts of unknown length. Experimental tests prove the validity of the approach, illustrating the perspectives for its application in real systems over a variety of different situations, as well as the causes underlying the computational behavior observed.
Unable to display preview. Download preview PDF.
- A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, U. S.A., 1986.Google Scholar
- S.L. Graham, C. B. Haley, and W.N. Joy. Practical LR error recovery. In Proc. of the SIGPLAN 79 Symposium on Compiler Construction, pages 168–175. ACM, ACM, August 1979.Google Scholar
- B. Lang. Parsing incomplete sentences. In D. Vargha (ed.), editor, COLING’88, pages 365–371, Budapest, Hungary, 1988. vol. 1.Google Scholar
- K. Sikkel. Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands, 1993.Google Scholar
- M. Tomita and H. Saito. Parsing noisy sentences. In COLING’88, pages 561–566, Budapest, Hungary, 1988.Google Scholar
- M. Vilares. Efficient Incremental Parsing for Context-Free Languages. PhDthesis, University of Nice. ISBN 2-7261-0768-0, France, 1992.Google Scholar