Grammatically correct contraction spelling suggestions for french

• US 7,599,828 B2
• Filed: 03/01/2005
• Issued: 10/06/2009
• Est. Priority Date: 03/01/2005
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Caldwell, Nicholas Van, Fontenelle, Thierry
• Primary Examiner(s): Smits; Talivaldis Ivars
• Assistant Examiner(s): Colucci; Michael C
• Application Number:
  US11/069,070
• Publication Number:
  US 20060200340A1
• Time in Patent Office: 1,680 Days
• Field of Search: 707/3, 707/4, 707/6, 704/266, 704/244, 704/9, 704/7, 704/257, 713/177, 345/173, 382/229
• US Class Current: 704/1
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation

Abstract

A method and product are provided that identify properly spelled words from an input string. Separate lexical entries are identified for different parts of an input word. Grammatical information associated with one of the lexical entries is examined to determine if it satisfies a grammatical constraint associated with another of the lexical entries. A properly spelled word is formed by combining the separate lexical entries if the grammatical information satisfies the constraint. Under some embodiments of the invention, the separate lexical entries are identified by performing a first search of a lexicon using a first part of the input string and by performing a second search of the lexicon using a second part of the input string.

Claims

1. A method of identifying a properly spelled word from an input string, the method comprising:

a processor receiving an input string representing a misspelled word, the word being misspelled based in part on a contraction;

the processor identifying a first part of the input string as representing a part of a possible contraction of two words by searching a lexicon storage structure and locating a text string designated as a first complete word that ends in an apostrophe and matches the first part of the input string with the exception of the apostrophe and case differences, the located text string designated as a first complete word being one of a set of text strings consisting of;

l′

, d′

, n′

, c′

, j′

, m′

, t′

, s′

, qu′

, puisqu′

, lorsqu′

, presqu′

, jusqu′

, quioiqu′

, and ç

′

;

the processor determining if the next letter in the input string after the first part of the input string is a vowel and if the next letter is not a vowel, the processor determining that the first part of the input string does not represent part of a contraction;

the processor identifying a second part of the input string as representing a second complete word in the lexicon storage structure;

the processor retrieving grammatical information for the second complete word from the lexicon storage structure;

the processor using the grammatical information to determine if the second complete word satisfies a grammatical constraint of the first complete word wherein the grammatical constraint for the first complete word j′

requires that the second complete word be either a first person verb or a pronoun, wherein the grammatical constraint for the first complete word t′

requires that the second complete word be a verb or pronoun, wherein the grammatical constraint for the first complete word s′

requires the second complete word to be a third person verb or a pronoun, wherein the grammatical constraints for the first complete words m′ and

n′

require the second complete word to be a verb or a pronoun; and

wherein the grammatical constraints for the first complete words c′ and

ç

′

require the second complete word to be a third person verb that is also an auxiliary verb; and

the processor identifying a contraction formed by combining the first part of the input string, an apostrophe and the second complete word in the lexicon storage structure into a properly spelled word based on the determination that the second complete word satisfied the grammatical constraint.

2. The method of claim 1 wherein identifying a second part of the input string comprises performing a second search of the lexicon storage structure.

3. The method of claim 2 wherein identifying a second part of the input string further comprises locating a second complete word during the second search of the lexicon storage structure that is within a threshold distance of the second part of the input string.

4. The method of claim 1 wherein determining if the second complete word satisfies a grammatical constraint comprises determining if the part of speech of the second complete word satisfies a part of speech constraint.

5. The method of claim 1 wherein determining if the second complete word satisfies a grammatical constraint comprises determining if the grammatical person of the second complete word satisfies a grammatical person constraint.

6. The method of claim 1 wherein identifying a contraction further comprises placing an apostrophe between the first part of the input string and the complete word to form the properly spelled word.

7. A computer-readable storage medium having computer-executable instructions for performing steps comprising:

receiving an input text string representing a misspelled contraction;

initiating a first traversal of a lexicon search structure;

finding an elided word in the lexicon search structure that corresponds to a portion of the input text string during the first traversal of the lexicon search structure, the elided word having a text string that matches the portion of the input text string and ending with an apostrophe, the elided word marked as a complete word in the lexicon search structure, the entire elided word consisting of a string from a set of strings consisting of;

l′

, d′

, n′

, c′

, j′

, m′

, t′

, s′

, qu′

, puisqu′

, lorsqu′

, presqu′

, jusqu′

, quioiqu′

, and ç

′

;

determining that the portion of the input text string is a possible part of a contraction by determining that the next letter after the portion is a vowel;

initiating a second traversal of the lexicon search structure after determining that the portion of the input text string is part of a possible contraction and not initiating a second traversal of the lexicon search structure if the letter after the portion of the input text string is not a vowel;

finding a second complete word in the lexicon search structure that corresponds to a second portion of the input text string during the second traversal of the lexicon search structure;

continuing the second traversal of the lexicon search structure;

finding a third complete word in the lexicon search structure that corresponds to the second portion of the input text string during the second traversal of the lexicon search structure;

combining the elided word and the second complete word to form a properly spelled word; and

combining the elided word and the third complete word to form a second properly spelled word.

8. The computer-readable storage medium of claim 7 wherein initiating a first traversal and initiating a second traversal comprises initiating the first and second traversals at the. same point in the lexicon search structure.

9. The computer-readable storage medium of claim 7 wherein initiating a second traversal of the lexicon search structure comprises pausing the first traversal of the lexicon search structure until the second traversal of the lexicon search structure is complete.

10. The computer-readable storage medium of claim 9 further comprising continuing the first traversal of the lexicon search structure after the second traversal of the lexicon search structure is complete.

11. The computer-readable storage medium of claim 10 further comprising finding a complete word in the lexicon search structure that corresponds to the entire input text string during the first traversal of the lexicon search structure.

12. The computer-readable storage medium of claim 7 wherein combining the elided word and the second complete word comprises determining if the second complete word satisfies a grammatical constraint associated with the elided word before combining the elided word and the second complete word.

13. A computer-readable storage medium having computer-executable instructions for performing steps comprising:

identifying separate lexical entries for different parts of an input word;

determining if grammatical information associated with one of the lexical entries satisfies a constraint associated with another of the lexical entries wherein the constraint associated with a lexical entry j′

requires that a lexical entry be either a first person verb or a pronoun in order to form a contraction with j′

, wherein the constraint associated with a lexical entry t′

requires that a lexical entry be a verb or pronoun in order to form a contraction with t′

, wherein the constraint associated with lexical entry s′

requires that a lexical entry be either a third person verb or a pronoun in order to form a contraction with s′

, wherein the constraints associated with lexical entries m′ and

n′

require that a lexical entry be either a verb or a pronoun in order to form a contraction with m′

or n′

, and wherein the constraints associated with the lexical entries c′ and

ç

′

require that a lexical entry be a third person verb that is also an auxiliary verb in order to form a contraction with c′

or ç

′

; and

forming a properly spelled word by combining the separate lexical entries if the grammatical information satisfies the constraint.

14. The computer-readable storage medium of claim 13 wherein identifying separate lexical entries comprises performing a first search of a lexicon using a first part of the input word and a second search of the lexicon using a second part of the input word.