COMPUTATIONAL LINGUISTIC SYSTEMS AND METHODS

• US 20100228538A1
• Filed: 03/03/2009
• Published: 09/09/2010
• Est. Priority Date: 03/03/2009
• Status: Abandoned Application

• Current Assignee: John A. Yamada
• Original Assignee: John A. Yamada
• Inventors: YAMADA, John A.
• Application Number:
  US12/397,288
• Publication Number:
  US 20100228538A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/237 Lexical tools

Abstract

An apparatus and corresponding method are disclosed for selecting and managing morphological, syntactic and semantic information found in natural languages using a reduced instruction set grammar (RISG). The apparatus and corresponding method 1) convert natural language inputs into morphological tokens and stores those tokens, 2) convert morphological tokens into syntactic groups and stores those groups, and/or 3) convert syntactic groups into semantic blocks and stores those blocks, and vice versa. The process can start with text and find the corresponding morphological tokens, syntactic groups and/or semantic blocks or start with semantic block(s) and find the corresponding morphological tokens.

Claims

1. A natural language processing system comprising:

a data store having a plurality of x-bar rules;

a data store having a plurality of theta rules; and

a processor to receive an input, process the input using at least the one or more of the x-bar rules and the one or more of the theta rules to produce an output.

2. The system of claim 1, wherein the data store having a plurality of x-bar rules comprises a plurality of x-bar starting rules and a plurality of x-bar expansion rules.

3. The system of claim 1, further comprising a data store having a morphological look-up table.

4. The system of claim 3, wherein the processor further processes the input using the morphological look-up table to produce the output.

5. The system of claim 1, further comprising a data store having a plurality of statistically generated translation rules.

6. The system of claim 3, wherein the processor further processes the input using at least one of the plurality of statistically generated translation rules to produce the output.

7. The system of claim 1, further comprising a data store having environment data.

8. The system of claim 7 wherein the data store having environment data stores environment settings and wherein the environment settings are nested using a push down stack.

9. The system of claim 7 wherein the processor further processes the input using the environment data.

10. The system of claim 1, wherein the input comprises semantic tokens.

11. The system of claim 10, wherein the processor is configured to perform a syntactic expansion of the semantic tokens using at least the one or more theta rules and one or more x-bar rules to produce terminals.

12. The system of claim 1, wherein the input comprises terminals.

13. The system of claim 12, wherein the processor is configured to perform a syntactic reduction of the terminals using at least the one or more x-bar rules, and one or more theta rules to produce semantic tokens.

14. The system of claim 3, wherein the morphological look-up table comprises morphological table data and terminal tagging data.

15. The system of claim 1, wherein the processor is configured to:

select at least one of the x-bar rules and at least one of the theta rules when the processor is processing the input if at least one of the x-bar rules and at least one of the theta rules are mappable to the input;

select at least one of the x-bar rules if at least one of the x-bar rules is mappable to the input and no theta rules are mappable to the input;

select at least one of the theta rules if the at least one of the theta rules is mappable to the input and no x-bar rules are mappable to the input; and

process the input if no theta rules and no x-bar rules are mappable to the input.

16. The system of claim 3, wherein the system comprises a lexicon, the lexicon comprising the data store having the morphological look-up table, the data store having the plurality of x-bar rules, and the data store having the plurality of theta rules.

17. The system of claim 1, wherein each theta rule comprises a key list, an operator and one or more tokens, and wherein each token comprises a variable or a terminal.

18. The system of claim 17, wherein the input comprises one or more tokens, each token comprising a variable or a terminal, and wherein the processor is configured to:

map at least one token in the input to the key list to identify a theta rule; and

replace the at least one token in the input with the one or more tokens of the identified theta rule.

19. The system of claim 1, wherein the x-bar rules are conditional phrase structure rules.

20. The system of claim 3, wherein the morphological table comprises a plurality of table records, each table record including a preamble that is an environment list and a terminal list corresponding to the preamble.

21. The system of claim 20, wherein the processor is configured to decode the table record based on one or more current environment settings and the preamble, and to identify a terminal in the terminal list by calculating a table offset based on the one or more current environmental settings for the morphological table.

22. The system of claim 1, further comprising a data store having a plurality of unit production rules.

23. The system of claim 22, wherein the processor is configured to identify one or more unit production rules and generates one or more spanning trees or groups of spanning trees for the input and map each of the one or more spanning trees or groups of spanning trees to at least one of the plurality of theta rules.

24. The system of claim 22, wherein each unit production includes an attribute corresponding to a token.

25. The system of claim 24, wherein the processor is configured to identify a unit production rule for the input by matching a token in the input with the token in the unit production.

26. A machine readable medium containing executable instructions which cause a data processing system to perform a method comprising:

