string - Overcoming the Bitap algorithm's search pattern length -
I'm new to the field of estimated string matching.
I am searching for use for it, but so far its limited pattern length disturbs me. I am working with Flash, and I settle 32-bit signed integer and one IEEE-754 double-specific floating-point number, which can dedicate up to 53 bits for integer. However, I have a fuzzy mailing algorithm which can handle the pattern now than 50 characters.
Bitep algorithm has a mention of Libbitum, which is believed to be the unlimited pattern of algorithm, which shows length implementation, but I have trouble getting ideas from my sources.
Have you got any suggestions for unlimited length patterns or generalization of the batteps for other algorithms, which is a fuzzy string matching of a needle near the suggested place in the heap of the grass Can do ?
Try this is a beautiful implementation available on this algorithm. Although I do not understand how to get the exact location of a fuzzy match (beginning and end point in text) If you have any idea how to get both the beginning and the closing points, please share.
Comments
Post a Comment