A recursive ascent Earley parser
Information Processing Letters
Fuzzy grammars and recursively enumerable fuzzy languages
Information Sciences: an International Journal
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
A Supernormal-Form Theorem for Context-Free Grammars
Journal of the ACM (JACM)
A fuzzy grammar and possibility theory-based natural language user interface for spatial queries
Fuzzy Sets and Systems - Special issue on Uncertainty in geographic information systems and spatial data
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Controlled Fuzzy Parallel Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
Theoretical Computer Science
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
Theoretical Computer Science
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
A fast fuzzy Cocke-Younger-Kasami algorithm for DNA and RNA strings analysis
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
| Hi-index | 5.23 |
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.