Methods and apparatus for performing spelling corrections using one or more variant hash tables
First Claim
1. A method for correcting spelling of at least one candidate word, said method comprising:
- obtaining at least one variant dictionary hash table based on variants of a set of known correctly spelled words, wherein said variants are obtained by applying one or more of a deletion, insertion, replacement, and transposition operation on said correctly spelled words, wherein said variants obtained by applying one or more of an insertion and replacement operation on said correctly spelled words comprise a wildcard character, wherein for a given correctly spelled word having a length W, said at least one variant dictionary hash table comprises W of said variants each comprising said wildcard character in a different position, and wherein said variants are stored in said at least one variant dictionary hash table and are mapped to one of said corresponding correctly spelled words from said set of known correctly spelled words which are stored in a dictionary hash table that is distinct from said at least one variant dictionary hash table;
performing one or more of a deletion, insertion, replacement, and transposition operation on the at least one candidate word to obtain one or more lookup variants, wherein said lookup variants obtained by applying one or more of an insertion and replacement operation on said at least one candidate word comprise a wildcard character;
evaluating one or more of said lookup variants utilizing said at least one variant dictionary hash table to identify matches; and
indicating a candidate correction if said evaluation step indicates that there is at least one match in the at least one variant dictionary hash table.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods and apparatus are provided for performing spelling corrections using one or more variant hash tables. The spelling of at least one candidate word is corrected by obtaining at least one variant dictionary hash table based on variants of a set of known correctly spelled words, wherein the variants are obtained by applying one or more of a deletion, insertion, replacement, and transposition operation on the correctly spelled words; obtaining from the candidate word one or more lookup variants using one or more of the deletion, insertion, replacement, and transposition operations; evaluating one or more of the candidate word and the lookup variants against the at least one variant dictionary hash table; and indicating a candidate correction if there is at least one match in the at least one variant dictionary hash table.
32 Citations
24 Claims
-
1. A method for correcting spelling of at least one candidate word, said method comprising:
-
obtaining at least one variant dictionary hash table based on variants of a set of known correctly spelled words, wherein said variants are obtained by applying one or more of a deletion, insertion, replacement, and transposition operation on said correctly spelled words, wherein said variants obtained by applying one or more of an insertion and replacement operation on said correctly spelled words comprise a wildcard character, wherein for a given correctly spelled word having a length W, said at least one variant dictionary hash table comprises W of said variants each comprising said wildcard character in a different position, and wherein said variants are stored in said at least one variant dictionary hash table and are mapped to one of said corresponding correctly spelled words from said set of known correctly spelled words which are stored in a dictionary hash table that is distinct from said at least one variant dictionary hash table; performing one or more of a deletion, insertion, replacement, and transposition operation on the at least one candidate word to obtain one or more lookup variants, wherein said lookup variants obtained by applying one or more of an insertion and replacement operation on said at least one candidate word comprise a wildcard character; evaluating one or more of said lookup variants utilizing said at least one variant dictionary hash table to identify matches; and indicating a candidate correction if said evaluation step indicates that there is at least one match in the at least one variant dictionary hash table. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A system for correcting spelling of at least one candidate word, said system comprising:
-
a memory; and at least one hardware processor, coupled to the memory, operative to; obtain at least one variant dictionary hash table based on variants of a set of known correctly spelled words, wherein said variants are obtained by applying one or more of a deletion, insertion, replacement, and transposition operation on said correctly spelled words, wherein said variants obtained by applying one or more of an insertion and replacement operation on said correctly spelled words comprise a wildcard character, wherein for a given correctly spelled word having a length W, said at least one variant dictionary hash table comprises W of said variants each comprising said wildcard character in a different position, and wherein said variants are stored in said at least one variant dictionary hash table and are mapped to one of said corresponding correctly spelled words from said set of known correctly spelled words which are stored in a dictionary hash table that is distinct from said at least one variant dictionary hash table; perform one or more of a deletion, insertion, replacement, and transposition operation on the at least one candidate word to obtain one or more lookup variants, wherein said lookup variants obtained by applying one or more of an insertion and replacement operation on said at least one candidate word comprise a wildcard character; evaluate one or more of said lookup variants utilizing said at least one variant dictionary hash table to identify matches; and indicate a candidate correction if said evaluation step indicates that there is at least one match in the at least one variant dictionary hash table. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
17. An article of manufacture for correcting spelling of at least one candidate word, comprising a non-transitory computer readable medium containing one or more programs which when executed implement the steps of:
-
obtaining at least one variant dictionary hash table based on variants of a set of known correctly spelled words, wherein said variants are obtained by applying one or more of a deletion, insertion, replacement, and transposition operation on said correctly spelled words, wherein said variants obtained by applying one or more of an insertion and replacement operation on said correctly spelled words comprise a wildcard character wherein for a given correctly spelled word having a length W, said at least one variant dictionary hash table comprises W of said variants each comprising said wildcard character in a different position, and, wherein said variants are stored in said at least one variant dictionary hash table and are mapped to one of said corresponding correctly spelled words from said set of known correctly spelled words which are stored in a dictionary hash table that is distinct from said at least one variant dictionary hash table; performing one or more of a deletion, insertion, replacement, and transposition operation on the at least one candidate word to obtain one or more lookup variants, wherein said lookup variants obtained by applying one or more of an insertion and replacement operation on said at least one candidate word comprise a wildcard character; evaluating one or more of said lookup variants utilizing said at least one variant dictionary hash table to identify matches; and indicating a candidate correction if said evaluation step indicates that there is at least one match in the at least one variant dictionary hash table.
-
Specification