A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
Approximate String-Matching over Suffix Trees
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Faster Approximate String Matching over Compressed Text
DCC '01 Proceedings of the Data Compression Conference
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
A Primitive Operator for Similarity Joins in Data Cleaning
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Record linkage: similarity measures and algorithms
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Approximate string matching using compressed suffix arrays
Theoretical Computer Science
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
Efficient exact set-similarity joins
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Making database systems usable
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Assisted querying using instant-response interfaces
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Journal of Discrete Algorithms
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
Proceedings of the VLDB Endowment
Response time in man-computer conversational transactions
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Efficient type-ahead search on relational data: a TASTIER approach
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient approximate search on string collections
Proceedings of the VLDB Endowment
Bed-tree: an all-purpose index structure for string similarity search based on edit distance
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Trie-join: efficient trie-based string similarity joins with edit-distance constraints
Proceedings of the VLDB Endowment
Keyword-based, context-aware selection of natural language query patterns
Proceedings of the 14th International Conference on Extending Database Technology
Online spelling correction for query completion
Proceedings of the 20th international conference on World wide web
Foundations and Trends in Databases
Location-aware type ahead search on spatial databases: semantics and efficiency
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient exact edit similarity query processing with the asymmetric signature scheme
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient interactive smart keyword search
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable, flexible and generic instant overview search
Proceedings of the 21st international conference companion on World Wide Web
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
Autonomous self-assessment of autocorrections: exploring text message dialogues
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Proceedings of the 21st ACM international conference on Information and knowledge management
Trie-based similarity search and join
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Efficient fuzzy search in large text collections
ACM Transactions on Information Systems (TOIS)
COMMA: A Result-Oriented Composite Autocompletion Method for E-marketplaces
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
String similarity measures and joins with synonyms
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient top-k algorithms for approximate substring matching
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
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)
Asymmetric signature schemes for efficient exact edit similarity query processing
ACM Transactions on Database Systems (TODS)
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
Recent and robust query auto-completion
Proceedings of the 23rd international conference on World wide web
Web Intelligence and Agent Systems
Hi-index | 0.00 |
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the table containing as their prefix the search string typed so far. Just as there is a need for making the lookup operation tolerant to typing errors, we argue that autocompletion also needs to be error-tolerant. In this paper, we take a first step towards addressing this problem. We capture input typing errors via edit distance. We show that a naive approach of invoking an offline edit distance matching algorithm at each step performs poorly and present more efficient algorithms. Our empirical evaluation demonstrates the effectiveness of our algorithms.