Abstract
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.
| Original language | Undefined |
|---|---|
| Pages (from-to) | - |
| Number of pages | 10 |
| Journal | The Fibonacci Quarterly |
| Volume | 25 |
| Issue number | 95-08 |
| Publication status | Published - 1995 |
Keywords
- EWI-10891
- IR-64292
- METIS-118478
- HMI-SLT: Speech and Language Technology