Abstract
We work in the domain of a regional least-cost strategy with dynamic validation in order to avoid cascaded errors [3], extending the theoretical model to illustrate its asymptotic equivalence with global repair algorithms. This is an objective criterion to measure the quality of an error repair algorithm, since the point of reference is a technique that guarantees the best quality for a given error metric when all contextual information is available. To the best of our knowledge, it is the first time that such a discussion takes place. We also reformulate the parsing framework using parsing schemata [1], simplifying the description.
Research partially supported by the Spanish Government under projects TIC2000- 0370-C02-01 and HP2001-0044, and the Autonomous Government of Galicia under project PGIDT01PXI10506PN.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Sikkel. Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands, 1993.
M. Vilares. Efficient Incremental Parsing for Context-Free Languages. PhD thesis, University of Nice. ISBN 2-7261-0768-0, France, 1992.
M. Vilares, V.M. Darriba, and F.J. Ribadas. Regional least-cost error repair. In S. Yu and A. Pâun, editors, Implementation and Application of Automata, volume 2088 of LNCS, pages 293–301. Springer-Verlag, Berlin-Heidelberg-New York, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilares, M., Darriba, V.M., Alonso, M.A. (2003). Searching for Asymptotic Error Repair. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive