# Fuzzy context-free languages. Part 1: Generalized fuzzy context-free grammars

Asveld, Peter R.J.
(2000)
*Fuzzy context-free languages. Part 1: Generalized fuzzy context-free grammars.*
[Report]

PDF
Restricted to UT campus only 231kB |

Abstract: | Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These so-called fuzzy context-free -grammars provide a very general framework to describe correctly as well as erroneously derived sentences by a single generating mechanism. They model the situation of making a finite choice out of an infinity of possible grammatical errors during each context-free derivation step. Formally, a fuzzy context-free -grammar is a fuzzy context-free grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol , the set containing all right-hand sides of rules with left-hand side equal to forms a fuzzy language that belongs to a given family of fuzzy languages. We investigate the generating power of fuzzy context-free -grammars, and we show that under minor assumptions on the parameter , the family of languages generated by fuzzy context-free -grammars possesses closure properties very similar to those of the family of ordinary context-free languages. |

Item Type: | Report |

Additional information: | Formal language, fuzzy context-free grammar, grammatical error, algebraic closure property |

Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |

Research Group: | |

Link to this item: | http://purl.utwente.nl/publications/63133 |

Export this item as: | BibTeX EndNote HTML Citation Reference Manager |

Repository Staff Only: item control page

Metis ID: 118712