In a companion paper [P.R.J. Asveld, Fuzzy context-free languagesPart 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).\ud \ud 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...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
In a companion paper \cite{Asv:FCF1} we used fuzzy context-free grammars in order to model grammatic...
AbstractIn a companion paper [P.R.J. Asveld, Fuzzy context-free languages—Part 1: Generalized fuzzy ...
We discuss the concept of robustness with respect to parsing or recognizing a context-free language....
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
AbstractMotivated by aspects of robustness in parsing a context-free language, we study generalized ...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrec...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
Traditional parsing has always been a focus of discussion among the computer science community. Nume...
Traditional parsing has always been a focus of discussion among the computer science community. Nume...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
In a companion paper \cite{Asv:FCF1} we used fuzzy context-free grammars in order to model grammatic...
AbstractIn a companion paper [P.R.J. Asveld, Fuzzy context-free languages—Part 1: Generalized fuzzy ...
We discuss the concept of robustness with respect to parsing or recognizing a context-free language....
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy co...
AbstractMotivated by aspects of robustness in parsing a context-free language, we study generalized ...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrec...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
Traditional parsing has always been a focus of discussion among the computer science community. Nume...
Traditional parsing has always been a focus of discussion among the computer science community. Nume...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...