Identification of intents from query reformulations in search
US-2015379074-A1 · Dec 31, 2015 · US
US9798773B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9798773-B2 |
| Application number | US-201414568787-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 12, 2014 |
| Priority date | Dec 12, 2014 |
| Publication date | Oct 24, 2017 |
| Grant date | Oct 24, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The method includes automatic creation of mapping definitions. The method further includes analyzing an external data structure, wherein the external data structure has one or more elements. The method further includes determining a path length and a number of occurrences for each element of a first set of elements of the one or more elements. The method further includes generating at least one query statement for the first set of elements. The method further includes generating mapping definitions based, at least in part on the at least one generated query statement and the path length of each element of the first set of elements.
Opening claim text (preview).
What is claimed is: 1. A computer program product for the automatic creation of mapping definitions, the computer program product comprising: one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising: program instructions to analyze an external data structure, wherein the external data structure has one or more elements; program instructions to determine a path length and a number of occurrences for each element of a first set of elements of the one or more elements; program instructions to generate at least one query statement for the first set of elements; and program instructions to generate mapping definitions based, at least in part, on the at least one generated query statement and the path length of each element of the first set of elements. 2. The computer program product of claim 1 , wherein the mapping definition controls the presentation of content of an information source in a content management system. 3. The computer program product of claim 1 , wherein generating mapping definitions further comprises program instructions to: determine a shortest path length based, at least in part, on the path length of each element of the first set of elements; and generate mapping definitions based on the at least one generated query statement and the shortest path length. 4. The computer program product of claim 3 , wherein identifying the shortest path length comprises computer instructions to: determine that a first element of the first set of elements has the same path length as a second element of the first set of elements; and determine that the first element has a greater number of occurrences than the second element and, in response, determining the shortest path length to be the path length of the first element. 5. The computer program product of claim 1 , wherein generating the at least one query statement comprises program instructions to: identify a first element of the one or more elements having a path that is the same as a path of a second element of the one or more elements; and generate the at least one query statement based on the identified first element and second element. 6. The computer program product of claim 1 , further comprising program instructions to: receive input identifying a second set of elements of the one or more elements of the external data structure, where the second set of elements is mutually exclusive of the first set of elements. 7. The computer program product of claim 6 , wherein generating mapping definitions comprises program instructions to: receive a name for an element of the second set of elements; and generate a mapping definition for the element of the second set of elements based, at least in part, on the received name. 8. A computer system for the automatic creation of mapping definitions, the computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to analyze an external data structure, wherein the external data structure has one or more elements; program instructions to determine a path length and a number of occurrences for each element of a first set of elements of the one or more elements; program instructions to generate at least one query statement for the first set of elements; and program instructions to generate mapping definitions based, at least in part, on the at least one generated query statement and the path length of each element of the first set of elements. 9. The computer system of claim 8 , wherein the mapping definition controls the presentation of content of an information source in a content management system. 10. The computer system of claim 8 , wherein generating mapping definitions further comprises program instructions to: determine a shortest path length based, at least in part, on the path length of each element of the first set of elements; and generate mapping definitions based on the at least one generated query statement and the shortest path length. 11. The computer system of claim 10 , wherein identifying the shortest path length comprises computer instructions to: determine that a first element of the first set of elements has the same path length as a second element of the first set of elements; and determine that the first element has a greater number of occurrences than the second element and, in response, determining the shortest path length to be the path length of the first element. 12. The computer system of claim 8 , wherein generating the at least one query statement comprises program instructions to: identify a first element of the one or more elements having a path that is the same as a path of a second element of the one or more elements; and generate the at least one query statement based on the identified first element and second element. 13. The computer system of claim 8 , further comprising program instructions to: receive input identifying a second set of elements of the one or more elements of the external data structure, where the second set of elements is mutually exclusive of the first set of elements. 14. The computer system of claim 13 , wherein generating mapping definitions comprises program instructions to: receive a name for an element of the second set of elements; and generate a mapping definition for the element of the second set of elements based, at least in part, on the received name.
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.