Fuzzy context-free languages - Part 2: Recognition and parsing algorithms

In a companion paper [P.R.J. Asveld, Fuzzy context-free languages--Part 1: Generalized fuzzy context-free grammars, Theoret. Comput. Sci. (2005)] we used fuzzy context-free grammars in order to model grammatical errors resulting in erroneous inputs for robust recognizing and parsing algorithms for fuzzy context-free languages. In particular, this approach enables us to distinguish between small errors ("tiny mistakes") and big errors ("capital blunders").In this paper, we present some algorithms to recognize fuzzy context-free languages: particularly, a modification of Cocke-Younger-Kasami's algorithm and some recursive descent algorithms. Then we extend these recognition algorithms to corresponding parsing algorithms for fuzzy context-free languages. These parsing algorithms happen to be robust in some very elementary sense.

[1]  Gheorghe Paun,et al.  New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday) , 1997 .

[2]  Peter R.J. Asveld,et al.  A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition , 1995, IWPT.

[3]  Grzegorz Rozenberg,et al.  Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995 , 1996, Developments in Language Theory.

[4]  Antinus Nijholt,et al.  The CYK approach to serial and parallel parsing , 1990 .

[5]  Peter R.J. Asveld,et al.  The Non-Self-Embedding Property for Generalized Fuzzy Context-Free Grammars , 1996 .

[6]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[7]  Jun'ichi Toyoda,et al.  L-fuzzy grammars , 1975, Inf. Sci..

[8]  Lotfi A. Zadeh,et al.  Note on fuzzy languages , 1969, Inf. Sci..

[9]  Peter R. J. Asveld,et al.  Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars , 2000, Theor. Comput. Sci..

[10]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[11]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[12]  Giangiacomo Gerla,et al.  Fuzzy grammars and recursively enumerable fuzzy languages , 1992, Inf. Sci..

[13]  Peter R. J. Asveld,et al.  Algebraic aspects of families of fuzzy languages , 2001, Theor. Comput. Sci..

[14]  Livio Colussi,et al.  A Divide-and-Conquer Approach to General Context-Free Parsing , 1983, Inf. Process. Lett..

[15]  Anton Nijholt.  Overview of Parallel Parsing Strategies , 1991 .

[16]  Fangju Wang,et al.  A fuzzy grammar and possibility theory-based natural language user interface for spatial queries , 2000, Fuzzy Sets Syst..

[17]  Peter R. J. Asveld,et al.  Controlled Fuzzy Parallel Rewriting , 1997, New Trends in Formal Languages.

[18]  op den Akker,et al.  Recognition methods for context-free languages , 1991 .

[19]  Derick Wood,et al.  A Supernormal-Form Theorem for Context-Free Grammars , 1983, JACM.

[20]  Masaru Tomita.  Current Issues in Parsing Technology , 1990 .

[21]  Peter R. J. Asveld.  An Alternative Formulation of Cocke-Younger-Kasami's Algorithm , 1994, Bull. EATCS.

[22]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[23]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[25]  Peter R. J. Asveld,et al.  Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition , 1995, Developments in Language Theory.

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

[27]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[28]  Jun'ichi Toyoda,et al.  Examples of Formal Grammars with Weights , 1973, Inf. Process. Lett..

[29]  René Leermakers,et al.  A Recursive Ascent Earley Parser , 1992, Inf. Process. Lett..