Concepts and architectures for next-generation information search engines

Authors:
Simon J. Shepherd
Affiliations:
Advanced Signals Laboratory, SEDT, University of Bradford, BD7 1DP, UK
Venue:
International Journal of Information Management: The Journal for Information Professionals
Year:
2007

Citing 4
Cited 0

A semidiscrete matrix decomposition for latent semantic indexing information retrieval

ACM Transactions on Information Systems (TOIS)
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Matrices, Vector Spaces, and Information Retrieval

SIAM Review
Spectral learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the key features of a next-generation information search engine that will enable more powerful and rewarding searches to be made than is possible with current search technology. By combining several powerful algorithms in a unique way, future search engines will be able to solve the problems of both synonymy and polysemy. The synonymy problem, where several different words mean the same thing, is relatively straightforward and represents the current state-of-the-art in search engine technology. The polysemy problem, where one word means several different things, is much harder to solve. Our proposal for a new kind of search engine (which we call Deep Search) prototypes a new idea combining logical linking, semantic analysis and clustering to overcome these problems and make possible a more powerful information search capability.