Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Fast text searching: allowing errors
Communications of the ACM
In situ generation of compressed inverted files
Journal of the American Society for Information Science
An adaptive short list for documents on the World Wide Web
Proceedings of the 2nd international conference on Intelligent user interfaces
Activity monitoring: noticing interesting changes in behavior
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Modern Information Retrieval
The Reactive Keyboard
Efficient Index Structures for String Databases
Proceedings of the 27th International Conference on Very Large Data Bases
Predicting UNIX Command Lines: Adjusting to User Patterns
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
Machine learning techniques to make computers easier to use
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
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
Predicting sentences using N-gram language models
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Efficient type-ahead search on relational data: a TASTIER approach
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Extending autocompletion to tolerate errors
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
An evaluation of the GhostWriter system for case-based content suggestions
AICS'09 Proceedings of the 20th Irish conference on Artificial intelligence and cognitive science
Efficient interactive smart keyword search
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
Learning to complete sentences
ECML'05 Proceedings of the 16th European conference on Machine Learning
AutoComPaste: auto-completing text as an alternative to copy-paste
Proceedings of the International Working Conference on Advanced Visual Interfaces
Supporting efficient top-k queries in type-ahead search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Time-sensitive query auto-completion
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Improving sentence completion in dialogues with multi-modal features
SIGDIAL '12 Proceedings of the 13th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Learning to personalize query auto-completion
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Behavioral dynamics on the web: Learning, modeling, and prediction
ACM Transactions on Information Systems (TOIS)
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
Proceedings of the 18th Australasian Document Computing Symposium
| Hi-index | 0.00 |
We discuss a retrieval model in which the task is to complete a sentence, given an initial fragment, and given an application specific document collection. This model is motivated by administrative and call center environments, in which users have to write documents with a certain repetitiveness. We formulate the problem setting and discuss appropriate performance metrics. We present an index-based retrieval algorithm and a cluster-based approach, and evaluate our algorithms using collections of emails that have been written by two distinct service centers.