Semantic text search

• US 9,836,529 B2
• Filed: 03/10/2015
• Issued: 12/05/2017
• Est. Priority Date: 09/22/2014
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Zelevinsky, Vladimir, Dashevsky, Yevgeniy, Ye, Diana
• Primary Examiner(s): Abebe, Daniel
• Application Number:
  US14/643,390
• Publication Number:
  US 20160085853A1
• Time in Patent Office: 1,001 Days
• Field of Search: 704 9
• CPC Class Codes: G06F 16/3329 Natural language query formulation or dialogue systems
• CPC Class Codes: G06F 16/3338 Query expansion
• CPC Class Codes: G06F 16/3344 using natural language analysis
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
• CPC Class Codes: G06F 40/30 Semantic analysis

Abstract

A system for performing semantic search receives an electronic text corpus and separates the text corpus into a plurality of sentences. The system parses and converts each sentence into a sentence tree. The system receives a search query and matches the search query with one or more of the sentence trees.

Claims

1. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to perform semantic search, the semantic search comprising:

receiving an electronic text corpus;

separating the text corpus into a plurality of sentences;

parsing and converting each sentence into a sentence tree;

receiving a search query via a user interface;

converting the search query into a search query tree;

matching the search query tree with one or more of the sentence trees; and

in response to the matching, providing refinements to the search query that correspond to the matched sentence trees, wherein the refinements comprise increasing the search query tree by adding one or more additional terms.

2. The computer-readable medium of claim 1, wherein the one or more additional terms are connected to search terms of the search query by a direct edge.

3. The computer-readable medium of claim 1, further comprising:

in response to the matching, providing documents from the text corpus that correspond to the matched sentence trees.

4. The computer-readable medium of claim 1, wherein the refinements are implemented as refinement links on the user interface.

5. The computer-readable medium of claim 1, further comprising:

in response to the matching, extracting sentiments for the search query that correspond to the matched sentence trees, the sentiments comprising modifiers to search terms of the query.

6. The computer-readable medium of claim 1, further comprising using a source external to the text corpus to enrich the sentence trees.

7. The computer-readable medium of claim 1, wherein the user interface displays hypernym matching for the search query tree.

8. The computer-readable medium of claim 1, further comprising modifying one or more of the sentence trees, wherein each sentence tree comprises nodes and at least one edge, and the modifying comprises at least one of:

expanding a node, collapsing a node, expanding an edge, or collapsing an edge.

9. The computer-readable medium of claim 2, wherein the query tree comprises at least one node, further comprising:

after the matching, allowing the user to further refine the semantic search by adding an additional node to the search query tree and repeating the matching.

10. The computer-readable medium of claim 1, further comprising, after receiving the search query, providing selectable refining search queries via the user interface.

11. A method of performing semantic search, the method comprising:

receiving an electronic text corpus;

separating the text corpus into a plurality of sentences;

parsing and converting each sentence into a sentence tree;

receiving a search query via a user interface;

converting the search query into a search query tree;

matching the search query tree with one or more of the sentence trees; and

in response to the matching, providing refinements to the search query that correspond to the matched sentence trees, wherein the refinements comprise increasing the search query tree by adding one or more additional terms.

12. The method of claim 11, wherein the one or more additional terms are connected to search terms of the search query by a direct edge.

13. The method of claim 11, further comprising:

in response to the matching, providing documents from the text corpus that correspond to the matched sentence trees.

14. The method of claim 11, wherein the refinements are implemented as refinement links on the user interface.

15. The method of claim 11, further comprising:

in response to the matching, extracting sentiments for the search query that correspond to the matched sentence trees, the sentiments comprising modifiers to search terms of the query.

16. The method of claim 11, further comprising using a source external to the text corpus to enrich the sentence trees.

17. The method of claim 11, wherein the user interface displays hypernym matching for the search query tree.

18. The method of claim 11, further comprising modifying one or more of the sentence trees, wherein each sentence tree comprises nodes and at least one edge, and the modifying comprises at least one of:

expanding a node, collapsing a node, expanding an edge, or collapsing an edge.

19. A semantic text search query system comprising:

a processor;

a storage device coupled to the processor, wherein the storage device stores a plurality of sentence trees that are formed by separating a text corpus into a plurality of sentences and parsing and converting each sentence into one of the sentence trees;

wherein the processor is adapted to generate a user interface that receives a search query and convert the search query into a search query tree; and

the processor is adapted to match the search query tree with one or more of the sentence trees and, in response to the matching, provide refinements to the search query that correspond to the matched sentence trees, wherein the refinements comprise increasing the search query tree by adding one or more additional terms.

20. The semantic text search query system of claim 19, wherein the one or more additional terms are connected to search terms of the search query by a direct edge.

21. The semantic text search query system of claim 19, the processor further adapted to, in response to the match, providing documents from the text corpus that correspond to the matched sentence trees.

22. The semantic text search query system of claim 19, wherein the refinements are implemented as refinement links on the user interface.

23. The semantic text search query system of claim 19, the processor further adapted to, in response to the match, extracting sentiments for the search query that correspond to the matched sentence trees, the sentiments comprising modifiers to search terms of the query.

24. The semantic text search query system of claim 20, the processor further adapted to, in response to the matching, displaying hypernym matching for the search query tree on the user interface.

25. The semantic text search query system of claim 19, the processor further adapted to modify one or more of the sentence trees, wherein each sentence tree comprises nodes and at least one edge, and the modify comprises at least one of:

expanding a node, collapsing a node, expanding an edge, or collapsing an edge.