|Publication number||US5956739 A|
|Application number||US 08/669,928|
|Publication date||21 Sep 1999|
|Filing date||25 Jun 1996|
|Priority date||25 Jun 1996|
|Publication number||08669928, 669928, US 5956739 A, US 5956739A, US-A-5956739, US5956739 A, US5956739A|
|Inventors||Andrew R. Golding, Dan Roth|
|Original Assignee||Mitsubishi Electric Information Technology Center America, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (6), Non-Patent Citations (4), Referenced by (72), Classifications (5), Legal Events (10)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention relates to the correction of text, and more particularly to an adaptive system for text correction in which a training set is utilized that includes text which is assumed to be mostly correct.
In the past, especially with respect to text editing, user mistakes such as spelling errors were corrected utilizing conventional spell-checking systems utilizing lookup tables. Subsequently, more sophisticated spell-checking systems were developed in which the context in which the word occurred was taken into account. These systems traditionally involved the utilization of so-called training corpora which contain examples of the correct use of the words in the context of the sentences in which they occurred.
One of the major problems with such context-sensitive spelling-correction systems is the inability of these systems to take into account situations in which the corpus on which they were trained is dissimilar to the target text to which they are applied. This is an important problem for text correction because words can be used in a wide variety of contexts; thus there is no guarantee that the particular contextual uses of the words seen in the target text will also have been seen in the training corpus.
Consider, for example, an algorithm whose job is to correct context-sensitive spelling errors; these are spelling errors that happen to result in a valid word of English, but not the word that was intended--for example, typing "to" for "too", "casual" for "causal", "desert" for "dessert", and so on. It is very difficult to write an algorithm to do this by hand. For instance, suppose we want to write an algorithm to correct confusions between "desert" and "dessert". We could write rules such as: "If the user types `desert` or `dessert`, and the previous word is `for`, then the user probably meant `dessert`". This rule would allow the algorithm to fix the error in: "I would like the chocolate cake for desert". The rule would not work, however, for many other cases in which "desert" and "dessert" were confused, for instance: "He wandered aimlessly through the dessert", where "desert" was probably intended. To fix this particular sentence, a different rule is needed, such as: "If the user types `desert` or `dessert`, and the previous two words are a preposition followed by the word `the`, then the user probably meant `desert`". In general, it is extremely difficult to write a set of rules by hand that will cover all cases.
This difficulty of writing a set of rules by hand is the motivation for moving to adaptive algorithms--algorithms that learn to correct mistakes by being trained on examples. Instead of writing rules by hand, it is much easier to provide a set of examples of sentences that use "desert" and "dessert" correctly, and let the algorithm automatically infer the rules behind the examples.
A wide variety of techniques have been presented in the Machine Learning literature for training algorithms from examples. However, what they all have in common is that they make the assumption of representativeness; that is, they assume that the set of examples that the algorithm is trained on is representative of the set of examples that the algorithm is asked to correct later. Put another way, they assume that the examples in the training and test sets are drawn, in an unbiased way, from the same population. It follows that whatever rules the algorithm learns from the training set will apply correctly to the test set. For example, if the training set contains examples illustrating that the word "for" occurs commonly before "dessert", but rarely before "desert", then, by the assumption of representativeness, the same distributional property of "for" should hold in the test set. If this assumption is violated, the algorithm's performance on the test set will degrade, because the rules it learned from the training set will not necessarily carry over to the test set. Existing machine learning techniques are therefore effective only to the extent that the training set is representative of the test set. This is a serious limitation, since, in general, there is no way to guarantee representativeness.
In order to provide for a more flexible method of correcting words in a text, in the subject system not only is a conventional training corpus used, but also the target text is analyzed to ascertain how the words to be corrected are used elsewhere in the text. Assuming that, on the whole, the words are used properly throughout the text, then when checking a particular occurrence of one of the words, the suggestion is made that the word take on the form of its usage in similar contexts that appear throughout the text.
The subject system therefore provides a training procedure called sup/unsup which utilizes both a conventional training corpus and the target text to overcome this limitation of existing techniques, thereby enabling adaptive correction algorithms to work well even when the training set is only partially representative of the test set.
The sup/unsup procedure works simply by training the algorithm, whichever adaptive correction algorithm is of interest, on both the traditional training set and the test set. It may seem, at first glance, to be counterproductive to train on the test set, as this set will presumably contain errors. However, the sup/unsup procedure is based on the assumption that although the test set contains errors, they will tend to be distributed sporadically through the test set; thus the learning procedure should still be able to extract correct rules, despite the presence of this noise. An example will clarify this concept.
Returning to the problem of correcting context-sensitive spelling errors for the case of "desert" and "dessert", suppose the test set is a news article containing 24 occurrences of the phrase "Operation Desert Storm" and 1 occurrence of the incorrect phrase "Operation Dessert Storm". Following the sup/unsup procedure, the algorithm is trained on its usual training set plus this test set. The objective of training is to extract rules about when to use "desert" versus "dessert". The test set suggests the rule: "If the user types `Desert` or `Dessert`, and the previous word is `Operation`, and the following word is `Storm`, then the user probably meant `Desert`". This rule will work for 24 out of the 25 examples to which it applies. Although it is not perfect, it is reliable enough that the system can safely learn this rule. It can then apply the rule to the very same test set from which it was learned to detect the 1 occurrence of "Operation Dessert Storm" that violates the rule.
The strength of this procedure is that it can detect sporadic errors, such as the single incorrect spelling "Operation Dessert Storm" in a test document, even if there are no relevant occurrences in the training set--that is, even if the training set is unrepresentative of the test set. One way to look at this procedure is that it is checking for inconsistencies in the test set, rather than "errors" with respect to some training set that is deemed error-free. The procedure is, of course, still able to detect errors that are illustrated by the original training set. The weakness of the procedure is that it cannot detect systematic errors in the test set. For example, if the user types "Operation Dessert Storm" every time, the system will be unable to find the error.
It should be borne in mind that the effectiveness of the sup/unsup procedure depends on two factors. The first is the size of the test set; the larger the test set, the easier it will be to detect inconsistencies. For instance, in the example above, there were 24 correct occurrences of "Operation Desert Storm"; if instead the test set were much smaller and had only 2 occurrences, the algorithm might not have enough information to learn the rule about "Operation" and "Storm" implying "Desert". The second factor affecting the effectiveness of sup/unsup is the percentage of mistakes in the test set. In the example above, the user made 1 mistake in 25 occurrences of "Operation Desert Storm"; if instead the level were 10 or 15 out of 25, it would become difficult for the algorithm to learn the appropriate rule.
It will be appreciated that the sup/unsup training procedure applies to any adaptive correction algorithm, regardless of the means used for adaptation, and regardless of the correction task under consideration.
The term "adaptive correction algorithm" as used herein refers to algorithms that correct users' mistakes, e.g., context-sensitive spelling errors, and that learn to do their job of correcting mistakes by being trained on examples that illustrate correct answers and/or mistakes.
More particularly, in one embodiment, the specific algorithm utilized for target text analysis involves scanning the full collection of training texts, which in this embodiment includes both a conventional training corpus, and the target text to which the system is being applied, so as to ascertain the features that characterize the context in which each word that is being corrected may appear. By features is meant two types of text patterns. The first type is called context words, and refers to the presence of a particular keyword within some fixed distance of the target word that is being corrected. For instance, if the words being corrected are "desert" and "dessert", then useful context words might include "hot", "dry", and "sand" on the one haled, and "chocolate", "cake", and "sweet" on the other hand. The presence of words in the former group within, for instance, 10 words on either side of the target word tends to indicate that "desert" was intended as the target word; whereas the presence of words in the latter group tends to imply that "dessert" was intended.
The second type of feature is called collocations, and refers to the pattern of part-of-speech tags and specific words in the immediate context of the target word. For instance, if the words being corrected are again "desert" and "dessert", then one useful collocation might be "`PREPOSITION the` occurs immediately to the left of the target word". This collocation matches any sentence in which the target word, which is either "desert" or "dessert", is directly preceded by the word "the", which in turn is directly preceded by a word that has been tagged as "PREPOSITION". For instance, the collocation would match the sentence "He went to the desert", in which the target word, "desert", is immediately preceded by the word "the", which is immediately preceded by the word "to", which is tagged as a preposition. This collocation, when matching a sentence, tends to imply that "desert" was intended as the target word, and not "dessert". In one embodiment, the part-of-speech tags needed for this analysis are derived by a lookup procedure that utilizes a dictionary which lists, for any given word, its set of possible part-of-speech tags. A collocation is considered to match a sentence if each specific word in the collocation matches the corresponding word in the sentence, and if each part-of-speech tag in the collocation is a member of the set of possible part-of-speech tags of the corresponding word in the sentence.
The subject system derives a set of features of the two types described above by scanning through the training texts for all occurrences of the words being corrected. For each such occurrence, it proposes as candidate features all context words and collocations that match that occurrence. After working through the whole set of training texts, it collects and returns the set of features proposed. In one embodiment, pruning criteria are applied to this set of features to eliminate features that are based on insufficient data, or that are ineffective at discriminating among the words being corrected.
Having derived a set of features that characterize the contexts in which each of the words being corrected tends to occur, then by a conventional Bayesian method, these features are used as evidence to ascertain the probability that each of the words being corrected is in fact the word that the user intended to type. Having derived these probabilities, the word selected as correct is that word having the highest probability. For instance, if the word "desert" is used 100 times in a particular context, and if the word "dessert" is used either not at all or a limited number of times in the same context, then the subject system will select "desert" as the correct word in future occurrences of this context, even if the user typed "dessert". Bayesian analysis for context-sensitive spelling correction is described in the paper, "A Bayesian hybrid method for context-sensitive spelling correction", by Andrew R. Golding, in the Proceedings of the Third Workshop on Very Large Corpora, at the June 1995 conference of the Association for Computational Linguistics, pages 39-53.
Thus both a conventional training corpus and a special training corpus involving the target text are utilized to ascertain the correct spelling of a target word in the text. The conventional training corpus is merged with the target-text corpus so that context-sensitive spelling correction is based on both corpora. The result is that improved spelling correction is achieved through the analysis of the use of the word throughout the target text, as well as in the conventional training corpus.
In summary, a system is provided for correcting users' mistakes including context-sensitive spelling errors and the like in which an adaptive correction algorithm is utilized which is trained on not only a conventional training corpus, but also on the text which is being corrected, thus to permit the correction of words based on the particular usages of the words in the text being corrected, taking advantage of the fact that the text to be corrected is by and large already mostly correct.
These and other features of the Subject Invention will be better understood taken in conjunction with the Detailed Description taken in conjunction with the Drawings, of which:
FIG. 1 is a flowchart indicating training and run-time processing to accomplish word correction in a target text in which a combined corpus of the target text and a conventional training corpus are utilized followed by a probability-based spelling-correction system utilizing the combined corpus;
FIG. 2 is a flowchart of the feature-extraction system of FIG. 1 illustrating the utilization of a dictionary of sets of part-of-speech tags utilized in the proposal of all possible context words and collocations as candidate features, followed by the counting of occurrences of all candidate features in the combined corpus, in turn followed by pruning features that have insufficient data or are uninformative discriminators; and
FIG. 3 is a flowchart of the probability-based spelling-correction system of FIG. 1 illustrating a sequence of finding successive occurrences of the target word in the target text, and for each such occurrence, finding in turn all features that match the occurrence, and combining the evidence from these features using Bayes' rule so as to select the word that has the highest probability of being the word that was intended for the target word.
Referring now to FIG. 1, a system 10 for correcting text includes a training phase 12, followed by a run-time processing phase 14. In the training phase, target text 16 is combined with a conventional training corpus 18 to provide a combined corpus 20 in which the corpus utilized includes the target text and therefore is exceedingly useful in tailoring the text-correction system to the text in question.
The combined corpus is utilized in a feature-extraction step 22 in which selected features are culled from the combined corpus as illustrated at 24. These features include context words and collocations, so that it is these features which provide evidence that allows the computation of the probability of each word that could have been intended for the target word in the target text.
During run-time processing, a probability-based spelling-correction system 30 is provided with the target text and determines first a target word and secondly the probability of the correctness of this word based on the combined corpus and the selected features. For instance, the list of selected features is matched against each occurrence of the target word in the target text, so as to collect evidence about the likely intended identity of the target word. The evidence is combined into a single probability for each word that could have been intended for the target word using Bayes' rule, in one embodiment. Other spelling-correction systems for use in determining the identity of the correct word include a system based on the Winnow algorithm which employs a multiplicative weight-updating scheme as well as a variant of weighted-majority voting. This technique is described in a paper entitled, "Applying Window to Context-Sensitive Spelling Correction" by Andrew R. Golding and Dan Roth, in Machine Learning: The Proceedings of the 13th International Conference, Lorenza Saitta, ed., Morgan Kaufmann, San Francisco, Calif., 1996.
It can be seen that the spelling correction in step 30 is provided, in one embodiment, by a conventional Bayesian method which, rather than using a conventional training corpus alone, utilizes a corpus which includes the target text. The advantage of so doing is that the system for finding the probability of the correct word is enhanced by inspecting the target text for similar occurrences of the word so that a more powerful technique for obtaining the correct word is achieved.
The result of the probability-based spelling correction is the suggestion of a word to be inserted in the text in place of the target word if the target word needs changing yielding a corrected text 32 as illustrated.
Referring now to FIG. 2, feature extraction 22 is detailed such that in one embodiment, the output of the combined corpus 20 is coupled to a module 34 which lists all possible context words and collocations as candidate features, utilizing a dictionary 36 of sets of part-of-speech tags. For instance, for the word "walks", the dictionary would give the set of part-of-speech tags consisting of "PLURAL NOUN" and "THIRD PERSON SINGULAR VERB". The process of listing all possible context words and collocations is illustrated by the sentence, "John lives in the desert", in which the target word is "desert", for which the user could intend either "desert" or "dessert". In this sentence, the set of possible part-of-speech tags for "in" consists of the single tag "PREPOSITION", while that for the word "the" consists of the single tag "DETERMINER". In this case, four context words and four collocations are proposed as candidate features. The context words are the words "John", "lives", "in", and "the", each of which is a word that occurs nearby the target word. The collocations are: "`in the` occurs immediately to the left of the target word"; "`PREPOSITION the` occurs immediately to the left of the target word"; "`in DETERMINER` occurs immediately to the left of the target word"; and "`PREPOSITION DETERMINER` occurs immediately to the left of the target word". These four collocations represent all ways of expressing the nearby context of the target word in terms of specific words and part-of-speech tags.
Having provided a list of all possible context words and collocations as candidate features, as seen at 36, a module counts the occurrences of all candidate features in the combined corpus 20, followed by a pruning step at 38 to prune features that have insufficient data or are uninformative discriminators. By insufficient data is meant the number of occurrences of the feature in the training corpus is below a prespecified threshold, which, in one embodiment, is set to 10. By uninformative discriminator is meant that the presence of the feature fails to be significantly correlated with the identity of the target word, as determined by a chi-square statistical test, which, in one embodiment, is set to the 5% level of significance. The result is a list of features 40 to be utilized in the run-time processing for probability-based spelling correction.
Referring now to FIG. 3, the system 30 for performing probability-based spelling correction from target text 16 and features 40 includes, as a first step, finding the next occurrence of a given target word as illustrated at 42. Upon a determination at 44 of the occurrence of the target word in the target text, module 46 initializes the probability of each word, wi, that could have been intended for the target word. In one embodiment, the probability of each word, wi, is set to the ratio of the probability that the word occurred in the combined corpus to the total probability that any of the words wi occurred in the corpus.
Having initialized the probability of each word, wi, module 48 finds the next feature that matches the occurrence of the target word. The inputs to this module are features 40 and the dictionary of sets of part-of-speech tags 36. What is happening is that having found the occurrences of the target word, the system now finds which features in its list of possible features match each occurrence of the target word. The utilization of features enhances the robustness of the system in that not only must the probability be based on the target word occurrence, it must also be based on the presence of features that match that target word occurrence.
Assuming that the next feature that matches the occurrence is found, then module 58 updates the probability of each word, wi, that could have been intended for the target word, using Bayes' rule. The probability update is performed to adjust the probability for each word, wi, so as to take into account the evidence about the likely identity of the target word that is provided by the feature that matched the target word occurrence. As a result, when all features that match the target occurrence have been processed, a probability will have been calculated, based on the context of the target word, that measures the probability that each word wi is the word that was intended for the target word given the context in which it occurred. This is done by gathering the evidence from the features that matched the occurrence of the target word.
In the illustrated embodiment, Bayes' rule is utilized to update the probability of each word, wi, based on a feature match with the target text. Bayes' rule is given by the following formula: ##EQU1## where F is the set of features that matched the occurrence of the target word; P(wi |) is the probability that word wi was intended, given that the set F of features has been found to match the target occurrence; P(wi) is the so-called prior probability of word wi, which is the value to which the probability for word wi was initialized in 46; P() is a scaling factor that need not be used as it does not affect the final outcome of the computation; and each term P(ƒ|wi) is a so-called likelihood term that is used to update, at 58, the probabilities of the words wi given that feature ƒ has been found to match the target occurrence, and is calculated from the number of occurrences of feature ƒ in the combined corpus.
If the result of the test at 50 is that no feature that matches the target occurrence was found, then, as illustrated at 52, the correct word selected is that word, wi, with the highest probability. It will be appreciated that when a word is selected as being correct by module 52, this word is entered into a text buffer 56 into which has previously been loaded the original target text. Following the selection by module 52 of the word, wi, with the highest probability, the system iteratively cycles back to find the next occurrence of a target word in the target text, with the iteration continuing until all such occurrences have been processed. At this time, when no more occurrences are found, the text buffer 56 will contain the original target text, as modified by all spelling corrections made during the spelling-correction procedure. Corrected text 54 is therefore generated through the readout of the text buffer 56 as illustrated at 60 at the end of the sequence.
In summary, a combined corpus is formed in the training phase in which the target text is an integral part of the combined corpus and specially tailors the corpus to the text under consideration. Having formed the combined corpus, selected features are extracted to enable a more robust calculation of the probability that a given word is the correct word in the context of the target occurrence. By considering those words that could have been intended for the target word, as well as features, one can provide more accurate probabilities in a run-time sequence for text correction. Utilization of context words and collocations as features is by virtue of example only, as other features are within the scope of this invention.
Moreover, the method for selecting probabilities, while being described in terms of a Bayes' rule iterative process, is but one of a number of techniques for determining the probability of a word as being correct in a particular context.
The C code for the subject system follows, in two parts: feature extraction, and spelling correction. Code for feature extraction: ##SPC1##
Having above indicated several embodiments of the Subject Invention, it will occur to those skilled in the art that modifications and alternatives can be practiced within the spirit of the invention. It is accordingly intended to define the scope of the invention only as indicated in the following claims:
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5148367 *||17 Dec 1990||15 Sep 1992||Sharp Kabushiki Kaisha||European language processing machine with a spelling correction function|
|US5258909 *||31 Aug 1989||2 Nov 1993||International Business Machines Corporation||Method and apparatus for "wrong word" spelling error detection and correction|
|US5572423 *||23 Jan 1995||5 Nov 1996||Lucent Technologies Inc.||Method for correcting spelling using error frequencies|
|US5659771 *||19 May 1995||19 Aug 1997||Mitsubishi Electric Information Technology Center America, Inc.||System for spelling correction in which the context of a target word in a sentence is utilized to determine which of several possible words was intended|
|US5765180 *||3 Oct 1996||9 Jun 1998||Microsoft Corporation||Method and system for correcting the spelling of misspelled words|
|US5812863 *||26 Sep 1994||22 Sep 1998||Matsushita Electric Ind.||Apparatus for correcting misspelling and incorrect usage of word|
|1||Golding, Andrew; Roth, Dan; "A Bayesian hybrid method for context-sensitive spelling correction"; Proceeding of the Third Workshop on Very Large Corpora; pp. 39-53, May 1995.|
|2||Golding, Andrew; Roth, Dan; "Applying Winnow to context-sensitive spellingorrection"; Machine Learning: Proceedings of the 13th International Conferenced; 182-190, Apr. 1996.|
|3||*||Golding, Andrew; Roth, Dan; A Bayesian hybrid method for context sensitive spelling correction ; Proceeding of the Third Workshop on Very Large Corpora; pp. 39 53, May 1995.|
|4||*||Golding, Andrew; Roth, Dan; Applying Winnow to context sensitive spelling correction ; Machine Learning: Proceedings of the 13th International Conferenced; 182 190, Apr. 1996.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6298351 *||11 Apr 1997||2 Oct 2001||International Business Machines Corporation||Modifying an unreliable training set for supervised classification|
|US6556841 *||3 May 1999||29 Apr 2003||Openwave Systems Inc.||Spelling correction for two-way mobile communication devices|
|US6732333 *||16 Jan 2001||4 May 2004||Scott Selby||System and method for managing statistical data regarding corrections to word processing documents|
|US6782510 *||27 Jan 1998||24 Aug 2004||John N. Gross||Word checking tool for controlling the language content in documents using dictionaries with modifyable status fields|
|US6853993||1 Apr 2002||8 Feb 2005||A9.Com, Inc.||System and methods for predicting correct spellings of terms in multiple-term search queries|
|US6859774 *||2 May 2001||22 Feb 2005||International Business Machines Corporation||Error corrective mechanisms for consensus decoding of speech|
|US6986106||13 May 2002||10 Jan 2006||Microsoft Corporation||Correction widget|
|US7117144 *||31 Mar 2001||3 Oct 2006||Microsoft Corporation||Spell checking for text input via reduced keypad keys|
|US7137076||30 Jul 2002||14 Nov 2006||Microsoft Corporation||Correcting recognition results associated with user input|
|US7149970 *||23 Jun 2000||12 Dec 2006||Microsoft Corporation||Method and system for filtering and selecting from a candidate list generated by a stochastic input method|
|US7254773 *||29 Dec 2000||7 Aug 2007||International Business Machines Corporation||Automated spell analysis|
|US7263657||27 Jul 2005||28 Aug 2007||Microsoft Corporation||Correction widget|
|US7290209||15 Jul 2005||30 Oct 2007||Microsoft Corporation||Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction|
|US7302640||21 Oct 2004||27 Nov 2007||Microsoft Corporation||Language input architecture for converting one text form to another text form with tolerance to spelling, typographical, and conversion errors|
|US7366983 *||15 Jul 2005||29 Apr 2008||Microsoft Corporation||Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction|
|US7398467 *||13 Jun 2000||8 Jul 2008||International Business Machines Corporation||Method and apparatus for providing spelling analysis|
|US7403888||28 Jun 2000||22 Jul 2008||Microsoft Corporation||Language input user interface|
|US7424674||16 Aug 2004||9 Sep 2008||Gross John N||Document distribution control system and method based on content|
|US7424675||27 Sep 2004||9 Sep 2008||Microsoft Corporation||Language input architecture for converting one text form to another text form with tolerance to spelling typographical and conversion errors|
|US7444324||3 Nov 2004||28 Oct 2008||A9.Com, Inc.||Search query processing to identify search string corrections that reflect past search query submissions of users|
|US7506271||15 Dec 2003||17 Mar 2009||Microsoft Corporation||Multi-modal handwriting recognition correction|
|US7542894 *||8 Jul 2002||2 Jun 2009||National Institute Of Information And Communications Technology||System and method for analyzing language using supervised machine learning method|
|US7562296||27 Jul 2005||14 Jul 2009||Microsoft Corporation||Correction widget|
|US7565606||22 Feb 2006||21 Jul 2009||International Business Machines Corporation||Automated spell analysis|
|US7657423 *||31 Oct 2003||2 Feb 2010||Google Inc.||Automatic completion of fragments of text|
|US7669112||26 Jul 2007||23 Feb 2010||International Business Machines Corporation||Automated spell analysis|
|US7743322||30 Sep 2003||22 Jun 2010||Hewlett-Packard Development Company, L.P.||Automatic photo album page layout|
|US7818332||16 Aug 2006||19 Oct 2010||Microsoft Corporation||Query speller|
|US7840577||6 Jan 2006||23 Nov 2010||A9.Com, Inc.||Search query processing to identify related search terms and to correct misspellings of search terms|
|US7848573||3 Dec 2003||7 Dec 2010||Microsoft Corporation||Scaled text replacement of ink|
|US7937657||2 Jun 2008||3 May 2011||International Business Machines Corporation||User specific error analysis|
|US7996398 *||19 Oct 2010||9 Aug 2011||A9.Com, Inc.||Identifying related search terms based on search behaviors of users|
|US8024178||14 Dec 2009||20 Sep 2011||Google Inc.||Automatic completion of fragments of text|
|US8051374 *||2 Feb 2007||1 Nov 2011||Google Inc.||Method of spell-checking search queries|
|US8090669||6 May 2008||3 Jan 2012||Microsoft Corporation||Adaptive learning framework for data correction|
|US8117026 *||11 Dec 2006||14 Feb 2012||Samsung Electronics Co., Ltd.||String matching method and system using phonetic symbols and computer-readable recording medium storing computer program for executing the string matching method|
|US8176419||19 Dec 2007||8 May 2012||Microsoft Corporation||Self learning contextual spell corrector|
|US8280722||16 Sep 2011||2 Oct 2012||Google Inc.||Automatic completion of fragments of text|
|US8401980 *||3 Nov 2010||19 Mar 2013||Hamid Hatama-Hanza||Methods for determining context of compositions of ontological subjects and the applications thereof using value significance measures (VSMS), co-occurrences, and frequency of occurrences of the ontological subjects|
|US8521515||29 Aug 2012||27 Aug 2013||Google Inc.||Automatic completion of fragments of text|
|US8621344 *||30 Sep 2011||31 Dec 2013||Google Inc.||Method of spell-checking search queries|
|US8645124||4 Feb 2009||4 Feb 2014||Ginger Software, Inc.||Automatic context sensitive language generation, correction and enhancement using an internet corpus|
|US8655904 *||15 Jun 2004||18 Feb 2014||Ebay, Inc.||Method and system to enhance data integrity in a database|
|US8914278||31 Jul 2008||16 Dec 2014||Ginger Software, Inc.||Automatic context sensitive language correction and enhancement using an internet corpus|
|US9015036||26 Jan 2011||21 Apr 2015||Ginger Software, Inc.||Automatic context sensitive language correction using an internet corpus particularly for small keyboard devices|
|US9026432||30 Dec 2013||5 May 2015||Ginger Software, Inc.||Automatic context sensitive language generation, correction and enhancement using an internet corpus|
|US9135544||5 Aug 2013||15 Sep 2015||Varcode Ltd.||System and method for quality management utilizing barcode indicators|
|US20020095448 *||16 Jan 2001||18 Jul 2002||Scott Selby||System and method for managing statistical data regarding corrections to word processing documents|
|US20020165716 *||2 May 2001||7 Nov 2002||International Business Machines Corporation||Error corrective mechanisms for consensus decoding of speech|
|US20020188448 *||31 Mar 2001||12 Dec 2002||Goodman Joshua T.||Spell checking for text input via reduced keypad keys|
|US20030083859 *||8 Jul 2002||1 May 2003||Communications Research Laboratory, Independent Administration Institution||System and method for analyzing language using supervised machine learning method|
|US20030189603 *||9 Apr 2002||9 Oct 2003||Microsoft Corporation||Assignment and use of confidence levels for recognized text|
|US20040107089 *||26 Nov 2003||3 Jun 2004||Gross John N.||Email text checker system and method|
|US20040107189 *||3 Dec 2002||3 Jun 2004||Lockheed Martin Corporation||System for identifying similarities in record fields|
|US20040205672 *||29 Dec 2000||14 Oct 2004||International Business Machines Corporation||Automated spell analysis|
|US20050044495 *||27 Sep 2004||24 Feb 2005||Microsoft Corporation||Language input architecture for converting one text form to another text form with tolerance to spelling typographical and conversion errors|
|US20050071332 *||3 Nov 2004||31 Mar 2005||Ortega Ruben Ernesto||Search query processing to identify related search terms and to correct misspellings of search terms|
|US20050071783 *||30 Sep 2003||31 Mar 2005||Atkins C. Brian||Automatic photo album page layout|
|US20050128181 *||15 Dec 2003||16 Jun 2005||Microsoft Corporation||Multi-modal handwriting recognition correction|
|US20050177582 *||15 Jun 2004||11 Aug 2005||Anselm Baird-Smith||Method and system to enhance data integrity in a database|
|US20050257147 *||15 Jul 2005||17 Nov 2005||Microsoft Corporation||Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction|
|US20050289463 *||23 Jun 2004||29 Dec 2005||Google Inc., A Delaware Corporation||Systems and methods for spell correction of non-roman characters and words|
|US20060143564 *||22 Feb 2006||29 Jun 2006||International Business Machines Corporation||Automated spell analysis|
|US20060167676 *||26 Jan 2005||27 Jul 2006||Research In Motion Limited||Method and apparatus for correction of spelling errors in text composition|
|US20070156404 *||11 Dec 2006||5 Jul 2007||Samsung Electronics Co., Ltd.||String matching method and system using phonetic symbols and computer-readable recording medium storing computer program for executing the string matching method|
|US20070271089 *||26 Jul 2007||22 Nov 2007||International Business Machines Corporation||Automated spell analysis|
|US20080046405 *||16 Aug 2006||21 Feb 2008||Microsoft Corporation||Query speller|
|US20080155398 *||21 Dec 2006||26 Jun 2008||International Business Machines Corporation||System and method for adaptive spell checking|
|US20090006950 *||8 Sep 2008||1 Jan 2009||Gross John N||Document Distribution Control System and Method Based on Content|
|US20090164890 *||19 Dec 2007||25 Jun 2009||Microsoft Corporation||Self learning contextual spell corrector|
|US20110113095 *||3 Nov 2010||12 May 2011||Hamid Hatami-Hanza||System and Method For Value Significance Evaluation of Ontological Subjects of Networks and The Applications Thereof|
|WO2002065330A1 *||12 Feb 2002||22 Aug 2002||Bernstein Evan||Learning from user modifications and revisions to text|
|International Classification||G06F17/21, G06F17/27|
|9 Oct 1998||AS||Assignment|
Owner name: MITSUBISHI ELECTRIC INFORMATION TECHNOLOGY CENTER
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOLDING, ANDREW R.;ROTH, DAN;REEL/FRAME:009521/0843;SIGNING DATES FROM 19980925 TO 19981001
|23 Jan 2001||AS||Assignment|
|11 Mar 2003||FPAY||Fee payment|
Year of fee payment: 4
|23 Apr 2004||AS||Assignment|
|11 Apr 2007||REMI||Maintenance fee reminder mailed|
|18 Sep 2007||FPAY||Fee payment|
Year of fee payment: 8
|18 Sep 2007||SULP||Surcharge for late payment|
Year of fee payment: 7
|25 Apr 2011||REMI||Maintenance fee reminder mailed|
|21 Sep 2011||LAPS||Lapse for failure to pay maintenance fees|
|8 Nov 2011||FP||Expired due to failure to pay maintenance fee|
Effective date: 20110921