| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butterfly (0) - 7 freq bitterly (2) - 9 freq buttery (2) - 24 freq utterly (2) - 18 freq butterflie (2) - 2 freq butterflee (2) - 7 freq butterin (3) - 2 freq butterfleas (3) - 4 freq guttery (3) - 3 freq €œutterly (3) - 1 freq buttert (3) - 7 freq butterflees (3) - 14 freq butterflies (3) - 10 freq butter-ba (3) - 1 freq butter (3) - 129 freq butteries (3) - 23 freq buttered (3) - 19 freq latterly (3) - 4 freq butterig (3) - 1 freq butterie (3) - 7 freq buttergin (3) - 2 freq butter's (3) - 1 freq buttermilk (3) - 3 freq butteret (3) - 1 freq battery (3) - 23 freq |
butterfly (0) - 7 freq butterflie (2) - 2 freq butterflee (2) - 7 freq bitterly (3) - 9 freq butterflies (4) - 10 freq butterflees (4) - 14 freq butterfleas (4) - 4 freq utterly (4) - 18 freq buttery (4) - 24 freq butter's (5) - 1 freq buttermilk (5) - 3 freq butterie (5) - 7 freq buttergin (5) - 2 freq butter'd (5) - 1 freq butterig (5) - 1 freq butter't (5) - 2 freq buttercup (5) - 14 freq butteret (5) - 1 freq battery (5) - 23 freq buttert (5) - 7 freq latterly (5) - 4 freq butter-ba (5) - 1 freq butter (5) - 129 freq butteries (5) - 23 freq butterin (5) - 2 freq |
SoundEx code - B361 butterfly - 7 freq butterflees - 14 freq butterflee - 7 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 - BTRFL butterfly - 7 freq butterflee - 7 freq beau-ootrful - 1 freq butterflie - 2 freq |
BUTTERFLY |
| Time to execute Levenshtein function - 0.259889 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.404862 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.028093 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.037811 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.000871 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. |