IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
UP-0324501
(2002-12-19)
|
등록번호 |
US-7676462
(2010-04-21)
|
발명자
/ 주소 |
- Kirkland, Dustin C.
- Kumhyr, David Bruce
|
출원인 / 주소 |
- International Business Machines Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
28 인용 특허 :
12 |
초록
▼
A search engine is provided that includes a refinement mechanism. The search engine receives and parses a search expression and delimits the expression into individual terms or words. The refinement mechanism includes a directory of related terms and a directory of compound terms. The refinement mec
A search engine is provided that includes a refinement mechanism. The search engine receives and parses a search expression and delimits the expression into individual terms or words. The refinement mechanism includes a directory of related terms and a directory of compound terms. The refinement mechanism also includes a hierarchical data structure of refinement terms. The mechanism then identifies related terms for the individual terms in the search expression, compound terms that may be formed from individual terms in the expression, and terms in the expression that have sub structures or “sub trees” in the hierarchical data structure. An interface is generated in a graphical tree structure to present identified related terms, compound terms, and refinement terms. Based upon user interaction with the interfaces, the mechanism forms an enhanced search expression.
대표청구항
▼
What is claimed is: 1. A method for refining a search expression, the method comprising: receiving, by a processor of a data processing system, a search expression including at least a first search term in a memory of the data processing system; identifying at least a first enhancement term for the
What is claimed is: 1. A method for refining a search expression, the method comprising: receiving, by a processor of a data processing system, a search expression including at least a first search term in a memory of the data processing system; identifying at least a first enhancement term for the first search term; generating an enhancement interface including the search expression forming a trunk of a graphical tree structure and a first branch of the graphical tree structure including the at least a first enhancement term associated with the first search term; presenting the enhancement interface to a user, wherein the enhancement interface includes a preliminary result of using the at least a first enhancement term in the search expression; and responsive to receiving a selection of a given enhancement term from the first branch, forming an enhanced search expression including the given enhancement term. 2. The method of claim 1, further comprising: performing a search for the at least a first enhancement term to receive a search result; and presenting the search result in association with the at least a first enhancement term in the first branch. 3. The method of claim 1, wherein the at least a first enhancement term is selected from the group consisting of a synonym, an antonym, an associated term, an alternate spelling. 4. The method of claim 1, wherein the search expression includes a second search term. 5. The method of claim 4, wherein the at least a first enhancement term is a compound term that is formed from the first search term and the second search term. 6. The method of claim 4, further comprising: identifying at least a second enhancement term for the second search term, wherein the enhancement interface includes a second branch including the at least a second enhancement term associated with the second search term. 7. The method of claim 1, wherein identifying at least a first enhancement term for the first search term includes: receiving a hierarchical data structure including a plurality of terms, wherein each term within the plurality of terms has associated therewith at least one refinement term that further defines the term; determining whether the first search term matches one of the plurality of terms; and responsive to the first search term matching one of the plurality of terms, identifying the at least one refinement term as the first enhancement term. 8. The method of claim 1, wherein the first branch is a list of hyperlinks, wherein each hyperlink in the list of hyperlinks represents an enhancement term. 9. The method of claim 1, wherein forming an enhanced search expression includes replacing the first search term with the given enhancement term. 10. The method of claim 1, wherein forming an enhanced search expression includes adding the given enhancement term to the search expression using an OR operator. 11. The method of claim 1, wherein forming an enhanced search expression includes adding the given enhancement term to the search expression using a NOT operator if the given enhancement term is an antonym. 12. An apparatus for refining a search expression, the apparatus comprising: receipt means for receiving, by a processor of a data processing system, a search expression including at least a first search term in a memory of the data processing system; identification means for identifying at least a first enhancement term for the first search term; interface means for generating an enhancement interface including the search expression forming a trunk of a graphical tree structure and a first branch of the graphical tree structure including the at least a first enhancement term associated with the first search term; presentation means for presenting the enhancement interface to a user, wherein the enhancement interface includes a preliminary result of using the at least a first enhancement term in the search expression; and enhancement means, responsive to receiving a selection of a given enhancement term from the first branch, for forming an enhanced search expression including the given enhancement term. 13. The apparatus of claim 12, further comprising: performance means for performing a search for the at least a first enhancement term to receive a search result; and second presentation means for presenting the search result in association with the at least a first enhancement term in the first branch. 14. The apparatus of claim 12, wherein the at least a first enhancement term is selected from the group consisting of a synonym, an antonym, an associated term, an alternate spelling. 15. The apparatus of claim 12, wherein the search expression includes a second search term. 16. The apparatus of claim 15, wherein the at least a first enhancement term is a compound term that is formed from the first search term and the second search term. 17. The apparatus of claim 15, further comprising: second identification means for identifying at least a second enhancement term for the second search term, wherein the enhancement interface includes a second branch including the at least a second enhancement term associated with the second search term. 18. The apparatus of claim 12, wherein the identification means includes: second receipt means for receiving a hierarchical data structure including a plurality of terms, wherein each term within the plurality of terms has associated therewith at least one refinement term that further defines the term; determination means for determining whether the first search term matches one of the plurality of terms; and second identification means, responsive to the first search term matching one of the plurality of terms, for identifying the at least one refinement term as the first enhancement term. 19. A computer program product, stored in a computer readable storage medium, for refining a search expression, the computer program product comprising: instructions for receiving a search expression including at least a first search term; instructions for identifying at least a first enhancement term for the first search term; instructions for generating an enhancement interface including the search expression forming a trunk of a graphical tree structure and a first branch of the graphical tree structure including the at least a first enhancement term associated with the first search term; instructions for presenting the enhancement interface to a user, wherein the enhancement interface includes a preliminary result of using the at least a first enhancement term in the search expression; and instructions, responsive to receiving a selection of a given enhancement term from the first branch, for forming an enhanced search expression including the given enhancement term. 20. The computer program product of claim 19, further comprising: instructions for performing a search for the at least a first enhancement term to receive a search result; and instructions for presenting the search result in association with the at least a first enhancement term in the first branch.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.