期刊名称：Indian Journal of Computer Science and Engineering
印刷版ISSN：2231-3850
电子版ISSN：0976-5166
出版年度：2012
卷号：3
期号：4
页码：527-531
出版社：Engg Journals Publications
摘要：A deformed fuzzy automaton can be used to calculate similarity value between strings having a nonlimited number of edition errors. In this paper an algorithm is presented that makes use of prefix tree to implement the deformed fuzzy automata. Threshold values for the fuzzy transition functions are also used to calculate the membership values which improve the efficiency of the proposed algorithm.
