SEMANTIC PARSER

• US 20090024385A1
• Filed: 07/16/2007
• Published: 01/22/2009
• Est. Priority Date: 07/16/2007
• Status: Abandoned Application

• Current Assignee: semgine GmbH
• Original Assignee: semgine GmbH
• Inventors: Hirsch, Martin Christian
• Application Number:
  US11/778,529
• Publication Number:
  US 20090024385A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/205 Parsing
• CPC Class Codes: G06F 40/30 Semantic analysis

Abstract

A method and an apparatus for semantic parsing of electronic text documents. The electronic text documents can comprise a plurality of sentences with several language components. The method comprises analyzing at least one sentence of the electronic text document and dynamically generating a graph from the analyzed sentence of the text document. The graph represents a semantic representation of the analyzed one or more sentences. The method continues the analysis until an ambiguous sentence is determined and analyzed by evaluating at least a portion of the generated graph.

Claims

1. A method for semantic parsing at least one information source, the at least one information source having a plurality of information portions, each one of the plurality of information portions comprising at least one first information element being associated with at least one second information element, the method comprising:

analyzing one of the plurality of information portions of the at least one lo information source;

generating a graph from the plurality of information portions to obtain at least one first initial node representing the at least one first information element and having a first initial weight, at least one second initial node representing the at least one second information element and having a second initial weight, and at least one first edge connecting the at least one first initial node with the at least one second initial node;

analysing a further one of the plurality of information portions of the at least one information source to determine further ones of the at least one information elements;

adding further nodes with further weights to the generated graph representing the further ones of the at least one information elements, and adding further edges to the generated graph between associated ones of the added further nodes as well as associated ones of the initial nodes and the associated ones of the added further nodes; and

continuing the analysis of the further ones of the plurality of information portions and the addition of further nodes, further weights and further edges to the generated graph until a first ambiguous one of the further ones of the plurality of information portions of the at least one information source is determined and analyzed by evaluating at least a portion of the generated graph.

2. The method according to claim 1, wherein the first initial weight is selected from the group consisting of a frequency number and activation information of the at least one first information element.

3. The method according to claim 1, further comprising continuing the analysis of the further ones of the plurality of information portions and the addition of further nodes and further edges to the graph until a further ambiguous one of the further ones of the plurality of information portions of the at least one information source is determined and analyzed by evaluating at least a portion of the generated graph.

4. The method according to claim 1, further comprising continuing the analysis of the further ones of the plurality of information portions and the addition of further nodes and further edges to the graph until a last remaining one of the plurality of information lo portions is analyzed.

5. The method according to claim 1, wherein analysing one of the plurality of information portions further comprises parsing the one of the plurality of information portions.

6. The method according to claim 1, wherein analysing one of the plurality of information portions further comprises selecting the one of the plurality of information portions in accordance to a rule.

7. The method according to claim 1, wherein generating the graph further comprises evaluating the at least one first information element in accordance to a rule.

8. The method according to claim 1, wherein generating the graph further comprises integrating the at least one first information element to the generated graph in accordance to a rule.

9. The method according to claim 1, wherein generating the graph further comprises determining at least one first initial node weight of the at least one first initial node in accordance to a rule.

10. The method according to claim 9, wherein determining the at least one first initial node weight further comprises adding a tf-idf value of the at least one first initial node to the at least one first initial node weight.

11. The method according to claim 1, wherein generating the graph further comprises determining at least one first edge weight between the at least one first initial node and the at least one second initial node in accordance to a rule, the at least one first edge weight being represented by the at least one first edge.

12. The method according to claim 11, wherein the at least one first node relation represents a semantic relation.

13. The method according to claim 1, wherein the graph is a dynamic graph.

14. The method according to claim 1, wherein the graph comprises at least one n-order k-graph.

15. The method according to claim 7, wherein the at least one n-order k-graph comprises a first-order k-graph.

16. The method according to claim 1, wherein analysing a further one of the plurality of information portions further comprises parsing the further one of the plurality of information portions.

17. The method according to claim 1, wherein analysing a further one of the plurality of information portions further comprises selecting the further one of the plurality of information portions in accordance to a rule.

18. The method according to claim 1, wherein analysing a further one of the plurality of information portions further comprises evaluating the further one of the plurality of information portions in accordance to a rule.

19. The method according to claim 1, wherein analyzing a further one of the plurality of information portions further comprises determining at least one further node weight of the added further nodes in accordance to a rule.

