We discuss the concept of robustness with respect to parsing or recognizing a context-free language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy context-free grammar, and parser/recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke-Youger-Kasami's algorithm and a robust kind of recursive descent recognizer. Keywords and phrases: fuzzy language, fuzzy context-free grammar, fuzzy context-free $K$-grammar, grammatical error, parsing/recognition of fuzzy languages, Cocke-Youger-Kasami's algorithm, recursive descent
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
This paper introduces a new grammatical framework, Fuzzy Property Grammars (FPGr). This is a model b...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
AbstractIn a companion paper [P.R.J. Asveld, Fuzzy context-free languages—Part 1: Generalized fuzzy ...
In a companion paper \cite{Asv:FCF1} we used fuzzy context-free grammars in order to model grammatic...
In a companion paper [P.R.J. Asveld, Fuzzy context-free languagesPart 1: Generalized fuzzy context-f...
AbstractMotivated by aspects of robustness in parsing a context-free language, we study generalized ...
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...
Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrec...
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...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
This paper introduces a new grammatical framework, Fuzzy Property Grammars (FPGr). This is a model b...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
We discuss the concept of robustness with respect to parsing a context-free language. Our approach i...
AbstractIn a companion paper [P.R.J. Asveld, Fuzzy context-free languages—Part 1: Generalized fuzzy ...
In a companion paper \cite{Asv:FCF1} we used fuzzy context-free grammars in order to model grammatic...
In a companion paper [P.R.J. Asveld, Fuzzy context-free languagesPart 1: Generalized fuzzy context-f...
AbstractMotivated by aspects of robustness in parsing a context-free language, we study generalized ...
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...
Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrec...
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...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
This paper introduces a new grammatical framework, Fuzzy Property Grammars (FPGr). This is a model b...
A fuzzy context-free $K$-grammar is a fuzzy context-free grammar with a countable rather than a fini...