“Spelling suggestion”的意思、由来-开放百科全书

Spelling suggestion is a feature of many computer software applications used to suggest plausible replacements for words that are likely to have been misspelled.

Spelling suggestion features are commonly included in Internet search engines, word processors, spell checkers, medical transcription, automatic query reformulation, and frequency-log statistics reporting.

Algorithms

Any spell checker must have some data about the words in the target language, either in general usage or with specialized knowledge (like medical vocabulary). This can come from:

A list of frequently misspelled words, possibly including multi-word phrases, can simply be consulted to see if any of the input words or phrases are listed.

To make use of a dictionary without a pre-existing mapping from misspellings to corrections, the typical technique is to calculate the edit distance between an input word and any given word in the dictionary. The Levenshtein distance metric considers an "edit" to be the insertion, deletion, or substitution (with another letter) of one letter. The Damerau–Levenshtein distance adds transpositions (the swapping of neighboring letters). Dictionary words that are an edit distance of 1 away from the input word are considered highly likely as corrections, edit distance 2 less likely, and edit distance 3 sometimes included in suggestions and sometimes ignored.

A text corpus can be summed up as a dictionary of known words, with a frequency of appearance for each word. This can be used to sort the spelling suggestions. For example, if there are multiple suggestions of edit distance 1, the words that appear most frequently in the corpus are most likely to be the desired correction.

Because a dictionary of known words is very large, calculating the edit distance between an input word and every word in the dictionary is computationally intensive and thus relatively slow.^[2] Various data structures can be utilized to speed up storage lookups, such as BK-trees.^[3] A faster approach adopted by Peter Norvig^[4] generates all the permutations from an input word of all possible edits. For a word of length n and an alphabet of size a, for edit distance 1 there are at most n deletions, n-1 transpositions, a*n alterations, and a*(n+1) insertions.^[5] Using only the 26 letters in the English alphabet, this would produce only 54*n+25 dictionary lookups, minus any duplicates (which depends on the specific letters in the word). This is relatively small when compared to a dictionary of hundreds of thousands of words. However, tens or hundreds of thousands of lookups might be required for edit distance 2 and greater. A further innovation adopted by Wolf Garbe, known as SymSpell^[5] ("sym" as in "symmetry") speeds the input-time calculation by utilizing the fact that only permutations involving deletions need to be generated for input words if the same deletion permutations are per-calculated on the dictionary.

The algorithms described so far do not deal well with correct words that are not in the dictionary. Common sources of unknown words in English are compound words and inflections, such as -s and -ing.^[4] These can be accommodated algorithmically, especially if the dictionary contains the part of speech.

These algorithms have also assumed that all errors of a given distance are equally probable, which is not true. Errors that involve spelling phonetically where English orthography is not phonetic are common, as are errors that repeat the same letter or confuse neighboring letters on a QWERTY keyboard. If a large set of known spelling errors and corrections is available, this data can be used to generate frequency tables for letter pairs and edit types; these can be used to more accurately rank suggestions.^[4] It is also more common than chance for a word to be spelled in the wrong dialect compared to the rest of the text, for example due to American and British English spelling differences.^[4]

Spelling suggestions can also be made more accurate by taking into account more than one word at a time.^[4] Multi-word sequences are known as n-grams (where n is the number of words in the sequence). A very large database of n-grams up to 5 words in length is available from Google for this and other purposes.^[6]

Others have experimented with using large amounts of data and deep learning techniques (a form of machine learning to train neural networks to perform spelling correction.^[7]^[8]

References

1. ^[https://www.youtube.com/watch?v=syKY8CrHkck#t=22m03s Search 101] - Google VP of Engineering and CIO Douglas Merrill
2. ^[https://nlp.stanford.edu/IR-book/html/htmledition/edit-distance-1.html Edit distance]
3. ^Damn Cool Algorithms, Part 1: BK-Trees
4. ^¹²³⁴How to Write a Spelling Corrector
5. ^¹[https://medium.com/@wolfgarbe/1000x-faster-spelling-correction-algorithm-2012-8701fcd87a5f 1000x Faster Spelling Correction algorithm (2012)]
6. ^{{cite web |url=https://ai.googleblog.com/2006/08/all-our-n-gram-are-belong-to-you.html |title=All Our N-gram are Belong to You |date=3 Aug 2006 |author1=Alex Franz |author2=Thorsten Brants}}
7. ^[https://machinelearnings.co/deep-spelling-9ffef96a24f6 Deep Spelling]
8. ^[https://datascience.stackexchange.com/questions/16128/algorithms-and-techniques-for-spell-checking Algorithms and techniques for spell checking]