Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
butterflees (0) - 14 freq butterflies (1) - 10 freq buttherflees (1) - 1 freq butterfleas (1) - 4 freq butterflee (1) - 7 freq butterflie (2) - 2 freq butterfly (3) - 7 freq watter-flees (3) - 1 freq butteries (3) - 23 freq utterances (4) - 2 freq butternuts (4) - 1 freq buttries (4) - 3 freq buttered (4) - 19 freq butterie (4) - 7 freq butteret (4) - 1 freq buttercups (4) - 7 freq buttress (4) - 1 freq batteries (4) - 8 freq bittersweet (4) - 1 freq butter's (4) - 1 freq bitterness (4) - 6 freq olderfleet (5) - 1 freq battels (5) - 1 freq uttered (5) - 10 freq mitherless (5) - 7 freq |
butterflees (0) - 14 freq butterfleas (1) - 4 freq butterflies (1) - 10 freq butterflee (2) - 7 freq buttherflees (2) - 1 freq butterflie (3) - 2 freq butterfly (4) - 7 freq watter-flees (5) - 1 freq butteries (5) - 23 freq buttress (6) - 1 freq buttercups (6) - 7 freq butter's (6) - 1 freq bitterness (6) - 6 freq batteries (6) - 8 freq butternuts (6) - 1 freq watterfaals (6) - 1 freq buttries (6) - 3 freq betters (7) - 6 freq bittersie (7) - 2 freq battles (7) - 26 freq buttermilk (7) - 3 freq bitterly (7) - 9 freq bottles (7) - 115 freq gutturals (7) - 1 freq buttonholes (7) - 1 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 - BTRFLS butterflees - 14 freq butterflies - 10 freq buttherflees - 1 freq butterfleas - 4 freq |
BUTTERFLEES |
Time to execute Levenshtein function - 0.231880 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.348228 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.027165 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.036761 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.000772 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. |