Method and system for approximate string matching

  • US 7,809,744 B2
  • Filed: 06/16/2005
  • Issued: 10/05/2010
  • Est. Priority Date: 06/19/2004
  • Status: Active Grant
  • ×
    • Pin Icon | RPX Insight
    • Pin
First Claim
Patent Images

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 a trie data structure starting from the root node by comparing each node of a branch of the trie data structure to characters 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 for both the modified target string and the original target string, wherein no additional modifications of the modified target string are allowed within its modified parts;

    adding characters traversed in a branch of the trie data structure to a gathered string;

    reaching a node flagged as a node for a word or a word fragment, comparing the length of the target string to the length of the gathered string, and, if the target string is longer than the gathered string, looping back to the root node, and continuing the traverse from the root node; and

    providing at least one suggestion from the trie data structure.

View all claims

    Thank you for your feedback