Regular expression word verification

• US 9,336,201 B2
• Filed: 12/06/2013
• Issued: 05/10/2016
• Est. Priority Date: 06/29/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Inventors: Brainard, Katherine J., Van Caldwell, Nicholas, Shahani, Ravi Chandru
• Primary Examiner(s): Adesanya, Olujimi
• Application Number:
  US14/099,404
• Publication Number:
  US 20140122061A1
• Time in Patent Office: 886 Days
• Field of Search: 704 8- 10, 704/257
• US Class Current: 1/1
• 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 computing system comprising;

a processor;

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

a rules data store having a plurality of rule entries, each rule entry representing a rule that indirectly identifies valid compound words by identifying, in the rule entry, at least one segment identifier and an operation to be performed on textual strings that are mapped to the at least one segment identifier in the lexical data store to form the valid compound words; and

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

receive an input signal indicative of a textual input;

access a rule entry in the rules data store representing a particular one of rules;

parse the particular rule into a rule structure that represents the at least one segment identifier and the operation from the accessed rule entry;

determine whether the textual input comprises a valid compound word, by applying the rule structure to the textual input to match the textual input to a textual string identified from the lexical data store based on the at least one segment identifier and the operation represented by the rule structure; and

generate and electronically transmit, through a communication interface, an output indicative of the determination whether the textual input comprises a valid compound word.

2. The system of claim 1, wherein at least one segment identifier is mapped in the lexical data store to a plurality of different textual strings.

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 rule structure includes 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 modify the rules data store using a text editor.