This paper proposes an approach to spelling correction. It reranks the output of an existing spelling corrector, Aspell. A discriminative model (Ranking SVM) is employed to improve upon the initial ranking, using additional features as evidence. These features are derived from state-of-the-art techniques in spelling correction, including edit distance, letter-based n-gram, phonetic similarity and noisy channel model. This paper also presents a method to automatically extract training samples from the query log chain. The system outperforms the baseline Aspell greatly, as well as the previous models and several off-the-shelf systems (e.g. spelling corrector in Microsoft Word 2003). The experimental results based on query chain pairs are comp...
Spelling normalization is the task to normalize non-standard words into standard words in texts, res...
The report describes improved algorithms within a computer program for identifying spelling and word...
This paper proposes a new method for approximate string search, specifically candidate generation in...
For an advanced implementation of spelling correction via machine learning, a multi-level featurebas...
Nowadays, a large amount of documents is generated daily. These documents may contain some spelling ...
Abstract- Machine learning techniques are provided with small amount of data to learn and training m...
In this paper, we study the problem of online spelling correction for query completions. Misspelling...
We present two algorithms for automatically improving the quality of texts which contain a large num...
Traditional research on spelling correction in natural language processing and infor-mation retrieva...
A method for detecting and correcting spelling errors in Swedish text was presented by Domeij, Hollm...
This paper discusses the issues involved in an information retrieval system when spelling errors are...
Spell Checking is a function vital to word based applications and search engines, as it can greatly ...
This disclosure describes techniques for phonetic training of spelling models for use for spell corr...
This paper describes a new approach to automatically learning linguistic knowledge for spelling corr...
This thesis describes the analysis of over 1300 spelling and typing errors. It introduces and descr...
Spelling normalization is the task to normalize non-standard words into standard words in texts, res...
The report describes improved algorithms within a computer program for identifying spelling and word...
This paper proposes a new method for approximate string search, specifically candidate generation in...
For an advanced implementation of spelling correction via machine learning, a multi-level featurebas...
Nowadays, a large amount of documents is generated daily. These documents may contain some spelling ...
Abstract- Machine learning techniques are provided with small amount of data to learn and training m...
In this paper, we study the problem of online spelling correction for query completions. Misspelling...
We present two algorithms for automatically improving the quality of texts which contain a large num...
Traditional research on spelling correction in natural language processing and infor-mation retrieva...
A method for detecting and correcting spelling errors in Swedish text was presented by Domeij, Hollm...
This paper discusses the issues involved in an information retrieval system when spelling errors are...
Spell Checking is a function vital to word based applications and search engines, as it can greatly ...
This disclosure describes techniques for phonetic training of spelling models for use for spell corr...
This paper describes a new approach to automatically learning linguistic knowledge for spelling corr...
This thesis describes the analysis of over 1300 spelling and typing errors. It introduces and descr...
Spelling normalization is the task to normalize non-standard words into standard words in texts, res...
The report describes improved algorithms within a computer program for identifying spelling and word...
This paper proposes a new method for approximate string search, specifically candidate generation in...