| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| better-like (0) - 2 freq butterflie (3) - 2 freq blate-like (3) - 16 freq tender-like (3) - 1 freq biker-like (3) - 1 freq blate-lik (4) - 1 freq tent-like (4) - 1 freq efter-time (4) - 3 freq tattoo-like (4) - 1 freq gyte-like (4) - 1 freq efterlife (4) - 2 freq betterin (4) - 3 freq better-maist (4) - 1 freq quate-like (4) - 9 freq queer-like (4) - 5 freq eerie-like (4) - 2 freq blatelike (4) - 1 freq butterflies (4) - 10 freq bettermaist (4) - 5 freq ettlin-like (4) - 1 freq catterline (4) - 3 freq butterflee (4) - 10 freq bee-line (4) - 3 freq sojer-like (4) - 1 freq aifter-life (4) - 1 freq |
better-like (0) - 2 freq biker-like (5) - 1 freq blate-like (5) - 16 freq butterflie (5) - 2 freq butterflee (6) - 10 freq butterflies (6) - 10 freq cuttie-like (6) - 1 freq tattoo-like (6) - 1 freq cuttit-like (6) - 2 freq buttermilk (6) - 3 freq tender-like (6) - 1 freq blate-lik (6) - 1 freq water-line (7) - 1 freq better-suited (7) - 1 freq watter-side (7) - 2 freq leisur-like (7) - 1 freq tentie-like (7) - 1 freq bettering (7) - 1 freq dentie-like (7) - 1 freq butterfly (7) - 7 freq butterflees (7) - 14 freq bitterly (7) - 9 freq tailor-like (7) - 1 freq butter-ba (7) - 1 freq butterfleas (7) - 4 freq |
SoundEx code - B364 baitter-lookin - 1 freq buttérlumps - 1 freq better-like - 2 freq bitterly - 9 freq betrayal - 7 freq bedroll - 7 freq |
MetaPhone code - BTRLK better-like - 2 freq |
BETTER-LIKE |
| Time to execute Levenshtein function - 0.411817 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.771192 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.033806 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.087235 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.001162 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. |