Fuzzy contextfree languages. Part 1: Generalized fuzzy contextfree grammars
Asveld, Peter R.J. (2005) Fuzzy contextfree languages. Part 1: Generalized fuzzy contextfree grammars. Theoretical Computer Science, 347 (12). pp. 167190. ISSN 03043975
PDF Restricted to UT campus only: Request a copy 288Kb 
Abstract:  Motivated by aspects of robustness in parsing a contextfree language, we study generalized fuzzy contextfree grammars. These fuzzy contextfree Kgrammars 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 contextfree derivation step. Formally, a fuzzy contextfree Kgrammar is a fuzzy contextfree grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol , the set containing all righthand sides of rules with lefthand side equal to forms a fuzzy language that belongs to a given family K of fuzzy languages. We investigate the generating power of fuzzy contextfree Kgrammars, and we show that under minor assumptions on the parameter K, the family of languages generated by fuzzy contextfree Kgrammars possesses closure properties very similar to those of the family of ordinary contextfree languages.

Item Type:  Article 
Copyright:  © 2005 Elsevier 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/53904 
Official URL:  http://dx.doi.org/10.1016/j.tcs.2005.06.012 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page
Metis ID: 227288