We discuss the concept of robustness with respect to parsing 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-Younger-Kasami's algorithm and a robust kind of recursive descent recognizer.
|Number of pages||10|
|Journal||The Fibonacci Quarterly|
|Publication status||Published - 1995|
- HMI-SLT: Speech and Language Technology