| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butterflee (0) - 10 freq butterflie (1) - 2 freq butterflees (1) - 14 freq butterflies (2) - 10 freq butterfleas (2) - 4 freq butterfly (2) - 7 freq buttherflees (2) - 1 freq butteries (3) - 23 freq butteret (3) - 1 freq butterie (3) - 7 freq buttered (3) - 19 freq latterlie (4) - 2 freq butter-ba (4) - 1 freq battered (4) - 37 freq butter't (4) - 2 freq buttermilk (4) - 3 freq bitterly (4) - 9 freq butter'd (4) - 1 freq uttered (4) - 10 freq butterig (4) - 1 freq butter's (4) - 1 freq buttert (4) - 7 freq buttercups (4) - 7 freq butter (4) - 134 freq bittersie (4) - 2 freq |
butterflee (0) - 10 freq butterflie (1) - 2 freq butterfly (2) - 7 freq butterflees (2) - 14 freq butterfleas (3) - 4 freq butterflies (3) - 10 freq buttherflees (4) - 1 freq buttered (5) - 19 freq bitterly (5) - 9 freq butteret (5) - 1 freq butterie (5) - 7 freq butteries (5) - 23 freq utterly (6) - 21 freq buttries (6) - 3 freq buttergin (6) - 2 freq batteries (6) - 8 freq butterin (6) - 2 freq batteren (6) - 1 freq buttery (6) - 24 freq buttrie (6) - 4 freq buttercup (6) - 14 freq better-like (6) - 2 freq bettered (6) - 4 freq bittersie (6) - 2 freq buttermilk (6) - 3 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 - BTRFL butterfly - 7 freq butterflee - 10 freq beau-ootrful - 1 freq butterflie - 2 freq |
BUTTERFLEE |
| Time to execute Levenshtein function - 0.506756 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.904662 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.071080 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.039489 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.000930 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. |