DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.11
Ziqi Wang , Peking University, Beijing
Gu Xu , Microsoft Research Asia, Beijing
Hang Li , Huawei Noah?s Ark Lab
Ming Zhang , Peking University, Beijing
Many problems in natural language processing, data mining, information retrieval, and bioinformatics can be formalized as string transformation, which is a task as follows. Given an input string, the system generates the $k$ most likely output strings corresponding to the input string. This paper proposes a novel and probabilistic approach to string transformation, which is both accurate and efficient. The approach includes the use of a log linear model, a method for training the model, and an algorithm for generating the top $k$ candidates, whether there is or is not a predefined dictionary. The log linear model is defined as a conditional probability distribution of an output string and a rule set for the transformation conditioned on an input string. The learning method employs maximum likelihood estimation for parameter estimation. The string generation algorithm based on pruning is guaranteed to generate the optimal top $k$ candidates. The proposed method is applied to correction of spelling errors in queries as well as reformulation of queries in web search. Experimental results on large scale data show that the proposed approach is very accurate and efficient improving upon existing methods in terms of accuracy and efficiency in different settings.
Log Linear Model, Computing Methodologies, Document and Text Processing, Document and Text Editing, Spelling, Information Technology and Systems, Information Storage and Retrieval, Information Search and Retrieval, Query formulation, String Transformation
Z. Wang, G. Xu, H. Li and M. Zhang, "A Probabilistic Approach to String Transformation," in IEEE Transactions on Knowledge & Data Engineering.