Top-k String Auto-Completion with Synonyms

@inproceedings{Xu2017TopkSA,
  title={Top-k String Auto-Completion with Synonyms},
  author={Pengfei Xu and Jiaheng Lu},
  booktitle={DASFAA},
  year={2017}
}
Auto-completion is one of the most prominent features of modern information systems. The existing solutions of auto-completion provide the suggestions based on the beginning of the currently input character sequence (i.e. prefix). However, in many real applications, one entity often has synonyms or abbreviations. For example, “DBMS” is an abbreviation of “Database Management Systems”. In this paper, we study a novel type of auto-completion by using synonyms and abbreviations. We propose three… 
Review on Query Auto-Completion
  • Vidya S. DandagiN. Sidnal
  • Computer Science
    2018 International Conference on Computational Techniques, Electronics and Mechanical Systems (CTEMS)
  • 2018
TLDR
The features of (query auto-completion) QAC are as follows: • Helps in finding the precise words to be used, • Lessens the typographic errors, • helps in faster interaction, • Predicts user’s intended query and improves search quality, • Helpps to meet target queries quickly and brings down ambiguity, and • Aims to enlist the retrieved documents before completing a query.
Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint
TLDR
This paper develops a similarity join algorithm that judiciously selects critical parameters in a prefix filter to maximise its filtering power, supported by an estimation technique and Monte Carlo simulation process.
Loquat: An Interactive System Design for Location-Aware Query Autocompletion
TLDR
An interactive system of location-aware query autocompletion called Loquat is presented, which provides a graphical interface to help users easily formulate their locations-aware queries and develops novel index structures and search algorithms to make such an interactive system work efficiently.
Synergy of Database Techniques and Machine Learning Models for String Similarity Search and Join
  • Lu
  • Computer Science
TLDR
A number of studies of string similarity search and join in the database and machine learning research areas are reviewed, pinpointing promising directions for future work to combine techniques in these two areas.
Synergy of Database Techniques and Machine Learning Models for String Similarity Search and Join
TLDR
A number of studies of string similarity search and join in the database and machine learning research areas are reviewed, pinpointing promising directions for future work to combine techniques in these two areas.
Towards a Unified Framework for String Similarity Joins
TLDR
A new similarity framework is developed that unifies the existing three kinds of similarity measures simultaneously, including syntactic (typographic) similarity, synonym-based similarity, and taxonomy-based similarities, and an approximate algorithm which runs in polynomial time with a non-trivial approximation guarantee is developed.
UDBMS: Road to Unification for Multi-model Data Management
TLDR
Novel principles and technologies to handle multiple models of data in one unified database system, including model-agnostic storage, unified query processing and indexes, in-memory structures and multi-model transactions are envisioned.

References

SHOWING 1-10 OF 14 REFERENCES
A Survey of Query Auto Completion in Information Retrieval
TLDR
A Survey of Query Auto Completion in Information Retrieval is an ideal reference on the topic and provides researchers who are working on query auto completion or related problems in the eld of information retrieval with a good overview and analysis of state-of-the-art QAC approaches.
Boosting the Quality of Approximate String Matching by Synonyms
TLDR
An expansion-based framework to measure string similarities efficiently while considering synonyms is presented and an estimator to estimate the size of candidates to enable an online selection of signature filters is developed, providing strong low-error, high-confidence guarantees while requiring only logarithmic space and time costs.
Efficient type-ahead search on relational data: a TASTIER approach
TLDR
A novel approach to keyword search in the relational world, called Tastier, which proposes efficient index structures and algorithms for finding relevant answers on-the-fly by joining tuples in the database and devise a partition-based method to improve query performance.
Efficient interactive fuzzy keyword search
TLDR
A new information-access paradigm, called "interactive, fuzzy search," in which the system searches the underlying data "on the fly" as the user types in query keywords, and allows users to explore data as they type, even in the presence of minor errors.
Learning Semantic String Transformations from Examples
TLDR
An expressive transformation language for semantic manipulation that combines table lookup operations and syntactic manipulations is described and a synthesis algorithm that can learn all transformations in the language that are consistent with the user-provided set of input-output examples is presented.
Extending autocompletion to tolerate errors
TLDR
This paper captures input typing errors via edit distance and shows that a naive approach of invoking an offline edit distance matching algorithm at each step performs poorly and present more efficient algorithms.
MISO: souping up big data query processing with a multistore system
TLDR
The method, called MISO for MultISstore Online tuning, is adaptive, lightweight, and works in an online fashion utilizing only the by-products of query processing, which are term as opportunistic views.
Index Interactions in Physical Design Tuning: Modeling, Analysis, and Applications
TLDR
The notion of index interactions is formalized and a novel algorithm to identify the interaction relationships that exist within a set of indices is developed, which provides strong analytical results showing that index interactions can enable enhanced functionality.
Experiments with the "Oregon Trail Knapsack Problem"
A Branch and Bound Algorithm for the Knapsack Problem
A branch and bound algorithm for solution of the "knapsack problem," max \sum v i x i where \sum w i x i \leqq W and x i - 0, 1, is presented which can obtain either optimal or approximate solutions.
...
...