| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butterworth (0) - 5 freq butterwort (1) - 1 freq 'butterworth (1) - 1 freq butterworth's (2) - 1 freq butteret (4) - 1 freq butternuts (4) - 1 freq butterkist (4) - 1 freq butter't (4) - 2 freq butterscotch (4) - 4 freq butter-nut (4) - 1 freq buttert (4) - 7 freq butterflee (5) - 7 freq buttet (5) - 6 freq buttermilk (5) - 3 freq benorth (5) - 2 freq bitterest (5) - 1 freq efterwart (5) - 1 freq batterit (5) - 1 freq butterflees (5) - 14 freq butterfleas (5) - 4 freq rutherford (5) - 4 freq aifterwart (5) - 1 freq butter'd (5) - 1 freq guttert (5) - 1 freq muttert (5) - 25 freq |
butterworth (0) - 5 freq 'butterworth (2) - 1 freq butterwort (2) - 1 freq butterworth's (4) - 1 freq butterscotch (7) - 4 freq butter-nut (7) - 1 freq butter't (7) - 2 freq buttert (7) - 7 freq butterkist (7) - 1 freq butteret (7) - 1 freq butternuts (7) - 1 freq bettert (8) - 2 freq bittersweet (8) - 1 freq efterwarts (8) - 1 freq batterit (8) - 1 freq aifterwart (8) - 1 freq betterment (8) - 6 freq watterwirks (8) - 2 freq efterwart (8) - 1 freq battert (8) - 7 freq bitterest (8) - 1 freq lettermore (9) - 1 freq waterworks (9) - 3 freq waterworn (9) - 1 freq butteries (9) - 23 freq |
SoundEx code - B366 butterworth - 5 freq 'butterworth - 1 freq butterworth's - 1 freq butterwort - 1 freq betrayers - 1 freq betrayar - 1 freq |
MetaPhone code - BTRWR0 butterworth - 5 freq 'butterworth - 1 freq |
BUTTERWORTH |
| Time to execute Levenshtein function - 0.260740 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.593886 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.070499 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.039749 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.000862 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. |