Search-enhanced trie-based syntactic pattern recognition of...

Details Search-enhanced trie-based syntactic pattern recognition of... Search-enhanced trie-based syntactic pattern recognition of...

G - Physics

06

K

G06K 9/62 (2006.01) G06F 17/30 (2006.01)

Patent

CA 2509496

This invention relates to the Pattern Recognition )PR) of noisy/inexact strings and sequences and particularly to syntactic Pattern Recognition. The present invention presents a process by which a user can recognize an unknown sting X, which is an element of a finite, but possibly larger Dictionary, H, by processing the information contained in its noisy/inexact version, Y, where Y is assumed to contain substitution, insertion or deletion errors. The recognized string, which is the best estimate X+ of X, is defined as that element of H which minimizes the Generalized Levenshtein Distance D(X,Y) between X and Y, for all X < H. Rather than evaluate D(X,Y) for every X < H sequentially, the present invention achieves this simultaneously for every X < H by representing the Dictionary as a Trie, and searching the Trie using a new AI- based search strategy.

Affiliated with

Also associated with

Rating

Search-enhanced trie-based syntactic pattern recognition of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Search-enhanced trie-based syntactic pattern recognition of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search-enhanced trie-based syntactic pattern recognition of... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1692517