Approximate string matching using deformed fuzzy automata: a learning experience

DOI10.1023/B:FODM.0000022042.64558.1DMaRDI QIDQ702282zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 17 January 2005

Published in Fuzzy Optimization and Decision Making (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:fodm.0000022042.64558.1d

zbMATH Keywords

genetic algorithmsapproximate string matchingDeformed fuzzy automatonfuzzy learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Recommendations

• Approximate string matching by fuzzy automata
• Fuzzy automata with -moves compute fuzzy measures between strings
• Deformed fuzzy automata for the text error correction problem
• The utilization of fuzzy sets in the recognition of imperfect strings
• Using fuzzy logic to match strings in documents

Cited in

(6)

• Using fuzzy logic to match strings in documents
• Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
• Deformed fuzzy automata for the text error correction problem
• The utilization of fuzzy sets in the recognition of imperfect strings
• Visualization of Membership Distribution in Strings Using Heat Maps
• Determinization of fuzzy automata via factorization of fuzzy states

This page was built for publication: Approximate string matching using deformed fuzzy automata: a learning experience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702282)