| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oatcakes (0) - 22 freq oatcake (1) - 1 freq pancakes (2) - 14 freq aitcakes (2) - 3 freq hatches (3) - 4 freq teacakes (3) - 1 freq aitcake (3) - 5 freq catches (3) - 31 freq ontaks (3) - 13 freq latches (3) - 2 freq oatae (3) - 1 freq catcaals (3) - 2 freq cupcakes (3) - 1 freq outwales (3) - 1 freq strakes (3) - 1 freq ootwales (3) - 1 freq outcomes (3) - 2 freq carcages (3) - 2 freq watches (3) - 29 freq cakes (3) - 54 freq ratches (3) - 1 freq matches (3) - 41 freq facades (3) - 2 freq patches (3) - 20 freq takes (3) - 125 freq |
oatcakes (0) - 22 freq aitcakes (2) - 3 freq oatcake (2) - 1 freq teacakes (3) - 1 freq ootcomes (4) - 9 freq cakes (4) - 54 freq takes (4) - 125 freq outcomes (4) - 2 freq tacks (4) - 3 freq aitcake (4) - 5 freq pancakes (4) - 14 freq cokes (5) - 2 freq taks (5) - 455 freq teacake (5) - 1 freq racks (5) - 6 freq soacks (5) - 6 freq acks (5) - 11 freq tuaks (5) - 1 freq taaks (5) - 10 freq dyckes (5) - 1 freq joackeys (5) - 1 freq tucks (5) - 6 freq macks (5) - 3 freq tackles (5) - 3 freq taiches (5) - 1 freq |
SoundEx code - O322 ootguessed - 1 freq ootweighs - 1 freq ootgies - 1 freq ootcasts - 1 freq oot-hooses - 1 freq odoake's - 1 freq ootsized - 1 freq outcast - 2 freq ootsize - 1 freq ootcast - 2 freq oatcakes - 22 freq odysseus - 5 freq oothooses - 3 freq oatcake - 1 freq outhouses - 1 freq ottojizzmark - 1 freq oeidsus - 1 freq |
MetaPhone code - OTKKS oatcakes - 22 freq |
OATCAKES |
| Time to execute Levenshtein function - 0.193767 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.351072 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.027410 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.039671 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.000856 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. |