Method and system for semantic search against a document collection

• US 9,116,948 B2
• Filed: 04/24/2013
• Issued: 08/25/2015
• Est. Priority Date: 07/13/2011
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: LinkedIn Corporation (Microsoft Corporation)
• Inventors: Cheng, Heyning, Tunkelang, Daniel
• Primary Examiner(s): MORRISON, JAY A
• Application Number:
  US13/869,327
• Publication Number:
  US 20130232171A1
• Time in Patent Office: 853 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/242 Query formulation
• CPC Class Codes: G06F 16/243 Natural language query formulation
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/24575 using context
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 7/00 Methods or arrangements for processing data by operating upon the order or content of the data handled logic circuits H03K19/00
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

Disclosed in one example is a method for searching. In some examples, the method includes receiving an unstructured search query, parsing the unstructured search query into a plurality of structured search attributes using a search term attribute dictionary, performing a search of a structured database based upon the plurality of structured search attributes to identify a plurality of search results, populating a plurality of form fields of a search form with the plurality of structured search attributes, and displaying the search form in association with the search results.

Claims

1. A method comprising:

receiving an unstructured search query;

parsing the unstructured search query into a plurality of terms corresponding to respective attributes of a plurality of structured search attributes using a search term attribute dictionary, the search term attribute dictionary comprising respective entries for a term and a respective frequency of appearance of the term in at least one of the plurality of structured search attributes in a plurality of past searches;

identifying an additional term in the search term attribute dictionary, wherein the additional term corresponds to the respective attributes of the plurality of structured search attributes for at least one of the plurality of terms;

performing a search of a structured database using the at least one of the plurality of terms and the additional term to identify a plurality of search results;

populating a plurality of form fields of a search form with the plurality of structured search attributes; and

generating the search form for display in association with the search results.

2. The method of claim 1, comprising:

receiving a user-entered edit of one of the plurality of structured search attributes and re-performing the structured search based upon the user-entered edit.

3. The method of claim 1, wherein parsing the unstructured search query into a plurality of structured search attributes comprises performing a shortest path analysis on a graph constructed from a plurality of tokens in the unstructured search query.

4. The method of claim 3, wherein the graph comprises a plurality of nodes that represent a plurality of word boundaries between the plurality of tokens in the unstructured search query and the graph also comprises a plurality of edges that connect respective ones of the plurality of nodes.

5. The method of claim 4, wherein the plurality of edges are weighted based upon a probability determined from the search term attribute dictionary.

6. The method of claim 4, wherein the plurality of edges are weighted based upon a probability that the plurality of terms between a previous word boundary and a successive word boundary correspond to a particular one of the plurality of structured search attributes.

7. A system comprising:

an input module configured to receive an unstructured search query;

means for parsing the unstructured search query into a plurality of terms corresponding to respective attributes of a plurality of structured search attributes using a search term attribute dictionary, the search term attribute dictionary comprising respective entries for a term and a respective frequency of appearance of the term in at least one of the plurality of structured search attributes in a plurality of past searches;

a search module configured to identify an additional term in the search term attribute dictionary, wherein the additional term corresponds to the respective attributes of the plurality of structured search attributes for at least one of the plurality of terms, and perform a search of a structured database using the at least one of the plurality of terms and the additional term to identify a plurality of search results; and

an output module configured to populate a plurality of form fields of a search form with the plurality of structured search attributes, and generate the search form for display in association with the search results.

8. A machine readable medium that is not a transitory propagating signal, the machine readable medium comprising instructions, which when performed by a machine, cause the machine to perform operations comprising:

receiving an unstructured search query;

parsing the unstructured search query into a plurality of terms corresponding to respective attributes of a plurality of structured search attributes using a search term attribute dictionary, the search term attribute dictionary comprising respective entries for a term and a respective frequency of appearance of the term in at least one of the plurality of structured search attributes in a plurality of past searches;

identifying an additional term in the search term attribute dictionary, wherein the additional term corresponds to the respective attributes of the plurality of structured search attributes for at least one of the plurality of terms;

performing a search of a structured database using the at least one of the plurality of terms and the additional term to identify a plurality of search results;

populating a plurality of form fields of a search form with the plurality of structured search attributes; and

generating the search form for display in association with the search results.

9. The machine readable medium of claim 8, wherein the instructions comprise instructions, which when performed by the machine, causes the machine to perform the operations of:

receiving a user-entered edit of one of the plurality of structured search attributes and re-performing the structured search based upon the user-entered edit.

10. The machine readable medium of claim 8, wherein the instructions for parsing the unstructured search query into a plurality of structured search attributes comprises instructions which when performed by the machine causes the machine to perform the operations comprising:

performing a shortest path analysis on a graph constructed from a plurality of tokens in the unstructured search query.

11. The machine readable medium of claim 10, wherein the graph comprises a plurality of nodes that represent a plurality of word boundaries between the plurality of tokens in the unstructured search query and the graph also comprises a plurality of edges that connect respective ones of the plurality of nodes.

12. The machine readable medium of claim 11, wherein the instructions include instructions, which when performed by the machine, cause the machine to perform the operations of weighting the plurality of edges based upon a probability determined from the search term attribute dictionary.

13. The machine readable medium of claim 11, wherein the instructions include instructions, which when performed by the machine, cause the machine to perform the operations of weighting the plurality of edges based upon a probability that the plurality of terms between a previous word boundary and a successive word boundary correspond to a particular one of the plurality of structured search attributes.

14. A system comprising:

a processor configured to include;

an input module configured to;

receive an unstructured search query;

a parse module configured to;

parse the unstructured search query into a plurality of terms corresponding to respective attributes of a plurality of structured search attributes using a search term attribute dictionary, the search term attribute dictionary comprising respective entries for a term and a respective frequency of appearance of the term in at least one of the plurality of structured search attributes in a plurality of past searches;

a search module configured to;

identify an additional term in the search term attribute dictionary, wherein the additional term corresponds to the respective attributes of the plurality of structured search attributes for at least one of the plurality of terms;

perform a search of a structured database using the at least one of the plurality of terms and the additional term to identify a plurality of search results; and

an output module configured to;

populate a plurality of form fields of a search form with the plurality of structured search attributes; and

generate the search form for display in association with the search results.

15. The system of claim 14, wherein the input module is configured to:

receive a user-entered edit of one of the plurality of structured search attributes and re-performing the structured search based upon the user-entered edit.

16. The system of claim 14, wherein the parse module is configured to parse the unstructured search query into a plurality of structured search attributes by at least being configured to perform a shortest path analysis on a graph constructed from a plurality of tokens in the unstructured search query.

17. The system of claim 16, wherein the graph comprises a plurality of nodes that represent a plurality of word boundaries between the plurality of tokens in the unstructured search query and the graph also comprises a plurality of edges that connect respective ones of the plurality of nodes.

18. The system of claim 17, wherein the parse module is configured to weight the plurality of edges based upon a probability determined from the search term attribute dictionary.

19. The system of claim 17, wherein the parse module is configured to weight the plurality of edges based upon a probability that the plurality of terms between a previous word boundary and a successive word boundary correspond to a particular one of the plurality of structured search attributes.