| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buttoned (0) - 11 freq buttons (2) - 55 freq butted (2) - 5 freq buttonin (2) - 4 freq buttered (2) - 19 freq battened (2) - 2 freq unbuttoned (2) - 4 freq button (2) - 92 freq butched (3) - 2 freq burthened (3) - 1 freq battled (3) - 2 freq dantoned (3) - 1 freq toned (3) - 1 freq motioned (3) - 1 freq burrowed (3) - 1 freq supponed (3) - 1 freq butties (3) - 1 freq rutted (3) - 1 freq hutton (3) - 5 freq cuttled (3) - 1 freq attuned (3) - 2 freq intoned (3) - 1 freq dauntoned (3) - 1 freq mittened (3) - 1 freq lutton (3) - 1 freq |
buttoned (0) - 11 freq battened (2) - 2 freq button (3) - 92 freq buttered (3) - 19 freq unbuttoned (3) - 4 freq buttonin (3) - 4 freq buttons (3) - 55 freq butted (3) - 5 freq battered (4) - 35 freq buttin (4) - 5 freq attuned (4) - 2 freq batted (4) - 1 freq botton (4) - 1 freq but-and (4) - 1 freq battled (4) - 2 freq mittened (4) - 1 freq fattened (4) - 2 freq bottled (4) - 1 freq but-end (4) - 2 freq bettered (4) - 4 freq bntton (5) - 1 freq buttrie (5) - 4 freq burned (5) - 31 freq notioned (5) - 1 freq blazoned (5) - 1 freq |
SoundEx code - B353 buttoned - 11 freq bathin-huts - 1 freq bad-mouths - 1 freq battened - 2 freq bedmate - 2 freq but-and - 1 freq badmoothin - 1 freq bed-ends - 1 freq baadmooth - 1 freq bed-mate - 1 freq but-end - 2 freq btinternet - 12 freq bydand - 1 freq bdantarctica - 1 freq |
MetaPhone code - BTNT buttoned - 11 freq battened - 2 freq but-and - 1 freq but-end - 2 freq bydand - 1 freq |
BUTTONED |
| Time to execute Levenshtein function - 0.187208 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.322634 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.026941 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.037370 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.000774 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. |