Method and system for approximate string matching
First Claim
1. A method of approximate string matching of a target string to a trie data structure, the trie data structure having a root node and generations of child nodes, each node representing at least one character in an alphabet, the method comprising:
- traversing the trie data structure starting from the root node by comparing each node of a branch of the trie data structure to at least one character in the target string;
determining, at each node, if there is a correction rule for one or more characters in the remainder of the target string from the current node, and, if so, applying the correction rule to the target string to modify the target string to obtain a modified target string, wherein applying the correction rule includes performing a sequence to sequence character substitution on the target string to obtain the modified target string, and continuing to traverse the trie data structure from the current node using the modified target string, wherein no additional modifications of the modified target string are allowed within its modified parts; and
providing, responsive to the traversing, at least one suggestion from the trie data structure.
0 Assignments
0 Petitions
Accused Products
Abstract
Approximate string matching of a target string to a trie data structure in which the trie data structure has a root node and generations of child nodes, each node representing at least one character in an alphabet to provide a lexicon of words and word fragments. Traversing the trie data structure includes starting from the root node by comparing each node of a branch of the trie data structure to characters in the target string and adding characters traversed in a branch of the trie data structure to a gathered string to provide suggestions of approximate matches. If a node is reached that is flagged as a node for a word or a word fragment and, and if the target string is longer than the gathered string, the method loops back to the root node, and continues the traverse from the root node. At each node, the system determines if there is a correction rule for one or more characters in the remainder of the target string from the current node, and if so, applies the correction rule to the target string to obtain a modified target string.
-
Citations
20 Claims
-
1. A method of approximate string matching of a target string to a trie data structure, the trie data structure having a root node and generations of child nodes, each node representing at least one character in an alphabet, the method comprising:
-
traversing the trie data structure starting from the root node by comparing each node of a branch of the trie data structure to at least one character in the target string; determining, at each node, if there is a correction rule for one or more characters in the remainder of the target string from the current node, and, if so, applying the correction rule to the target string to modify the target string to obtain a modified target string, wherein applying the correction rule includes performing a sequence to sequence character substitution on the target string to obtain the modified target string, and continuing to traverse the trie data structure from the current node using the modified target string, wherein no additional modifications of the modified target string are allowed within its modified parts; and providing, responsive to the traversing, at least one suggestion from the trie data structure. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system including at least one processor and a memory storing program code for execution on the processor for approximate string matching of a target string to a trie data structure, comprising:
-
a trie data structure stored in said memory and having a root node and generations of child nodes each node representing at least one character in an alphabet; program code for traversing the trie data structure starting from the root node by comparing each node of a branch of the trie data structure to at least one character in the target string; program code for determining, at each node, if there is a correction rule for one or more characters in the remainder of the target string from the current node, and, if so, applying the correction rule to the target string to modify the target string to obtain a modified target string, wherein applying the correction rule includes performing a sequence to sequence character substitution on the target string to obtain the modified target string, and for continuing to traverse the trie data structure from the current node using the modified target string, wherein no additional modifications of the modified target string are allowed within its modified parts; and program code for providing, responsive to the traversing, at least one suggestion from the trie data structure. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer program product stored on a non-signal computer readable storage medium, comprising program code for performing the steps of:
-
traversing the trie data structure starting from the root node by comparing each node of a branch of the trie data structure to at least one character in the target string; determining, at each node, if there is a correction rule for one or more characters in the remainder of the target string from the current node, and, if so, applying the correction rule to the target string to modify the target string to obtain a modified target string, wherein applying the correction rule includes performing a sequence to sequence character substitution on the target string to obtain the modified target string, and continuing to traverse the trie data structure from the current node using the modified target string, wherein no additional modifications of the modified target string are allowed within its modified parts; and providing, responsive to the traversing, at least one suggestion from the trie data structure.
-
Specification