| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| badminton (0) - 6 freq admittin (3) - 6 freq haddington (3) - 7 freq paddington (3) - 2 freq hamilton (3) - 40 freq anointin (4) - 1 freq dominion (4) - 4 freq wanton (4) - 2 freq baton (4) - 3 freq kiddin-on (4) - 1 freq macinnon (4) - 1 freq barcamilton (4) - 1 freq baitin (4) - 1 freq faintin (4) - 4 freq mintion (4) - 1 freq badinage (4) - 2 freq alpinson (4) - 1 freq linton (4) - 19 freq leamington (4) - 1 freq admittit (4) - 10 freq paintin (4) - 43 freq mitton (4) - 1 freq attintion (4) - 3 freq downton (4) - 1 freq clinton (4) - 3 freq |
badminton (0) - 6 freq admonition (5) - 3 freq admittin (5) - 6 freq burnton (6) - 2 freq bedlinen (6) - 1 freq domination (6) - 1 freq abomination (6) - 5 freq dominatin (6) - 6 freq waementin (6) - 1 freq admiration (6) - 13 freq bodmin (6) - 1 freq brunton (6) - 24 freq lamination (6) - 1 freq badmoothin (6) - 1 freq downton (6) - 1 freq lamentin (6) - 6 freq paddington (6) - 2 freq hamilton (6) - 40 freq mintion (6) - 1 freq dominion (6) - 4 freq damnation (6) - 3 freq mintin (6) - 18 freq daunton (6) - 2 freq haddington (6) - 7 freq termintin (6) - 1 freq |
SoundEx code - B355 buttin-in - 1 freq buttonin - 4 freq boatmen - 9 freq batman - 5 freq badminton - 6 freq bitumen - 1 freq batman's - 1 freq batmen - 1 freq boatman - 1 freq bodmin - 1 freq batmangilmour - 2 freq boatmens - 3 freq boatmans - 1 freq |
MetaPhone code - BTMNTN badminton - 6 freq |
BADMINTON |
| Time to execute Levenshtein function - 0.205255 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.365995 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.029168 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.037704 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.000889 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. |