### Abstract

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.

Original language | Undefined |
---|---|

Title of host publication | Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology |

Editors | J. Dassow, G. Rozenberg, A. Salomaa |

Place of Publication | Singapore |

Publisher | World Scientific |

Pages | 443-453 |

Number of pages | 11 |

ISBN (Print) | 981-02-2682-9 |

Publication status | Published - 1996 |

### Publication series

Name | |
---|---|

Publisher | World Scientific |

### Keywords

- EWI-2755
- MSC-68Q52
- IR-18777
- MSC-03E72
- METIS-119299
- HMI-SLT: Speech and Language Technology

## Cite this

Asveld, P. R. J. (1996). Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition. In J. Dassow, G. Rozenberg, & A. Salomaa (Eds.),

*Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology*(pp. 443-453). Singapore: World Scientific.