Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach

Details Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach

2011-01-06

arxiv.org/abs/1101.1232v1

Computer Science

Information Theory

5 pages, 1 figure

Scientific paper

Dictionary lookup methods are popular in dealing with ambiguous letters which were not recognized by Optical Character Readers. However, a robust dictionary lookup method can be complex as apriori probability calculation or a large dictionary size increases the overhead and the cost of searching. In this context, Levenshtein distance is a simple metric which can be an effective string approximation tool. After observing the effectiveness of this method, an improvement has been made to this method by grouping some similar looking alphabets and reducing the weighted difference among members of the same group. The results showed marked improvement over the traditional Levenshtein distance technique.

Affiliated with

Also associated with

No associations

Rating

Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399587