| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utter (0) - 63 freq cutter (1) - 5 freq unter (1) - 1 freq putter (1) - 1 freq butter (1) - 134 freq uther (1) - 9 freq atter (1) - 1 freq uttert (1) - 1 freq etter (1) - 2 freq mutter (1) - 10 freq nutter (1) - 6 freq gutter (1) - 33 freq otter (1) - 3 freq wetter (2) - 4 freq tier (2) - 36 freq pitter (2) - 2 freq outten (2) - 1 freq under (2) - 447 freq better (2) - 1704 freq dunter (2) - 2 freq t'er (2) - 6 freq hunter (2) - 48 freq uber (2) - 2 freq fyter (2) - 1 freq tutted (2) - 3 freq |
utter (0) - 63 freq otter (1) - 3 freq etter (1) - 2 freq atter (1) - 1 freq gutter (2) - 33 freq yitter (2) - 1 freq attar (2) - 1 freq attery (2) - 1 freq mutter (2) - 10 freq nutter (2) - 6 freq putter (2) - 1 freq cutter (2) - 5 freq unter (2) - 1 freq butter (2) - 134 freq uther (2) - 9 freq uttert (2) - 1 freq liter (3) - 1 freq tther (3) - 6 freq latter (3) - 25 freq guttur (3) - 1 freq netter (3) - 6 freq etten (3) - 35 freq fatter (3) - 13 freq hater (3) - 2 freq outer (3) - 4 freq |
SoundEx code - U360 utter - 63 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 - 63 freq udr - 1 freq udhr - 1 freq utir - 1 freq udder - 1 freq |
UTTER |
| Time to execute Levenshtein function - 0.177781 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.336407 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.028240 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.037223 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.001033 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. |