An inference method for fuzzy tree grammars
β Scribed by Lan Shu
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 82 KB
- Volume
- 112
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
β¦ Synopsis
The inference for fuzzy tree grammars is an important and di cult work. This paper gives an inference method for fuzzy tree grammars, which is composed of two parts. First, a fuzzy expansive tree grammar is generated from a sample set; second, the grammar is simpliΓΏed.
π SIMILAR VOLUMES
A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.
new fuzzy inference method, called a VWSI (variable weighted synthesis inference) method, is presented by applying the principle of variable weighted synthesis in factor spaces theory to fuzzy inference. The analysis for response abilities of fuzzy systems constructed by VWSI algorithms indicates th
We present different techniques of fuzzy rule generation using the information we can obtain from the fuzzy clustering of a set of data which describe the behavior of a given system. The methods all try to obtain a first model of the consisted system that is good enough to serve as a first approxima
This paper proposes an inference method for fuzzy quantified and truth qualified natural language propositions. For example, for Most tall men are heavy is true, a modified proposition Many more or less tall men are heavy is true, can be derived by inference. For the quantifier more or less, the fuz