| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butter-ba (0) - 1 freq butter-nut (3) - 1 freq butterie (3) - 7 freq butter's (3) - 1 freq butter't (3) - 2 freq butteret (3) - 1 freq buttery (3) - 24 freq butterig (3) - 1 freq buttered (3) - 19 freq buttercup (3) - 14 freq buttert (3) - 7 freq butter (3) - 129 freq butterfly (3) - 7 freq butter'd (3) - 1 freq butteries (3) - 23 freq butterin (3) - 2 freq betterawa (3) - 3 freq buttergin (3) - 2 freq bettered (4) - 4 freq butterflee (4) - 7 freq watter-wal (4) - 1 freq puttering (4) - 1 freq mutters (4) - 10 freq uttering (4) - 1 freq utterin (4) - 3 freq |
butter-ba (0) - 1 freq butterfly (5) - 7 freq butter (5) - 129 freq buttert (5) - 7 freq butter'd (5) - 1 freq butterin (5) - 2 freq buttergin (5) - 2 freq betterawa (5) - 3 freq buttercup (5) - 14 freq butteries (5) - 23 freq butter't (5) - 2 freq butterie (5) - 7 freq buttered (5) - 19 freq butter-nut (5) - 1 freq butter's (5) - 1 freq butterig (5) - 1 freq butteret (5) - 1 freq buttery (5) - 24 freq bittersie (6) - 2 freq better'n (6) - 2 freq bitter (6) - 109 freq bitterly (6) - 9 freq bettering (6) - 1 freq batteries (6) - 8 freq battery (6) - 23 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 - BTRB butter-ba - 1 freq |
BUTTER-BA |
| Time to execute Levenshtein function - 0.461979 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 - 1.046621 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.043226 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.069519 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.000840 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. |