| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| meadowbank (0) - 3 freq meadowbankwed (3) - 1 freq meadowbankafc (3) - 4 freq ewbank (4) - 1 freq meadowhead (4) - 2 freq meadows (4) - 13 freq meadow (4) - 11 freq ladybank (4) - 1 freq eastbank (4) - 1 freq headwear (5) - 1 freq clydebank (5) - 12 freq mudbanks (5) - 2 freq marjoribank (5) - 1 freq readan (5) - 10 freq tweedbank (5) - 1 freq breadalbane (5) - 1 freq madman (5) - 7 freq erdogan (5) - 1 freq melodian (5) - 1 freq meedows (5) - 8 freq madigan (5) - 1 freq wirdbank (5) - 1 freq madonals (5) - 1 freq meltdown (5) - 3 freq meatbaws (5) - 1 freq |
meadowbank (0) - 3 freq meadowbankafc (5) - 4 freq meadowbankwed (5) - 1 freq ladybank (6) - 1 freq ewbank (6) - 1 freq eastbank (7) - 1 freq mudbanks (7) - 2 freq widbank (7) - 1 freq foodbank (7) - 5 freq meadowhead (7) - 2 freq meadow (7) - 11 freq meadows (7) - 13 freq endowment (8) - 1 freq meowin (8) - 2 freq midwik (8) - 1 freq bloobank (8) - 2 freq mawlana (8) - 1 freq elibank (8) - 2 freq meedowheid (8) - 1 freq maetbanks (8) - 1 freq redshank (8) - 3 freq medow (8) - 1 freq feedback (8) - 23 freq miaowins (8) - 1 freq paet-bank (8) - 1 freq |
SoundEx code - M315 mudbanks - 2 freq mutvin - 1 freq maetbanks - 1 freq meadowbank - 3 freq meadowbankafc - 4 freq meadowbankwed - 1 freq |
MetaPhone code - MTBNK meadowbank - 3 freq |
MEADOWBANK |
| Time to execute Levenshtein function - 0.229914 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.451359 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.031902 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.042881 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.001096 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. |