By Topic

Deformed fuzzy automata for correcting imperfect strings of fuzzy symbols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
J. R. Garitagoitia ; Dept. Matematica e Informatica, Univ. Publica de Navarra, Pamplona, Spain ; J. R. G. de Mendivil ; J. Echanobe ; J. J. Astrain
more authors

Presents a fuzzy method for the recognition of strings of fuzzy symbols containing substitution, deletion, and insertion errors. As a preliminary step, we propose a fuzzy automaton to calculate a similarity value between strings. The adequate selection of fuzzy operations for computing the transitions of the fuzzy automaton allows us to obtain different string similarity definitions (including the Levenshtein distance). A deformed fuzzy automaton based on this fuzzy automaton is then introduced in order to handle strings of fuzzy symbols. The deformed fuzzy automaton enables the classification of such strings having an undetermined number of insertion, deletion and substitution errors. The selection of the parameters determining the deformed fuzzy automaton behavior would allow to implement recognizers adapted to different problems. The paper also presents algorithms that implement the deformed fuzzy automaton. Experimental results show good performance in correcting these kinds of errors.

Published in:

IEEE Transactions on Fuzzy Systems  (Volume:11 ,  Issue: 3 )