Configurable grammar templates

• US 20070055492A1
• Filed: 10/26/2005
• Published: 03/08/2007
• Est. Priority Date: 09/02/2005
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Ju, Yun-Cheng, Yu, Dong, Acero, Alejandro, Wang, Ye-Yi
• Application Number:
  US11/259,475
• Publication Number:
  US 20070055492A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/186 Templates
• CPC Class Codes: G10L 15/193 Formal grammars, e.g. finite state automata, context free grammars or word networks

Abstract

To provide application developers with the ability to easily form customized grammars, grammar extensions are provided that allow application developers to selectively include portions of grammar templates and to easily combine grammar elements to form new grammar structures.

Claims

1. A method comprising:

receiving a grammar that comprises a reference to a template and a parameter value used by the template; and

compiling the grammar by utilizing the template and the parameter value to determine what grammar elements to include in a compiled grammar.

2. The method of claim 1 further comprising positioning the grammar elements in the compiled grammar based on the position of the reference to the template in the grammar.

3. The method of claim 1 wherein the parameter value is associated with the reference to the template.

4. The method of claim 1 wherein the grammar further comprises a second reference to the template and a second parameter value associated with the second reference, the second parameter value being different than the parameter value.

6. The method of claim 1 wherein the template is defined within the grammar.

7. The method of claim 1 wherein compiling the grammar comprises accessing a remote computing device to retrieve the template.

8. The method of claim 1 wherein the reference to the template is located within a second template in the grammar.

9. The method of claim 1 wherein the reference to a template is delimited by <

templateref>

tags.

5. The method of claim 5 wherein compiling the grammar comprises inserting a first set of grammar elements from the template based on the reference to the template and the parameter value and inserting a second set of grammar elements from the template based on the second reference to the template and the second parameter value, the second set of grammar elements being different from the first set of grammar elements.

10. A computer-implemented method comprising:

locating a grammar operator in a grammar that indicates that two items in the grammar are to be combined;

locating the two items in the grammar; and

combining the two items in the grammar to form an output item for a compiled grammar.

11. The method of claim 10 wherein the grammar operator indicates that items in two lists in the grammar are to be pair-wise combined to form an output list of items.

12. The method of claim 11 wherein the grammar operator indicates that each item in the output list of items comprises an item from one list in the grammar concatenated with an item from a second list in the grammar.

13. The method of claim 11 wherein the grammar operator indicates that each item in the output list of items comprises an item from one list in the grammar and a semantic value set equal to an item from a second list in the grammar.

14. The method of claim 10 wherein locating a grammar operator comprises locating tags that delimit items to be combined.

15. A method comprising including a template reference in a first form of a grammar, the template reference identifying a template and a value for a parameter used in the template to identify grammar elements to include in a second form of the grammar.

16. The method of claim 15 wherein identifying a template comprises identifying a template such that a compiler algorithmically generates elements of the second form of the grammar.

17. The method of claim 16 wherein identifying a template comprises identifying a template for an alphanumeric concept and wherein identifying a value for a parameter comprises identifying at least one regular expression to be represented by the grammar elements generated by the compiler.

18. The method of claim 16 wherein identifying a template comprises identifying a cardinal number template and wherein identifying a value for a parameter comprises identifying a set of numbers to be represented by the grammar elements generated by the compiler.

19. The method of claim 16 wherein identifying a template comprises identifying an ordinal number template and wherein identifying a value for a parameter comprises identifying a set of numbers to be represented by the grammar elements generated by the compiler.

20. The method of claim 16 wherein identifying a template comprises identifying a list template and wherein identifying a value for a parameter comprises identifying a set of words to include in a list in the grammar elements generated by the compiler.