Processing natural language grammar

1. A method, comprising:

receiving and tagging an input text string, the input text string formed from a user's spoken input;

sorting a plurality of previously tagged text strings by length from longest to shortest;

selecting a longest sorted previously tagged text string:

determining whether the tagged input text string is a substring of the selected previously tagged text string;

in response to the tagged input text string is a substring of the selected previously tagged text string:

comparing a tag of the input text string to a tag of the selected previously tagged text string;

in response to the tag of the input text string not matching the tag of the selected previously tagged test string:

selecting a next longest previously tagged text string; and

repeating determining and comparing for the next longest selected previously tagged text string; and

in response to the tag of the input text string matching the tag of the selected previously tagged test string:

adding the input text string to a natural language grammar;

eliminating the selected previously tagged text string from a natural language grammar via a processor; and

utilizing the input text string to connect a caller with a correct department.

2. The method of claim 1 , further comprising:

examining, via the processor, the tagged input text string for at least one set of substitutions based on content of the input text string; and

performing the at least one set of substitutions by expanding the input text string to create at least one previously tagged text string that includes at least one portion of the input text string and at least one additional portion not previously part of the input text string.

3. The method of claim 2 , wherein each of the at least one previously tagged text string contains words that are the same as the input text string except at least one word has been removed from the input text string and has been replaced by a different word in the at least one previously tagged text string.

4. The method of claim 1 , wherein eliminating the selected previously tagged text string from the natural language grammar comprises determining which comprises a longer text string and eliminating that which is a longer text string among the input text string and the selected previously tagged text string.

5. The method of claim 1 , wherein if the input text string and the previously tagged text string do not share a common pre-assigned tag identifier stored in a memory location, then maintaining the input text string and the previously tagged text string in the natural language grammar by writing both the input text string and previously tagged text string to a source code stored in the memory location.

6. The method of claim 2 , wherein the input text string is a plurality of text strings each of which are examined, via the processor for the at least one set of substitutions based on content of the previously tagged text strings, and wherein at least one of the plurality of input text strings are used to generate a grammar source code file.

7. An apparatus, comprising:

a processor configured to:

receive and tag an input text string, the input text string formed from a user's spoken input;

sort a plurality of previously tagged text strings by length from longest to shortest;

select a longest previously tagged text string:

determine whether the tagged input text string is a substring of the selected previously tagged text string;

in response to the tagged input text string is a substring of the selected previously tagged text string:

compare a tag of the input text string to a tag of the selected previously tagged text string;

in response to the tag of the input text string does not match the tag of the selected previously tagged test string:

select a next longest previously tagged text string; and

repeats determine and compare; and

in response to the tag of the input text string matches the tag of the selected previously tagged test string:

add the input text string to a natural language grammar;

eliminate the selected previously tagged text string from the natural language grammar; and

utilize the input text string to connect a caller with a correct department.

8. The apparatus of claim 7 , wherein the processor is further configured to:

examine the tagged input text string for at least one set of substitutions based on content of the input text string; and

perform the at least one set of substitutions by expanding the input text string to create at least one previously tagged text string that includes at least one portion of the input text string and at least one additional portion not previously part of the input text string.

9. The apparatus of claim 8 , wherein each of the at least one previously tagged text string contains words that are the same as the input text string except at least one word has been removed from the input text string and has been replaced by a different word in the at least one previously tagged text string.

10. The apparatus of claim 7 , further comprising a memory location configured to store a pre-assigned tag identifier.

11. The apparatus of claim 10 , wherein an elimination of the selected previously tagged text string from the natural language grammar comprises a determination of which is a longer text string and an elimination of that which is a longer text string among the input text string and the selected previously tagged text string.

12. The apparatus of claim 10 , wherein if the input text string and the selected previously tagged text string do not share a common pre-assigned tag identifier stored in the memory location, then the input text string and the selected previously tagged text string are maintained in the natural language grammar by both the input text string and the selected previously tagged text string being written to a source code stored in the memory location.

13. The apparatus of claim 8 , wherein the input text string is a plurality of text strings each of which are examined, via the processor for the at least one set of substitutions based on content of the previously tagged text strings, and wherein at least one of the plurality of input text strings are used to generate a grammar source code file.

14. A non-transitory computer readable storage medium configured to store a set of instructions that when executed causes a processor to perform:

receiving and tagging an input text string, the input text string formed from a user's spoken input;

sorting a plurality of previously tagged text strings by length from longest to shortest;

selecting a longest sorted previously tagged text string:

determining whether the tagged input text string is a substring of the selected previously tagged text string;

in response to the input text string is a substring of the selected previously tagged text string:

comparing a tag of the input text string to a tag of the selected previously tagged text string;

in response to the tag of the input text string not matching the tag of the selected previously tagged test string:

selecting a next longest previously tagged text string; and

repeating determining and comparing for the next longest selected previously tagged text string; and

in response to the tag of the input text string matching the tag of the selected previously tagged test string:

adding the input text string to a natural language grammar;

eliminating the selected previously tagged text string from a natural language grammar; and

utilizing the input text string to connect a caller with a correct department.

15. The non-transitory computer readable storage medium of claim 14 , wherein the processor is further configured to perform:

examining a tagged input text string for at least one set of substitutions based on content of the input text string and the at least one set of substitutions by expanding the input text string to create at least one previously tagged text string that includes at least one portion of the input text string and at least one additional portion not previously part of the input text string.

16. The non-transitory computer readable storage medium of claim 15 , wherein each of the at least one previously tagged text string contains words that are the same as the input text string except at least one word has been removed from the input text string and has been replaced by a different word in the at least one previously tagged text string.

17. The non-transitory computer readable storage medium of claim 15 , wherein eliminating the selected previously tagged text string comprises determining which is a longer text string.

18. The non-transitory computer readable storage medium of claim 17 , wherein eliminating the selected previously tagged text string comprises eliminating the selected previously tagged test string from the natural language grammar.

19. The non-transitory computer readable storage medium of claim 15 , wherein if the input text string and the selected previously tagged text string do not share a common pre-assigned tag identifier stored in the memory location, then maintaining the input text string and the selected previously tagged text string in the natural language grammar.

20. The non-transitory computer readable storage medium of claim 19 , wherein maintaining the input text string and the selected previously tagged text string in the natural language grammar is performed by writing both the input text string and the selected previously tagged text string to a source code stored in the memory location.