| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unbuttonin (0) - 1 freq buttonin (2) - 4 freq unbuttoned (2) - 4 freq unbutton (2) - 2 freq nuttin (4) - 49 freq buttons (4) - 57 freq unsettlin (4) - 3 freq unquestionin (4) - 1 freq dauntonin (4) - 2 freq unwittin (4) - 1 freq buttin-in (4) - 1 freq functionin (4) - 3 freq buttoned (4) - 11 freq huttonian (4) - 1 freq butterin (4) - 2 freq buttin (4) - 6 freq unbooncin (4) - 1 freq button (4) - 92 freq unlairnin (5) - 1 freq unstringin (5) - 1 freq antonine (5) - 2 freq unduin (5) - 1 freq unrationed (5) - 1 freq buttit (5) - 4 freq unstintin (5) - 1 freq |
unbuttonin (0) - 1 freq buttonin (3) - 4 freq unbutton (3) - 2 freq unbuttoned (3) - 4 freq buttoned (6) - 11 freq huttonian (6) - 1 freq buttin-in (6) - 1 freq button (6) - 92 freq butterin (6) - 2 freq buttin (6) - 6 freq unwittin (6) - 1 freq buttons (6) - 57 freq unsettlin (6) - 3 freq unquestionin (6) - 1 freq nuttin (6) - 49 freq battin (7) - 1 freq intennin (7) - 1 freq nittin (7) - 3 freq abettin (7) - 2 freq unbreithin (7) - 1 freq unwittinly (7) - 1 freq inpittin (7) - 1 freq onputtins (7) - 1 freq natterin (7) - 4 freq bottlin (7) - 2 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 9 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unfathomably - 1 freq unbitter - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbothered - 1 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UNBTNN unbuttonin - 1 freq |
UNBUTTONIN |
| Time to execute Levenshtein function - 0.254879 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.409104 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.029384 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.044752 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.001164 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. |