This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Survey Paper on String Transformation using Probabilistic Approach
Authors
Miss. Gayatridevi N.Kotame, Prof. P. N. Kalavadekar
Abstract
The string is given as an input to the system generates the k most likely output strings corresponding to the input string. This system 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 will apply to correction of spelling errors in queries as well are formulation of queries in web search.
Keywords- Transformation, Log Linear Model, Spelling Error Correction, Query Reformulation
Publication Details
Unique Identification Number - IJEDR1503026Page Number(s) - Pubished in - Volume 3 | Issue 3 | July 2015DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Miss. Gayatridevi N.Kotame, Prof. P. N. Kalavadekar, "Survey Paper on String Transformation using Probabilistic Approach", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.3, Issue 3, pp., July 2015, Available at :http://www.ijedr.org/papers/IJEDR1503026.pdf
Article Preview
|
|
||||||
|
|
||||||||
