| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butterflies (0) - 10 freq butterflie (1) - 2 freq butterflees (1) - 14 freq butterfleas (2) - 4 freq butterflee (2) - 10 freq butteries (2) - 23 freq buttherflees (2) - 1 freq buttries (3) - 3 freq butterie (3) - 7 freq butterfly (3) - 7 freq batteries (3) - 8 freq butternuts (4) - 1 freq butterkist (4) - 1 freq butter's (4) - 1 freq bitternis (4) - 1 freq latterlie (4) - 2 freq buttermilk (4) - 3 freq buttered (4) - 19 freq batterins (4) - 1 freq butterin (4) - 2 freq butteret (4) - 1 freq bittersie (4) - 2 freq easterlies (4) - 1 freq watter-flees (4) - 1 freq hoverflies (4) - 1 freq |
butterflies (0) - 10 freq butterflees (1) - 14 freq butterflie (2) - 2 freq butterfleas (2) - 4 freq buttherflees (3) - 1 freq butterflee (3) - 10 freq butteries (4) - 23 freq butterfly (4) - 7 freq batteries (5) - 8 freq buttries (5) - 3 freq bittersie (6) - 2 freq batterins (6) - 1 freq watter-flees (6) - 1 freq better-like (6) - 2 freq buttermilk (6) - 3 freq watterfaals (6) - 1 freq buttercups (6) - 7 freq butter's (6) - 1 freq butterie (6) - 7 freq bitternis (6) - 1 freq butternuts (6) - 1 freq buttered (7) - 19 freq batters (7) - 8 freq bitterness (7) - 9 freq buttress (7) - 1 freq |
SoundEx code - B361 butterfly - 7 freq butterflees - 14 freq butterflee - 10 freq butterflies - 10 freq bath-rabbim - 1 freq better-hauf's - 2 freq butter-ba - 1 freq better-happit - 1 freq beau-ootrful - 1 freq butterflie - 2 freq buttherflees - 1 freq butterfleas - 4 freq butterflyandpig - 1 freq |
MetaPhone code - BTRFLS butterflees - 14 freq butterflies - 10 freq buttherflees - 1 freq butterfleas - 4 freq |
BUTTERFLIES |
| Time to execute Levenshtein function - 0.304323 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.420187 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.027429 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.038588 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.000899 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. |