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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Vilares, M., Darriba, V. M., Vilares, J., & Rodríguez, L. (2003). Robust parsing using dynamic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759, 258–268. https://doi.org/10.1007/3-540-45089-0_24
Mendeley helps you to discover research relevant for your work.