| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utter (0) - 62 freq atter (1) - 1 freq otter (1) - 3 freq uttert (1) - 1 freq unter (1) - 1 freq putter (1) - 1 freq nutter (1) - 5 freq gutter (1) - 32 freq mutter (1) - 10 freq cutter (1) - 5 freq etter (1) - 2 freq uther (1) - 9 freq butter (1) - 129 freq rutted (2) - 1 freq mutters (2) - 10 freq attery (2) - 1 freq totter (2) - 2 freq upper (2) - 54 freq cater (2) - 5 freq ster (2) - 3 freq uthir (2) - 1 freq uthur (2) - 1 freq anter (2) - 1 freq ether (2) - 26 freq hater (2) - 2 freq |
utter (0) - 62 freq etter (1) - 2 freq otter (1) - 3 freq atter (1) - 1 freq uther (2) - 9 freq butter (2) - 129 freq attar (2) - 1 freq yitter (2) - 1 freq cutter (2) - 5 freq attery (2) - 1 freq unter (2) - 1 freq mutter (2) - 10 freq uttert (2) - 1 freq putter (2) - 1 freq gutter (2) - 32 freq nutter (2) - 5 freq fitter (3) - 5 freq catter (3) - 16 freq teer (3) - 5 freq eater (3) - 2 freq tver (3) - 3 freq otters (3) - 3 freq mitter (3) - 1 freq uttered (3) - 10 freq tutor (3) - 9 freq |
SoundEx code - U360 utter - 62 freq udr - 1 freq udhr - 1 freq uther - 9 freq uthur - 1 freq uthir - 1 freq utir - 1 freq udder - 1 freq |
MetaPhone code - UTR utter - 62 freq udr - 1 freq udhr - 1 freq utir - 1 freq udder - 1 freq |
UTTER |
| Time to execute Levenshtein function - 0.169345 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.322058 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027397 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039629 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001019 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |