System for correcting grammar based on parts of speech probability

• US 5,799,269 A
• Filed: 05/17/1996
• Issued: 08/25/1998
• Est. Priority Date: 06/01/1994
• Status: Expired due to Term

• Current Assignee: Binary Services LLC (Intellectual Ventures LLC)
• Original Assignee: Mitsubishi Electric Information Technology Center America, Inc. (Mitsubishi Electric Corporation)
• Inventors: Schabes, Yves, Roche, Emmanuel, Golding, Andrew R.
• Primary Examiner(s): Weinhardt, Robert A.
• Application Number:
  US08/650,057
• Time in Patent Office: 830 Days
• Field of Search: 395/751, 395/754, 395/759, 395/792, 395/793, 395/794, 395/795, 704/1, 704/4, 704/9, 707/530, 707/531, 707/532, 707/533
• US Class Current: 704/9
• CPC Class Codes: G06F 40/253 Grammatical analysis; Style critique

Abstract

In a grammar checking system in which a sentence is first tagged as to pa of speech, the probability of the sequence of the parts of speech being correct is utilized to correct improper use of troublesome words, especially those identical sounding words which are spelled differently. The system corrects word usage based not on the probability of the entire sentence being correct but rather on the probability of the sequence of the parts of speech being correct. As part of the subject invention, the parts of speech sequence probability is utilized in part of speech sequence verification, underlying spelling recovery, auxiliary verb correction, determiner correction, and in a context-sensitive dictionary lookup.

Claims

1. In a grammar checking system in which an input sentence is first tagged as to parts of speech, apparatus for correcting word usage in said input sentence by checking for easily confused words, comprising:

a list of easily confused words;

means for ascertaining the probability of the part of speech tag sequence of a candidate word in the input sentence and an easily confused word from said list in a candidate sentence,

said ascertaining means including means for detecting that input or candidate sentence having the higher part of speech tag sequence probability; and

,

means for selecting as the correct word the word in that input or candidate sentence having the highest part of speech tag sequence probability.

2. The system of claim 1 wherein sad means for ascertaining the probability of the part of speech tag sequence of a candidate word includes means for tagging each word in said sentence with a tag indicating its part of speech in said sentence.

3. The system of claim 1 wherein said means for ascertaining the probability of the part of speech tag sequence includes means for analyzing overlapping triples of parts of speech.

4. The system of claim 1 wherein said detecting means includes means for establishing a geometric average of the probability of part of speech tag sequences and means for selecting said correct word based on said geometric average of the probabilities of the parts of speech sequences of said input and candidate sentences.

5. The system of claim 1 wherein said list of easily confused words includes at least one of:

to, too, two;

I, me,;

its, it'"'"'s;

then, than;

whose, who'"'"'s, our, are;

hear, here;

past, passed;

accept, except;

advise, advise;

lose, loose;

write, right;

your, you'"'"'re;

affect, effect; and

maybe, may be.