Regular expression word verification
First Claim
Patent Images
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.
3 Assignments
0 Petitions
Accused Products
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.
-
Citations
12 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
Specification