US20130262456A1 - Electronic device and method for searching related terms - Google Patents
Electronic device and method for searching related terms Download PDFInfo
- Publication number
- US20130262456A1 US20130262456A1 US13/906,380 US201313906380A US2013262456A1 US 20130262456 A1 US20130262456 A1 US 20130262456A1 US 201313906380 A US201313906380 A US 201313906380A US 2013262456 A1 US2013262456 A1 US 2013262456A1
- Authority
- US
- United States
- Prior art keywords
- term
- indirect
- terms
- query terms
- query
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G06F17/3053—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/3332—Query translation
- G06F16/3338—Query expansion
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
Definitions
- Embodiments of the present disclosure relate to file searching technology, and particularly to an electronic device and method for searching related terms using the electronic device.
- NLP natural language processing
- a query term is “baseball,” the query term “baseball” has a direct relationship with a first term “sport,” and the first term “sport” further has a direct relationship with a second term “basketball.”
- the query term “baseball” has an indirect relation with the second term “basketball.”
- the NLP technology can determine the first term “sport” as the related term of the query term “baseball,” but cannot determine the second term “basketball” as the related term of the query term “baseball.” It is thus less than efficient to implement a search operation according to the query term. Therefore, a more efficient method for searching related terms is desired.
- FIG. 1 is a block diagram of one embodiment of an electronic device including a related term search system.
- FIG. 2 is a block diagram of one embodiment of the related term search system included in the electronic device of FIG. 1 .
- FIG. 3 is a flowchart of one embodiment of a method for searching related terms using the electronic device of the FIG. 1 .
- FIG. 4 is a topological diagram of direct relationship between a plurality of query terms.
- FIG. 5 is an example of a direct related matrix created from the topological diagram of FIG. 4 .
- FIGS. 6 and 7 are exemplary schematic diagrams of related score matrices obtained from FIG. 5 .
- FIG. 8 is an exemplary topological diagram of indirect relationship of a plurality of query terms.
- FIG. 9 is an example of an indirect related matrix created from the topological diagram of FIG. 8 .
- non-transitory readable medium may be a hard disk drive, a compact disc, a digital video disc, a tape drive or other suitable storage medium.
- FIG. 1 is a block diagram of one embodiment of an electronic device 2 including a related term search system 24 .
- the electronic device 2 further includes a display device 20 , an input device 22 , a storage device 23 , and at least one processor 25 .
- the related term search system 24 may be used to determine related terms having indirect relationships with a plurality of query terms stored in the storage device 23 . A detailed description will be given in the following paragraphs.
- the display device 20 may be used to display search results matched with the determined related terms, and the input device 22 may be a mouse or a keyboard used to input computer readable data.
- FIG. 2 is a block diagram of one embodiment of the related term search system 24 in the electronic device 2 .
- the related term search system 24 may include one or more modules, for example, a first calculation module 201 , a second calculation module 202 , a third calculation module 203 , a related term determining module 204 , and a searching module 205 .
- the one or more modules 201 - 204 may comprise computerized code in the form of one or more programs that are stored in the storage device 23 (or memory).
- the computerized code includes instructions that are executed by the at least one processor 25 to provide functions for the one or more modules 201 - 204 .
- FIG. 3 is a flowchart of one embodiment of a method for searching related terms using the electronic device 2 .
- additional blocks may be added, others removed, and the ordering of the blocks may be changed.
- the first calculation module 201 calculates a direct relationship “R i, j ” between every two of a plurality of query terms, and obtains a direct related matrix “R” according to all the calculated direct relationship.
- the query terms may be inputted by a user, or stored in the storage device 23 in advance.
- a direct relationship from “Term 1 ” to “Term 2 ” is 2, but a direct relationship from “Term 2 ” to “Term 1 ” is 1. That is to say, the direct relationship between two terms is determined according to a sequence of the two terms.
- R i, j represents the direct relationship from “Term i ” to “Term j ”, which is referred to as Relation(term i , term j ).
- the second calculation module 202 calculates a related score between every two of the query terms, obtains a related score matrix according to all the calculated related scores, and stores the related score matrix in the storage device 23 .
- the second calculation module 202 may calculate the related score between every two terms of the query terms in FIG. 5 , and obtain a related score matrix “P′,” which is shown in FIG. 7 , according to the calculated related scores.
- the third calculation module 203 calculates an indirect relationship “R′ i, j ” between every two of the query terms according to the direct relationship “R i, j ” and the related score “P i, j ” between every two terms, and stores the calculated indirect relationships in the storage device 23 .
- FIG. 8 shows an exemplary topological diagram of the indirect relationship between “Term 1 ” and other query terms.
- FIG. 9 shows an example of an indirect related matrix “R′” created from the topological diagram of FIG. 8 , where each element “R′ i, j ” in the indirect related matrix “R′” represents an indirect relationship between “Term i ” and “Term j ”.
- the related term determining module 204 determines indirect terms of each query term according to the indirect relationship between every two terms of the query terms, and stores the determined indirect terms in the storage device 23 of the electronic device 2 . Then, the searching module 205 performs a search operation according to the determined indirect terms to obtain search results from a data source, and displays the search results on the display device 20 of the electronic device 2 .
- the data source may be the Internet, at least one database, or at least one file system.
- the related term determining module 204 determines that a first term of the query term is the indirect term of a second term of the query terms if the indirect relationship between the first term and the second term is greater than or equal to a preset value.
- the preset value may be 1.0.
- the indirect terms of “Term 1 ” include “Term 3 ,” “Term 4 ,” “Term 5 ,” and “Term 7 ” whose indirect relationships are greater than 1.0.
- the related term search system 24 determines that the term “A” has the indirect relationship with the term “C”, which is called a second-level relationship.
- the system 24 may determine a third-level relationship or multi-level relationship using the above-mentioned method. For example, if the term “A” has the direct relationship with the term “B,” the term “B” further has the direction relationship with the term “C,” and the term “C” further has the direction relationship with a term “D,” which is referred to as A ⁇ B ⁇ C ⁇ D. Then the system 24 determines that the term “A” has the indirect relationship with the term “D”, which is called the third-level relationship.
Abstract
A method for searching related terms first calculates a direct relationship between every two of a plurality of query terms to obtain a direct related matrix, and calculates a related score between every two of the query terms to obtain a related score matrix. The method further calculates an indirect relationship between every two of the query terms according to the direct relationship and the related score, and determines indirect terms of each query term according to the indirect relationship between every two of the query terms.
Description
- This application is a continuation application of U.S. application Ser. No. 13/217,272, filed on Aug. 25, 2011.
- 1. Technical Field
- Embodiments of the present disclosure relate to file searching technology, and particularly to an electronic device and method for searching related terms using the electronic device.
- 2. Description of Related Art
- Related terms of preset query terms can be obtained using a natural language processing (NLP) method by calculating a relationship between every two of the preset query terms. However, the NLP technology only calculates a direct relationship between every two of the preset query terms, and generates the related terms having the direct relation with the preset query terms. That is to say, the NLP technology cannot calculate an indirect relationship between every two of the preset query terms to generate the related terms having the indirect relationship with the preset query terms, which influences search results corresponding to the preset query terms.
- For example, suppose that a query term is “baseball,” the query term “baseball” has a direct relationship with a first term “sport,” and the first term “sport” further has a direct relationship with a second term “basketball.” Thus, the query term “baseball” has an indirect relation with the second term “basketball.” The NLP technology can determine the first term “sport” as the related term of the query term “baseball,” but cannot determine the second term “basketball” as the related term of the query term “baseball.” It is thus less than efficient to implement a search operation according to the query term. Therefore, a more efficient method for searching related terms is desired.
-
FIG. 1 is a block diagram of one embodiment of an electronic device including a related term search system. -
FIG. 2 is a block diagram of one embodiment of the related term search system included in the electronic device ofFIG. 1 . -
FIG. 3 is a flowchart of one embodiment of a method for searching related terms using the electronic device of theFIG. 1 . -
FIG. 4 is a topological diagram of direct relationship between a plurality of query terms. -
FIG. 5 is an example of a direct related matrix created from the topological diagram ofFIG. 4 . -
FIGS. 6 and 7 are exemplary schematic diagrams of related score matrices obtained fromFIG. 5 . -
FIG. 8 is an exemplary topological diagram of indirect relationship of a plurality of query terms. -
FIG. 9 is an example of an indirect related matrix created from the topological diagram ofFIG. 8 . - All of the processes described below may be embodied in, and fully automated via, functional code modules executed by one or more general purpose electronic devices or processors. The code modules may be stored in any type of non-transitory readable medium or other storage device. Some or all of the methods may alternatively be embodied in specialized hardware. Depending on the embodiment, the non-transitory readable medium may be a hard disk drive, a compact disc, a digital video disc, a tape drive or other suitable storage medium.
-
FIG. 1 is a block diagram of one embodiment of anelectronic device 2 including a relatedterm search system 24. In the embodiment, theelectronic device 2 further includes adisplay device 20, aninput device 22, a storage device 23, and at least oneprocessor 25. The relatedterm search system 24 may be used to determine related terms having indirect relationships with a plurality of query terms stored in the storage device 23. A detailed description will be given in the following paragraphs. - The
display device 20 may be used to display search results matched with the determined related terms, and theinput device 22 may be a mouse or a keyboard used to input computer readable data. -
FIG. 2 is a block diagram of one embodiment of the relatedterm search system 24 in theelectronic device 2. In one embodiment, the relatedterm search system 24 may include one or more modules, for example, afirst calculation module 201, asecond calculation module 202, athird calculation module 203, a relatedterm determining module 204, and asearching module 205. The one or more modules 201-204 may comprise computerized code in the form of one or more programs that are stored in the storage device 23 (or memory). The computerized code includes instructions that are executed by the at least oneprocessor 25 to provide functions for the one or more modules 201-204. -
FIG. 3 is a flowchart of one embodiment of a method for searching related terms using theelectronic device 2. Depending on the embodiment, additional blocks may be added, others removed, and the ordering of the blocks may be changed. - In block S1, the
first calculation module 201 calculates a direct relationship “Ri, j” between every two of a plurality of query terms, and obtains a direct related matrix “R” according to all the calculated direct relationship. In one embodiment, the query terms may be inputted by a user, or stored in the storage device 23 in advance. As shown inFIG. 4 , a direct relationship from “Term1” to “Term2” is 2, but a direct relationship from “Term2” to “Term1” is 1. That is to say, the direct relationship between two terms is determined according to a sequence of the two terms. As shown inFIG. 5 , Ri, j represents the direct relationship from “Termi” to “Termj”, which is referred to as Relation(termi, termj). - In block S2, the
second calculation module 202 calculates a related score between every two of the query terms, obtains a related score matrix according to all the calculated related scores, and stores the related score matrix in the storage device 23. In one embodiment, the related score between every two of the query terms is obtained by calculating a conditional probability between every two of the query terms. As shown inFIG. 6 , each element “Pi, j” in the related score matrix “P” represents a conditional probability between “Termi” and “Termj”, where Pi, j=P((Termi∩Termj)|Termi). For example, assume that an occurrence number of a term “A” is 100, and an occurrence number of a term “B” is 30 given the occurrence of the term “A”. Thus, P(AωB)|A)=0.3, that is, the related score from the term “A” to the term “B” is 30%. - In other embodiments, the
second calculation module 202 may calculate the related score using other methods to obtain the related score matrix. For example, assume that a direct relationship from the term “A” to the term “B” is 100, and a direct relationship from the term “B” to a term “C” is 300, where no other terms have a direct relationship with the term “B,” which is referred to as A→B→C. Thus, a total related value of the term “B” equals to (100+300)=400, where the term “A” occupies 100 (i.e., 25%), the term “C” occupies 300 (i.e., 75%). That is to say, the related score between the term “B” and the term “C” equals to 0.75, and an indirect relationship between the term “A” and the term “C” equals to 100*0.75=75. Using this method, thesecond calculation module 202 may calculate the related score between every two terms of the query terms inFIG. 5 , and obtain a related score matrix “P′,” which is shown inFIG. 7 , according to the calculated related scores. - In block S3, the
third calculation module 203 calculates an indirect relationship “R′i, j” between every two of the query terms according to the direct relationship “Ri, j” and the related score “Pi, j” between every two terms, and stores the calculated indirect relationships in the storage device 23. In one embodiment, the indirect relationship “R′i, j” between every two terms of the query terms is calculated by a formula of R′i,j=ΣK=1 nRi,k*Pk,j,k≠i,j, where the variable “n” represents a total number of the query terms, for example, n=7 as shown inFIG. 4 .FIG. 8 shows an exemplary topological diagram of the indirect relationship between “Term1” and other query terms.FIG. 9 shows an example of an indirect related matrix “R′” created from the topological diagram ofFIG. 8 , where each element “R′i, j” in the indirect related matrix “R′” represents an indirect relationship between “Termi” and “Termj”. - In block S4, the related
term determining module 204 determines indirect terms of each query term according to the indirect relationship between every two terms of the query terms, and stores the determined indirect terms in the storage device 23 of theelectronic device 2. Then, thesearching module 205 performs a search operation according to the determined indirect terms to obtain search results from a data source, and displays the search results on thedisplay device 20 of theelectronic device 2. The data source may be the Internet, at least one database, or at least one file system. In one embodiment, the relatedterm determining module 204 determines that a first term of the query term is the indirect term of a second term of the query terms if the indirect relationship between the first term and the second term is greater than or equal to a preset value. The preset value may be 1.0. For example, as shown inFIG. 9 , the indirect terms of “Term1” include “Term3,” “Term4,” “Term5,” and “Term7” whose indirect relationships are greater than 1.0. - In one embodiment, if the term “A” has the direct relationship with the term “B,” and the term “B” further has the direction relationship with the term “C,” which is referred to as A→B→C. Then the related
term search system 24 determines that the term “A” has the indirect relationship with the term “C”, which is called a second-level relationship. In other embodiments, thesystem 24 may determine a third-level relationship or multi-level relationship using the above-mentioned method. For example, if the term “A” has the direct relationship with the term “B,” the term “B” further has the direction relationship with the term “C,” and the term “C” further has the direction relationship with a term “D,” which is referred to as A→B→C→D. Then thesystem 24 determines that the term “A” has the indirect relationship with the term “D”, which is called the third-level relationship. - It should be emphasized that the above-described embodiments of the present disclosure, particularly, any embodiments, are merely possible examples of implementations, merely set forth for a clear understanding of the principles of the disclosure. Many variations and modifications may be made to the above-described embodiment(s) of the disclosure without departing substantially from the spirit and principles of the disclosure. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present disclosure and protected by the following claims.
Claims (20)
1. A method for calculating indirect relationships between a plurality of query terms using an electronic device, the method comprising:
obtaining the plurality of query terms from a storage device of the electronic device;
calculating a direct relationship “Ri, j” between every two of the query terms;
calculating a related score “Pi, j” between every two of the query terms; and
calculating an indirect relationship “R′i, j” between every two of the query terms according to the direct relationship “Ri, j” and the related score “Pi, j” between every two of the query terms.
2. The method according to claim 1 , further comprising:
determining indirect terms of each query term according to the indirect relationship between every two of the query terms, and storing the determined indirect terms in the storage device of the electronic device.
3. The method according to claim 2 , further comprising:
obtaining search results from a data source by performing a search operation according to the determined indirect terms, and displaying the search results on a display device of the electronic device.
4. The method according to claim 2 , wherein the related score “Pi, j” between every two of the query terms is obtained by calculating a conditional probability between every two of the query terms.
5. The method according to claim 2 , wherein the indirect relationship “R′i, j” between every two of the query terms is calculated by a formula R′i, j=ΣK=1 nRi,k*Pk,j,k≠i,j, wherein the variable “n” represents a total number of the query terms.
6. The method according to claim 5 , wherein a direct related matrix “R” is generated according to the direct relationships “Ri, j”, a related score matrix “P” is generated according to the related scores “Pi, j”, and the indirect relationship “R′i, j” is calculated using the direct related matrix “R” and the related score matrix “P” according to the formula.
7. The method according to claim 2 , wherein the determining step comprises: determining that a first term of the query term is the indirect term of a second term of the query terms upon the condition that the indirect relationship between the first term and the second term is greater than or equal to a preset value.
8. The method according to claim 7 , wherein the preset value is 1.0.
9. An electronic device, comprising:
a processor;
a storage device storing a plurality of instructions, which when executed by the processor, causes the processor to:
obtain a plurality of query terms from the storage device;
calculate a direct relationship “Ri, j” between every two of the query terms;
calculate a related score “Pi, j” between every two of the query terms; and
calculate an indirect relationship “R′i, j” between every two of the query terms according to the direct relationship “Ri, j” and the related score “Pi, j” between every two of the query terms.
10. The electronic device according to claim 9 , wherein the plurality of instructions further comprise:
determining indirect terms of each query term according to the indirect relationship between every two of the query terms, and store the determined indirect terms in the storage device.
11. The electronic device according to claim 10 , wherein the plurality of instructions further comprise:
obtaining search results from a data source by performing a search operation according to the determined indirect terms, and displaying the search results on a display device of the electronic device.
12. The electronic device according to claim 10 , wherein the related score “Pi, j” between every two of the query terms is obtained by calculating a conditional probability between every two of the query terms.
13. The electronic device according to claim 10 , wherein the indirect relationship “R′i, j” between every two of the query terms is calculated by a formula R′i,j=ΣK=1 nRi,k*Pk,j,k≠i,j, wherein the variable “n” represents a number of the query terms.
14. The electronic device according to claim 10 , wherein the instruction of determining indirect terms of each query term according to the indirect relationship between every two of the query terms comprises: determining that a first term of the query term is the indirect term of a second term of the query terms upon the condition that the indirect relationship between the first term and the second term is greater than or equal to a preset value.
15. A non-transitory storage medium having stored thereon instructions that, when executed by a processor of an electronic device, causes the processor to perform a method for calculating indirect relationships between a plurality of query terms, the method comprising:
obtaining the plurality of query terms from a storage device of the electronic device;
calculating a direct relationship “Ri, j” between every two of the query terms;
calculating a related score “Pi, j” between every two of the query terms; and
calculating an indirect relationship “R′i, j” between every two of the query terms according to the direct relationship “Ri, j” and the related score “Pi, j” between every two of the query terms.
16. The non-transitory storage medium according to claim 15 , wherein the method further comprises:
determining indirect terms of each query term according to the indirect relationship between every two of the query terms, and storing the determined indirect terms in the storage device of the electronic device.
17. The non-transitory storage medium according to claim 16 , wherein the method further comprises:
obtaining search results from a data source by performing a search operation according to the determined indirect terms, and displaying the search results on a display device of the electronic device.
18. The non-transitory storage medium according to claim 16 , wherein the related score “Pi, j” between every two of the query terms is obtained by calculating a conditional probability between every two of the query terms.
19. The non-transitory storage medium according to claim 16 , wherein the indirect relationship “R′i, j” between every two of the query terms is calculated by a formula R′i,j=ΣK=1 nRi,k*Pk,j,k≠i,j, wherein the variable “n” represents a total number of the query terms.
20. The non-transitory storage medium according to claim 16 , wherein the determining step comprises: determining that a first term of the query term is the indirect term of a second term of the query terms upon the condition that the indirect relationship between the first term and the second term is greater than or equal to a preset value.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/906,380 US20130262456A1 (en) | 2011-01-27 | 2013-05-31 | Electronic device and method for searching related terms |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW100103067 | 2011-01-27 | ||
TW100103067A TW201232292A (en) | 2011-01-27 | 2011-01-27 | System and method for searching indirect terms |
US13/217,272 US8478770B2 (en) | 2011-01-27 | 2011-08-25 | Electronic device and method for searching related terms |
US13/906,380 US20130262456A1 (en) | 2011-01-27 | 2013-05-31 | Electronic device and method for searching related terms |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/217,272 Continuation US8478770B2 (en) | 2011-01-27 | 2011-08-25 | Electronic device and method for searching related terms |
Publications (1)
Publication Number | Publication Date |
---|---|
US20130262456A1 true US20130262456A1 (en) | 2013-10-03 |
Family
ID=44582471
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/217,272 Expired - Fee Related US8478770B2 (en) | 2011-01-27 | 2011-08-25 | Electronic device and method for searching related terms |
US13/906,380 Abandoned US20130262456A1 (en) | 2011-01-27 | 2013-05-31 | Electronic device and method for searching related terms |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/217,272 Expired - Fee Related US8478770B2 (en) | 2011-01-27 | 2011-08-25 | Electronic device and method for searching related terms |
Country Status (3)
Country | Link |
---|---|
US (2) | US8478770B2 (en) |
EP (1) | EP2482203A1 (en) |
TW (1) | TW201232292A (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104216932B (en) * | 2013-09-29 | 2017-11-07 | 北大方正集团有限公司 | The measure and its system of a kind of knowledge point relationship strength |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269368B1 (en) * | 1997-10-17 | 2001-07-31 | Textwise Llc | Information retrieval using dynamic evidence combination |
US6490577B1 (en) * | 1999-04-01 | 2002-12-03 | Polyvista, Inc. | Search engine with user activity memory |
US20060031219A1 (en) * | 2004-07-22 | 2006-02-09 | Leon Chernyak | Method and apparatus for informational processing based on creation of term-proximity graphs and their embeddings into informational units |
US20070038621A1 (en) * | 2005-08-10 | 2007-02-15 | Tina Weyand | System and method for determining alternate search queries |
US20080154886A1 (en) * | 2006-10-30 | 2008-06-26 | Seeqpod, Inc. | System and method for summarizing search results |
US7603349B1 (en) * | 2004-07-29 | 2009-10-13 | Yahoo! Inc. | User interfaces for search systems using in-line contextual queries |
US20100106719A1 (en) * | 2008-10-23 | 2010-04-29 | Debora Donato | Context-sensitive search |
US7752220B2 (en) * | 2005-08-10 | 2010-07-06 | Yahoo! Inc. | Alternative search query processing in a term bidding system |
US7856441B1 (en) * | 2005-01-10 | 2010-12-21 | Yahoo! Inc. | Search systems and methods using enhanced contextual queries |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8108405B2 (en) | 2007-10-05 | 2012-01-31 | Fujitsu Limited | Refining a search space in response to user input |
-
2011
- 2011-01-27 TW TW100103067A patent/TW201232292A/en unknown
- 2011-08-25 US US13/217,272 patent/US8478770B2/en not_active Expired - Fee Related
- 2011-08-26 EP EP11179097A patent/EP2482203A1/en not_active Withdrawn
-
2013
- 2013-05-31 US US13/906,380 patent/US20130262456A1/en not_active Abandoned
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269368B1 (en) * | 1997-10-17 | 2001-07-31 | Textwise Llc | Information retrieval using dynamic evidence combination |
US6490577B1 (en) * | 1999-04-01 | 2002-12-03 | Polyvista, Inc. | Search engine with user activity memory |
US20060031219A1 (en) * | 2004-07-22 | 2006-02-09 | Leon Chernyak | Method and apparatus for informational processing based on creation of term-proximity graphs and their embeddings into informational units |
US7603349B1 (en) * | 2004-07-29 | 2009-10-13 | Yahoo! Inc. | User interfaces for search systems using in-line contextual queries |
US7856441B1 (en) * | 2005-01-10 | 2010-12-21 | Yahoo! Inc. | Search systems and methods using enhanced contextual queries |
US20070038621A1 (en) * | 2005-08-10 | 2007-02-15 | Tina Weyand | System and method for determining alternate search queries |
US7752220B2 (en) * | 2005-08-10 | 2010-07-06 | Yahoo! Inc. | Alternative search query processing in a term bidding system |
US20080154886A1 (en) * | 2006-10-30 | 2008-06-26 | Seeqpod, Inc. | System and method for summarizing search results |
US20100106719A1 (en) * | 2008-10-23 | 2010-04-29 | Debora Donato | Context-sensitive search |
Also Published As
Publication number | Publication date |
---|---|
US8478770B2 (en) | 2013-07-02 |
EP2482203A1 (en) | 2012-08-01 |
US20120197878A1 (en) | 2012-08-02 |
TW201232292A (en) | 2012-08-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110517785B (en) | Similar case searching method, device and equipment | |
US9436707B2 (en) | Content-based image ranking | |
US10169412B2 (en) | Selectivity estimation for query execution planning in a database | |
US8856098B2 (en) | Ranking search results based on word weight | |
US20120078936A1 (en) | Visual-cue refinement of user query results | |
US9740789B2 (en) | Search engine analytics and optimization for media content in social networks | |
WO2019085463A1 (en) | Department demand recommendation method, application server, and computer-readable storage medium | |
US10331717B2 (en) | Method and apparatus for determining similar document set to target document from a plurality of documents | |
CA3085463A1 (en) | Search engine for identifying analogies | |
US20140075299A1 (en) | Systems and methods for generating extraction models | |
US20150058087A1 (en) | Method of identifying similar stores | |
US20140280084A1 (en) | Using structured data for search result deduplication | |
JP2007323315A (en) | Cooperative filtering method, cooperative filtering device, cooperative filtering program and recording medium with the same program recorded thereon | |
US10007713B2 (en) | Metadata extraction and management | |
TW201624320A (en) | System and method for searching video clips of a video file | |
US20130226936A1 (en) | Electronic device and method for searching related terms | |
US8478770B2 (en) | Electronic device and method for searching related terms | |
US10296533B2 (en) | Method and system for generation of a table of content by processing multimedia content | |
CN103984754A (en) | Search system and search method | |
US8489592B2 (en) | Electronic device and method for searching related terms | |
CN107908724B (en) | Data model matching method, device, equipment and storage medium | |
US20150170067A1 (en) | Determining analysis recommendations based on data analysis context | |
WO2018223718A1 (en) | Trending topic detection method, apparatus and device, and medium | |
US20220059195A1 (en) | Techniques for data-enabled drug discovery | |
US20130268518A1 (en) | Electronic device and method for searching related terms |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: HON HAI PRECISION INDUSTRY CO., LTD., TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LEE, CHUNG-I;YEH, CHIEN-FA;LU, CHIU-HUA;AND OTHERS;SIGNING DATES FROM 20110722 TO 20110809;REEL/FRAME:030518/0968 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |