Real-Word Spelling Correction using Google Web 1T 3-grams

We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Common Subsequence (LCS) string matching algorithm. Our method is focused mainly on how to improve the detection recall (the fraction of errors correctly detected) and the correction recall (the fraction of errors correctly amended), while keeping the respective precisions (the fraction of detections or amendments that are correct) as high as possible. Evaluation results on a standard data set show that our method outperforms two other methods on the same task.

• Type: Journal
• Year: 2009
• Where: EMNLP
• Authors: Aminul Islam, Diana Inkpen
• Keywords: EMNLP 2009, Longest Common Subsequence, Natural Language Processing, Respective Precisions, String Matching