Results 241 to 250 of about 38,430 (279)
Some of the next articles are maybe not open access.
DNA sequence analysis using fuzzy grammars
2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), 2008We propose to use fuzzy context-free grammars for the analysis of DNA sequences by using the Cocke-Younger-Kasami algorithm to estimate membership grades of a DNA sequence against the language of a fuzzy grammar. As a first example of the application of the proposed method we prove that is possible to determine a fuzzy grammar of a prototype DNA ...
Heron Molina-Lozano +2 more
openaire +1 more source
Approximation of fuzzy context-free grammars
Information Sciences, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yongbing, Li, Yongming
openaire +2 more sources
Using fuzzy tree fragments to explore English grammar
English Today, 1998A report from the Survey of English Usage at the Department of English Language and Literature, University College ...
Bas Aarts, Gerald Nelson, Sean Wallis
openaire +1 more source
On a fuzzy theory of grammar system
2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2011The contribution sketches some ways of how to introduce uncertainty into grammar systems - a syntactic grammar theoretical framework for dealing with decentralized cooperating information processing systems - using the basic concepts of fuzzy set theory.
Jozef Kelemen, Alica Kelemenova
openaire +1 more source
Simulation of language evolution using Fuzzy Grammars
2012 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS), 2012Many computer simulations try to explain language evolution with socially oriented scenarios in multi-agent systems by applying methods such as genetic algorithms and neural networks. In this paper a new approach based on modifications to the classic Ant Colony Optimization algorithm is proposed.
Juan Paulo Alvarado-Magana +3 more
openaire +1 more source
A relational approach of fuzzy graph grammars
2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2017Graph Grammars are a visual formal language for which there are several techniques of system specification and verification. This fact makes them an attractive option for describing complex systems. Fuzzy graph grammars generalize the concept of graph grammars, using fuzzy graphs.
Alex Bertei +3 more
openaire +1 more source
Automated semantic tagging using fuzzy grammar fragments
2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), 2008One of the bottlenecks preventing wider adoption of the semantic Web is the overhead in annotating existing Web content. In cases where we have unstructured text, it is useful to extract fragments of structured data which can then be used as the basis for automatic tagging. A common approach is to use pattern matching (e.g. regular expressions) or more
Martin, TP, Yun, S., Azvine, B.
openaire +2 more sources
Location Recognition with Fuzzy Grammar
2012Fuzzy grammar has been introduced as an approach to represent and learn text fragments where the set of learned patterns are represented by combining similar segments to represent regularities and marking interchangeable segments. This paper is dedicated to present a procedural scheme towards learning text fragment in text categorization task ...
openaire +1 more source
Fuzzy command grammars for intelligent interface design
IEEE Transactions on Systems, Man, and Cybernetics, 1992Human-computer interactions involve an input language with which users input their commands and a command language that is anticipated and recognized by the system. In general, the input language is a function of the command language, while the command language can be any language defined by the system designer. The relationship between these languages
openaire +1 more source
On fuzzy automata and fuzzy grammars
1985Fuzzy grammars and fuzzy languages in connection with finite fuzzy acceptors are considered. The relation \(\epsilon\)-closeness of matrices over a bounded chain is defined and its properties are studied. On this basis, \(\epsilon\)-equivalence and \(\epsilon\)-reduction by inputs are investigated and their algorithmical decidability is proved.
openaire +1 more source

