| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etterin (0) - 1 freq letterin (1) - 6 freq betterin (1) - 3 freq utterin (1) - 3 freq enterin (1) - 20 freq uttering (2) - 1 freq hotterin (2) - 15 freq sotterin (2) - 2 freq pesterin (2) - 2 freq potterin (2) - 3 freq watterin (2) - 12 freq eerin (2) - 2 freq efterhin (2) - 11 freq teeterin (2) - 6 freq litterin (2) - 1 freq cletterin (2) - 1 freq patterin (2) - 6 freq butterin (2) - 2 freq oxterin (2) - 7 freq merterin (2) - 1 freq letterit (2) - 1 freq better'n (2) - 2 freq getherin (2) - 34 freq bettering (2) - 1 freq batterin (2) - 28 freq |
etterin (0) - 1 freq utterin (1) - 3 freq yatterin (2) - 4 freq utteran (2) - 1 freq teeterin (2) - 6 freq letterin (2) - 6 freq enterin (2) - 20 freq betterin (2) - 3 freq totterin (3) - 1 freq mutterin (3) - 40 freq otteris (3) - 1 freq hyterin (3) - 3 freq caterin (3) - 4 freq tierin (3) - 2 freq ettin (3) - 13 freq natterin (3) - 4 freq etten (3) - 35 freq ettilin (3) - 1 freq steerin (3) - 47 freq teerin (3) - 5 freq atterie (3) - 4 freq witterin (3) - 3 freq waterin (3) - 7 freq nytterin (3) - 1 freq matterin (3) - 1 freq |
SoundEx code - E365 eterne - 2 freq eternal - 29 freq etterin - 1 freq eternitie - 8 freq eternally - 7 freq eternity - 18 freq ethernan - 5 freq ethernan's - 1 freq eternity's - 2 freq eternell - 1 freq eduroam - 1 freq edrom - 1 freq |
MetaPhone code - ETRN eterne - 2 freq etterin - 1 freq |
ETTERIN |
| Time to execute Levenshtein function - 0.299450 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.401709 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.027882 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.040816 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.000927 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. |