Abstract
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as an answer to the question mark (?) in the query {(Japan, Tokyo), (France, ?)} because the relation between Japan and Tokyo is highly similar to that between France and Paris. We propose an approach for exploring and indexing word pairs to efficiently retrieve candidate answers for a latent relational search query. Representing relations between two words in a word pair by lexical patterns allows our search engine to achieve a high MRR and high precision for the top 1 ranked result. When evaluating with a Web corpus, the proposed method achieves an MRR of 0.963 and it retrieves correct answer in the top 1 for 95.0% of queries.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010 |
| Pages | 196-199 |
| Number of pages | 4 |
| Volume | 1 |
| DOIs | |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010 - Toronto, ON Duration: 2010 Aug 31 → 2010 Sept 3 |
Other
| Other | 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010 |
|---|---|
| City | Toronto, ON |
| Period | 10/8/31 → 10/9/3 |
Keywords
- Analogical search
- Latent relational search
- Relational similarity
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Software