Use of Prefix Trees in Text Error Correction Problem

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 toimplement 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.