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


Asveld, Peter R.J. (2005) Fuzzy context-free languages. Part 1: Generalized fuzzy context-free grammars. Theoretical Computer Science, 347 (1-2). pp. 167-190. ISSN 0304-3975

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These fuzzy context-free K-grammars provide a 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 K-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 K of fuzzy languages. We investigate the generating power of fuzzy context-free K-grammars, and we show that under minor assumptions on the parameter K, the family of languages generated by fuzzy context-free K-grammars possesses closure properties very similar to those of the family of ordinary context-free languages.

Item Type:Article
Copyright:© 2005 Elsevier
Research Group:
Link to this item:http://purl.utwente.nl/publications/53904
Official URL:https://doi.org/10.1016/j.tcs.2005.06.012
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 227288