A Parallel Minimum Distance Error--Correcting Context--Free Parser
by Giovanni Pighizzini
http://homes.dsi.unimi.it/~pighizzi/pubbl/aq/aq.ps.gz
Add To MetaCart
Abstract:
In this paper we present the first parallel minimum distance error--correcting parser for context--free languages. The error correction is performed considering three kinds of syntax errors: the mutation of a symbol in another incorrect symbol, the insertion of an extraneous symbol and the deletion of a symbol. Our algorithm has the same parallel complexity of other well--known non--correcting context--free parsers such as developed in [Ruz80, GR88]. Further, with respect to these algorithms it has the advantage of working with every context--free grammar and not just with grammars in Chomsky Normal Form. The algorithm is developed using dynamic programming techniques. 1
Citations
| 2771 | Introduction to Automata Theory, Languages and Computation – Hopcroft, Ullman - 1979 |
| 1399 | Dynamic Programming – Bellman - 1957 |
| 508 | An Efficient Context-Free Parsing Algorithm – Earley - 1970 |
| 281 | Parallel algorithms for shared-memory machines – Karp, Ramachandran - 1990 |
| 166 | Efficient parallel algorithms – Gibbons - 1988 |
| 74 | An Improved Context-Free Recognizer – Graham, Harrison, et al. - 1980 |
| 38 | A Minimum Distance Error-Correcting Parser for Context-Free Languages – Aho, Peterson - 1972 |
| 14 | An error-correcting parse algorithm – Irons - 1963 |
| 13 | An optimal sublinear time parallel algorithm for some dynamic programming problems – Larmore - 1994 |
| 1 | A parallel general context--free parser – Bruschi, Pighizzini - 1992 |
