TnT: a statistical part-of-speech tagger
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient and self-tuning incremental query expansion for top-k query processing
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Concept-based interactive query expansion
Proceedings of the 14th ACM international conference on Information and knowledge management
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
On content-driven search-keyword suggesters for literature digital libraries
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
OntoNaviERP: Ontology-Supported Navigation in ERP Software Documentation
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Efficient query expansion for advertisement search
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Context-sensitive query auto-completion
Proceedings of the 20th international conference on World wide web
A Survey of Automatic Query Expansion in Information Retrieval
ACM Computing Surveys (CSUR)
Looking ahead: query preview in exploratory search
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Personalised Information Retrieval: survey and classification
User Modeling and User-Adapted Interaction
| Hi-index | 0.00 |
We present an efficient realization of the following interactive search engine feature: as the user is typing the query, words that are related to the last query word and that would lead to good hits are suggested, as well as selected such hits. The realization has three parts: (i) building clusters of related terms, (ii) adding this information as artificial words to the index such that (iii) the described feature reduces to an instance of prefix search and completion. An efficient solution for the latter is provided by the CompleteSearch engine, with which we have integrated the proposed feature. For building the clusters of related terms we propose a variant of latent semantic indexing that, unlike standard approaches, is completely transparent to the user. By experiments on two large test-collections, we demonstrate that the feature is provided at only a slight increase in query processing time and index size.