| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absby (0) - 1 freq abby (1) - 16 freq busby (2) - 1 freq cosby (2) - 1 freq abooy (2) - 1 freq abudy (2) - 11 freq ab'dy (2) - 3 freq asky (2) - 2 freq abbey (2) - 33 freq abody (2) - 90 freq abbay (2) - 1 freq aisy (2) - 27 freq gabby (2) - 1 freq gatsby (2) - 1 freq abidy (2) - 36 freq fabby (2) - 68 freq aesy (2) - 57 freq abs (2) - 1 freq ashby (2) - 1 freq baby (2) - 121 freq asbo (2) - 1 freq abdy (2) - 31 freq tabby (2) - 15 freq absie (2) - 1 freq ably (2) - 1 freq |
absby (0) - 1 freq busby (2) - 1 freq bsb (2) - 1 freq abby (2) - 16 freq abs (3) - 1 freq baby (3) - 121 freq asbo (3) - 1 freq cosby (3) - 1 freq absie (3) - 1 freq abbay (3) - 1 freq babby (3) - 25 freq abbey (3) - 33 freq bosy (4) - 3 freq busy (4) - 230 freq bs (4) - 6 freq obusy (4) - 1 freq ebbe (4) - 5 freq abbie (4) - 59 freq bebo (4) - 1 freq ibs (4) - 3 freq bst (4) - 2 freq abusin (4) - 4 freq booby (4) - 9 freq bse (4) - 4 freq busky (4) - 1 freq |
SoundEx code - A121 abusive - 8 freq apkeep - 5 freq affspreing - 1 freq affspring - 5 freq abcqjwfzlg - 1 freq afckev - 1 freq ahpsv - 1 freq abzpodcast - 63 freq afcformerplayer - 2 freq absby - 1 freq aopgayb - 1 freq absofuckinlutely - 1 freq avosfrommexico - 1 freq afcfyldeacademy - 1 freq avfcofficial - 2 freq |
MetaPhone code - ABSB absby - 1 freq |
ABSBY |
| Time to execute Levenshtein function - 0.460857 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.612823 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.027740 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.075371 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.001169 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. |