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.
|Conference||Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology|
|Period||17/07/95 → 21/07/95|
|Other||17-21 July 1995|
- HMI-SLT: Speech and Language Technology