20. The method according to claim 19, wherein determining the at least one further node weight further comprises adding a tf-idf value of the added further nodes to the at least one further node weight.

21. The method according to claim 1, wherein analyzing a further one of the plurality of information portions further comprises determining at least one further edge weight between associated ones of the added further nodes as well as associated ones of the initial nodes and the associated ones of the added further nodes in accordance to a rule, the at least one further edge weight being represented by the at least one further edge.

22. The method according to claim 21, wherein the at least one further node relation represents a semantic relation.

23. The method according to claim 19, wherein analyzing a further one of the plurality of information portions further comprises adapting at least one of the at least one node weights in dependence of at least a further one of the at least one node weights in accordance to a rule.

24. The method according to claim 21, wherein analyzing a further one of the plurality of information portions further comprises adapting at least one of the at least one edge weights in dependence of at least a further one of the at least one edge weights in accordance to a rule.

25. The method according to claim 1, wherein continuing the analysis further comprises identifying the first ambiguous one of the plurality of information portions in accordance to a rule.

26. The method according to claim 25, wherein evaluating at least a portion of the graph further comprises determining the identified first ambiguous one of the plurality of information portions in accordance to a rule.

27. The method according to claim 1, wherein the at least one information source comprises at least one electronic text document.

28. The method according to claim 1, wherein the at least one of the plurality of information portions comprises at least one textual element.

29. The method according to claim 1, wherein the method is a computer implemented process.

30. An apparatus for semantic parsing at least one information source, the apparatus comprising:

at least one graph processing engine for generating a graph from a plurality of information portions of the at least one information source and evaluating at least a portion of the generated graph; and

at least one information portion analyzing engine for incrementally analyzing a selected one of the plurality of information portions, transmitting the results of the analyzed information portions to the at least one graph processing engine and, on detection of an ambiguity, resolving the meaning of the ambiguity by using the generated graph.

31. A computer readable tangible medium storing instructions for implementing a process driven by a computer, the instructions controlling the computer to perform the process of semantic parsing at least one information source, the at least one information source having a plurality of information portions, each one of the plurality of information portions comprising at least one first information element being associated with at least one second information element, the semantic parsing at least one information source comprising:

analyzing one of the plurality of information portions of the at least one information source;

generating a graph from the plurality of information portions to obtain at least one first initial node representing the at least one first information element and having a first initial weight, at least one second initial node representing the at least one second information element and having a second initial weight, and at least one first edge connecting the at least one first initial node with the at least one second initial node;

analysing a further one of the plurality of information portions of the at least one information source to determine further ones of the at least one information elements;

adding further nodes with further weights to the generated graph representing the further ones of the at least one information elements, and adding further edges to the generated graph between associated ones of the added further nodes as well as associated ones of the initial nodes and the associated ones of the added further nodes; and

continuing the analysis of the further ones of the plurality of information lo portions and the addition of further nodes, further weights and further edges to the generated graph until a first ambiguous one of the further ones of the plurality of information portions of the at least one information source is determined and analyzed by evaluating at least a portion of the generated graph.

32. A computer program product, being loadable into at least one memory of a computer readable tangible medium or into an electronic data processing apparatus, the computer program product comprising program code means to perform semantic parsing at least one information source, the at least one information source having a plurality of information portions, each one of the plurality of information portions comprising at least one first information element being associated with at least one second information element, the semantic parsing at least one information source comprising:

analyzing one of the plurality of information portions of the at least one information source;

generating a graph from the plurality of information portions to obtain at least one first initial node representing the at least one first information element and having a first initial weight, at least one second initial node representing the at least one second information element and having a second initial weight, and at least one first edge connecting the at least one first initial node with the at least one second initial node;

the graph being a semantic representation of the analyzed one of the plurality of information portions;

analysing a further one of the plurality of information portions of the at least one information source to determine further ones of the at least one information elements;

adding further nodes with further weights to the generated graph representing the further ones of the at least one information elements, and adding further edges to the generated graph between associated ones of the added further nodes as well as associated ones of the initial nodes and the associated ones of the added further nodes; and

continuing the analysis of the further ones of the plurality of information lo portions and the addition of further nodes, further weights and further edges to the generated graph until a first ambiguous one of the further ones of the plurality of information portions of the at least one information source is determined and analyzed by evaluating at least a portion of the generated graph.

33. The computer program product of claim 32, wherein the program code means are executed on the computer readable tangible medium or on the electronic data processing apparatus.