REGULAR EXPRESSION WORD VERIFICATION

• US 20140122061A1
• Filed: 12/06/2013
• Published: 05/01/2014
• Est. Priority Date: 06/29/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Van Caldwell, Nicholas, Shahani, Ravi Chandru, Brainard, Katherine J.
• Granted Patent: US 9,336,201 B2
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

The present disclosure is directed to a method of verifying a compound word. The method includes receiving an input signal indicative of a textual input and accessing a rule and a lexical data structure from data stores. The rule is applied to the textual input to determine whether the textual input is a valid compound word. An output signal is provided that is indicative of whether the textual input is a compound word.

Claims

1. A system comprising:

a processor;

a lexical data store having a plurality of lexical entries, each lexical entry having a textual string and one or more segment identifiers that are mapped to the textual string;

a rules data store having a plurality of rule entries, each rule entry representing a rule that indirectly identifies valid compound words by representing relationships between segment identifiers in the lexical data store; and

executable instructions, which, when executed by the processor, configure the system to;

receive an input signal indicative of a textual input; and

apply a given rule from the rules data store to determine whether the textual input comprises a valid compound word.

2. The system of claim 1, wherein the lexical entries comprise textual strings that are known to be part of at least one compound word that can be recognized by the system.

3. The system of claim 1, wherein the given rule represents a particular relationship between a first segment identifier and a second segment identifier.

4. The system of claim 3, wherein the textual input is determined to comprise a valid compound word if the textual input includes a first textual string to which the first segment identifier is mapped, a second textual string to which the second segment identifier is mapped, and the particular relationship between the first and second textual strings.

5. The system of claim 3, wherein at least one of the lexical entries maps a plurality of different segment identifiers to a same textual string.

6. The system of claim 3, wherein the first segment identifier is mapped to a plurality of different textual strings.

7. The system of claim 6, wherein the textual input is determined to comprise a valid compound word if the textual input includes one of the plurality of different textual strings in the particular relationship with a second textual string to which the second segment identifier is mapped.

8. The system of claim 1, wherein the instructions configure the system to parse the given rule to generate a rule structure having nodes that represent the segment identifiers and are connected by links that represent the relationship between the segment identifiers.

9. The system of claim 8, wherein the instructions configure the system to apply the rule structure by traversing a traversal path in the rule structure and identifying segments corresponding to the nodes along the traversal path.

10. The system of claim 9, wherein the rule structure has multiple traversal paths.

11. The system of claim 1, wherein the instructions configure the system to modify the lexical data store using a text editor.

12. The system of claim 1, wherein the instructions configure the system to modify the rules data store using a text editor.

13. A method of verifying a compound word, the method comprising:

receiving an input signal indicative of a textual input;

accessing a lexical data store that includes a set of segment identifiers that are mapped to textual strings;

accessing a rule that indirectly identifies a plurality of different valid compound words by identifying the set of segment identifiers in the lexical store and a relationship between the set of segment identifiers;

determining, using a processor, that the textual input includes the textual strings in the relationship identified by the rule; and

outputting an indication that the textual input comprises a valid compound word based on the determination.

14. The method of claim 13, wherein the rule represents a particular relationship between a first segment identifier and a second segment identifier.

21. The method of claim 14, wherein determining comprises determining that the textual input includes a first textual string to which the first segment identifier is mapped, a second textual string to which the second segment identifier is mapped, and the particular relationship between the first and second textual strings.

22. The method of claim 13, wherein an entry in the lexical data store maps a plurality of different segment identifiers to a same textual string.

23. The method of claim 13, wherein the first segment identifier is mapped to a plurality of different textual strings.

24. The method of claim 23, wherein the textual input is determined to comprise a valid compound word if the textual input includes one of the plurality of different textual strings in the particular relationship with a second textual string to which the second segment identifier is mapped.

25. The method of claim 13, and further comprising parsing the rule to generate a rule structure having nodes that represent the segment identifiers and are connected by links that represent the relationship between the segment identifiers.

26. The method of claim 25, and further comprising applying the rule structure by traversing a traversal path in the rule structure and identifying segments corresponding to the nodes along the traversal path.

15-20. -20. (canceled)