Method and system to generate finite state grammars using sample phrases
AssigneeWest Interactive Corporation II
InventorAshok Mitter Khosla
Life of this patent
Estimating the term…
Abstract
A method and system for generating a finite state grammar is provided. The method comprises receiving user input of at least two sample phrases; analyzing the sample phrases to determine common words that occur in each of the sample phrases and optional words that occur in only some of the sample phrases; creating a mathematical expression representing the sample phrases, the expression including each word found in the sample phrases and an indication of whether a word is a common word or an optional word; displaying the mathematical expression to a user; allowing the user to alter the mathematical expression; generating a finite state grammar corresponding to the altered mathematical expression; and displaying the finite state grammar to the user.
Claims18
A method, comprising:
- receiving input of a plurality of sample phrases each comprising a plurality of words;
- representing each sample phrase as a node in a tree;
- forming a mathematical expression for each pair of nodes in the tree, the mathematical expression comprising a plurality of words found in the sample phrases of a pair of nodes and an indication of whether a word is a common word that occurs in each of the plurality of phrases or an optional word that occurs in some of the plurality of phrases for the pair of nodes;
- and
- generating a compact mathematical expression by comparing mathematical expressions, wherein the compact mathematical expression includes each of the plurality of words found in the sample phrases and an indication of whether each of the plurality of words is a common word or an optional word.
A non-transitory computer-readable storage medium comprising instructions for:
- receiving input of a plurality of sample phrases each comprising a plurality of words;
- representing each sample phrase as a node in a tree;
- forming a mathematical expression for each pair of nodes in the tree, the mathematical expression comprising a plurality of words found in the sample phrases of the pair of nodes and an indication of whether a word is a common word that occurs in each of the plurality of phrases or an optional word that occurs in some of the plurality of phrases for the pair of nodes;
- and
- generating a compact mathematical expression by comparing mathematical expressions, wherein the compact mathematical expression includes each of the plurality of words found in the sample phrases and an indication of whether each of the plurality of words is a common word or an optional word.
A system, comprising:
- a processor;
- and
- a memory coupled to the processor;
- wherein the processor is configured to:
- receive input of a plurality of sample phrases each comprising a plurality of words;
- represent each sample phrase as a node in a tree;
- form a mathematical expression for each pair of nodes in the tree, the mathematical expression comprising a plurality of words found in the sample phrases of the pair of nodes and an indication of whether a word is a common word that occurs in each of the plurality of phrases or an optional word that occurs in some of the plurality of phrases for the pair of nodes;
- and
- generate a compact mathematical expression by comparing mathematical expressions, wherein the compact mathematical expression includes each of the plurality of words found in the sample phrases and an indication of whether each of the plurality of words is a common word or an optional word.
Dependencies are inferred from the claim text.