Please download the dossier by clicking on the dossier button x
×

Method and system for approximate string matching

  • US 20060004744A1
  • Filed: 06/16/2005
  • Published: 01/05/2006
  • Est. Priority Date: 06/19/2004
  • Status: Active Grant
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;

    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 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.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×