receiving a semantic input;

mapping the semantic input to at least one theta rule to generate at least one theta-rule clause;

mapping each theta-rule clause to one or more x-bar rules;

modifying each theta-rule clause with the one or more x-bar rules; and

replacing tokens of the modified theta-rule clause with terminals to generate a terminal output.

27. The machine readable medium of claim 26 wherein the input comprises one or more tokens, each token comprising a variable or a terminal, and further comprising:

mapping at least one token in the input to the key list to identify a theta rule; and

replacing each token in the input with the one or more tokens of the identified theta rule.

28. The machine readable medium of claim 26, wherein mapping the semantic input to a theta rule comprises generating one or more spanning trees from the semantic input and mapping the one or more spanning trees to the at least one theta rule.

29. The machine readable medium of claim 26, further comprising determining environment data for the semantic input.

30. The machine readable medium of claim 29, wherein a setting for the environment data is initialized with a default value.

31. The machine readable medium of claim 30, further comprising changing the setting for the environment data if a peg in the semantic input corresponds to an environment group in an environment data store based on an environment rule.

32. The machine readable medium of claim 31, wherein the settings for the environment data are nested using a push down stack.

33. The machine readable medium of claim 29, further comprising attaching environment data to the input using one or more unit productions.

34. The machine readable medium of claim 33, wherein the one or more unit productions each assign one or more attributes to one or more tokens in the semantic input.

35. The machine readable medium of claim 27, further comprising identifying an x-bar rule based on the one or more variables in the semantic input.

36. The machine readable medium of claim 26, further comprising identifying an x-bar starting rule and one or more x-bar expansion rules corresponding to one or more variables in the x-bar starting rule, and wherein if the x-bar expansion rule comprises pegs, evaluating a current setting of environment data and, if the pegs in the x-bar expansion rule correspond to the current setting, replacing each variable in the x-bar starting rule with non-peg tokens in the x-bar expansion rule.

37. The machine readable medium of claim 26, further comprising performing one or more swap and join operations on the terminals before outputting the terminal output.

38. A machine readable medium containing executable instructions which cause a data processing system to perform a method comprising:

receiving a terminal input;

assigning a terminal tag containing one or more tokens to each terminal in the terminal input;

mapping the assigned terminal tags to at least one x-bar rule;

replacing the assigned terminal tags with x-bar reduced terminal tags using the at least one x-bar rule;

mapping the x-bar reduced terminal tags to at least one theta rule to generate semantic output; and

outputting the semantic output.

39. The machine readable medium of claim 38, wherein assigning the terminal tag comprises matching the terminal input with one or more tokens and one or more pegs.

40. The machine readable medium of claim 38, wherein mapping the terminal tags to at least one x-bar rule comprises combining two or more adjacent terminal tags into a set of x-bar reduced terminal tags.

41. The machine readable medium of claim 38, wherein mapping the x-bar reduced terminal tags to the at least one theta rule further comprises generating one or more spanning trees or groups of spanning trees for the x-bar reduced terminal tags and mapping the one or more spanning trees or groups of spanning trees to at least one theta rule.

42. The machine readable medium of claim 38, further comprising performing one or more swap and join operations on the terminal input.

43. The machine readable medium of claim 38, further comprising performing one or more swap and join operations on the semantic output.

44. A machine readable medium containing executable instructions which cause a data processing system to perform a method comprising:

receiving a semantic input;

performing a theta rule expansion on the semantic input;

performing an x-bar expansion on one or more variables of the theta rule expanded semantic input; and

performing a morphological table lookup on the x-bar and theta rule expanded semantic input to generate a terminal output.

45. The machine readable medium of claim 44, wherein performing the x-bar expansion comprises:

performing an x-bar expansion with one or more x-bar starting rules; and

performing an x-bar expansion with one or more x-bar expansion rules.

46. A machine readable medium containing executable instructions which cause a data processing system to perform a method comprising:

receiving a terminal input;

tagging the terminal input to match the terminal input with one or more variables and one or more pegs using a reverse lookup table;

performing one or more x-bar reductions on the tagged terminal input; and

performing a theta reduction on the x-bar reduced tagged terminal input to generate a semantic output.

47. A natural language processing system comprising:

a data store having a morphological look-up table;

a data store having a plurality of x-bar rules;

a data store having a plurality of theta rules;

a data store having environment data;

a data store having a plurality of unit production rules; and

a processor to receive an input, process the input using the one or more of the x-bar rules, one or more of the theta rules, one or more of the plurality of unit production rules, the environment data and the morphological look-up table to produce an output.

48. The system of claim 47 wherein the input comprises terminals.

49. The system of claim 47 wherein the input comprises semantic tokens.