论文信息 - Técnicas Deductivas para el Análisis Sintáctico con Corrección de Errores

Técnicas Deductivas para el Análisis Sintáctico con Corrección de Errores

We introduce error-correcting parsing schemata, which allow us to define error-correcting parsers in a high-level, declarative way. This formalism can be used to describe error-correcting parsers in a simple and uniform manner, and provides a formal basis allowing to prove their correctness and other properties. We also show how these schemata can be used to obtain different implementations of the parsers, including variants based on regional error correction.

Miguel A. Alonso | Manuel Vilares Ferro | Carlos Gómez-Rodríguez

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

[2] Robert C. Moore,et al. Improved Left-corner Chart Parsing for Large Context-free Grammars , 2000, IWPT.

[3] Stuart M. Shieber,et al. Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[4] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[5] Klaas Sikkel,et al. Parsing Schemata and Correctness of Parsing Algorithms , 1998, Theor. Comput. Sci..

[6] Klaas Sikkel,et al. Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms , 2002 .

[7] Manuel Vilares Ferro,et al. Regional Least-Cost Error Repair , 2000, CIAA.

[8] Miguel A. Alonso,et al. Automatic Generation of Natural Language Parsers from Declarative Specifications , 2006, STAIRS.

[9] Gordon Lyon,et al. Syntax-directed least-errors analysis for context-free languages , 1974, Commun. ACM.