NATURAL LANGUAGE PROCESSING

• US 20110040553A1
• Filed: 11/13/2007
• Published: 02/17/2011
• Est. Priority Date: 11/13/2006
• Status: Abandoned Application

• Current Assignee: Canon Kabushiki Kaisha (Canon Inc.), Tiksis Technologies OY
• Original Assignee: Tiksis Technologies OY
• Inventors: Sasivarman, Sellon
• Application Number:
  US12/514,644
• Publication Number:
  US 20110040553A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/30 Semantic analysis

Abstract

A method and system for computational interpretation of natural language, wherein in an input string is received from input means. The input string is first tokenizde for providing a list of words. Then the list of words is stemmed for providing the words in the root form. The stemmed list is then tagged for providing classification tags for each word, which allows generating the context sensitive information for each word. Lastly said tags are used for parsing the structural dependencies for each word.

Claims

1. A method for computational interpretation of natural language, wherein in an input string is received from input means, the method comprising:

tokenizing the input string for providing a list of words;

stemming the list of words for providing the words in the root form; and

tagging the stemmed list for providing classification tags for each word;

generating the context sensitive information for each word; and

parsing the structural dependencies for each word, wherein, wherein the parsing is based on said tags and context sensitive information.

2. The method according to claim 1, wherein the tagging is based on a semi-iterative process.

3. The method according to claim 2, further comprising assigning the most probable or the only possible tag for the first iteration.

4. The method according to claim 1, further comprising grouping in said parsing the entire matching phrase with appropriate phrase symbols.

5. The method according to claim 1, wherein said parsing is based on a set of rules arranged in a predetermined order.

6. A system for computational interpretation of natural language, wherein in an input string is received from input means, the system comprising:

input means;

central processing unit comprising a processor, a memory and a mass storage; and

output;

wherein the system is arranged to;

tokenize the input string for providing a list of words;

stem the list of words for providing the words in the root form; and

tag the stemmed list for providing classification tags for each word;

generate the context sensitive information for each word; and

parse the structural dependencies for each word, wherein, wherein the parsing is based on said tags and context sensitive information.

7. The system according to claim 6, wherein the system is arranged to tag based on a semi-iterative process.

8. The system according to claim 7, wherein the system is further arranged to assign the most probable or the only possible tag for the first iteration.

9. The system according to claim 6, wherein the system is further arranged to group in said parsing the entire matching phrase with appropriate phrase symbols.

10. The system according to claim 6, wherein said parsing is based on a set of rules arranged in a predetermined order.

11. A computer program embodied in a computer readable medium for computational interpretation of natural language, wherein in an input string is received from input means, which computer program is arranged to perform following steps when executed in a computing device:

tokenizing the input string for providing a list of words;

stemming the list of words for providing the words in the root form; and

tagging the stemmed list for providing classification tags for each word;

generating the context sensitive information for each word; and

parsing the structural dependencies for each word, wherein, wherein the parsing is based on said tags and context sensitive information.

12. The computer program according to claim 11, wherein the tagging is based on a semi-iterative process.

13. The computer program according to claim 12, further comprising assigning the most probable or the only possible tag for the first iteration.

14. The computer program according to claim 11, further comprising grouping in said parsing the entire matching phrase with appropriate phrase symbols.

15. The computer program according to claim 11, wherein said parsing is based on a set of rules arranged in a predetermined order.

16. A method for interpretation of natural language by a computer system that comprises an input means, a central processing unit that comprises a processor, a memory, and mass storage, and an output, wherein an input string is received from input means, the method comprising:

storing the input string in the memory;

executing instructions by the processor to cause the input string to be divided into one or more tokens, the tokens being stored in the memory as a list of one or more words;

executing instructions by the processor to cause each of the words in the list to be stemmed, stemming comprising identifying a root form for each of the words, each of the identified root forms being stored in the memory;

executing instructions by the processor to create one or more classification tags for each respective word, the classification tags being stored in the memory in association with each of the respective associated words;

executing instructions by the processor to generate context sensitive information for each word, the context sensitive information being stored in the memory; and

executing instructions by the processor to parse the structural dependencies for each word, wherein the parsing is based on said tags and context sensitive information.

17. The method according to claim 16, wherein creating the classification tags is based on a semi-iterative process.

18. The method according to claim 17, wherein creating the classification tags comprises assigning the most probable or the only possible tag for the first iteration.

19. The method according to claim 16, wherein parsing comprises grouping the entire matching phrase with appropriate phrase symbols.

20. The method according to claim 16, wherein said parsing is based on a set of rules arranged in a predetermined order.