×

Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction

  • US 7,047,493 B1
  • Filed: 03/31/2000
  • Issued: 05/16/2006
  • Est. Priority Date: 03/31/2000
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer-implemented method for determining a likelihood that a word in a dictionary is being incorrectly represented by a string;

  • comprising;

    iteratively partitioning the word into multiple segments, each segment consisting of a character or character sequence, where each iteration partitions the word in to a different number of the multiple segments;

    for each iteration of the partitioning, iteratively varying the lengths of the segments while maintaining the number of the segments;

    for each iteration of the partitioning, dividing the string into the same number of string segments as the number of word segments and iteratively varying the lengths of the string segments, wherein corresponding word segments and string segments can be of different lengths;

    for each iteration of varying the lengths of the word segments and the string segments, computing a probability for each pair, wherein each pair consists of a word segment and a corresponding string segment, and wherein the probability consists of a likelihood that the word segment is being incorrectly represented by the string segment;

    for each iteration of varying the lengths, computer a product of the probabilities of the pairs; and

    determining the likelihood that the word is being incorrectly represented by the string based on one of the products.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×