| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| allanbri (0) - 1 freq allan (3) - 91 freq alanbk (3) - 1 freq allander (3) - 1 freq allanerly (3) - 1 freq gallantry (3) - 1 freq aller (4) - 2 freq almanacs (4) - 1 freq lallanses (4) - 1 freq cleaners (4) - 8 freq lauri (4) - 1 freq alian (4) - 1 freq alanbrazil (4) - 1 freq alang (4) - 1171 freq allstars (4) - 1 freq allen (4) - 2 freq ballantrae (4) - 1 freq eleanor (4) - 10 freq aaner (4) - 1 freq callander (4) - 2 freq armani (4) - 1 freq alab (4) - 1 freq alancarr (4) - 1 freq lallans' (4) - 1 freq cleaner (4) - 32 freq |
allanbri (0) - 1 freq allander (4) - 1 freq llanbryde (5) - 1 freq allanerly (5) - 1 freq gallantry (5) - 1 freq alanbk (5) - 1 freq allan (5) - 91 freq cleaner (6) - 32 freq ellar (6) - 1 freq alliances (6) - 2 freq ullans (6) - 32 freq landry (6) - 1 freq allanpetrie (6) - 2 freq planer (6) - 1 freq callander (6) - 2 freq alliance (6) - 30 freq allegro (6) - 1 freq ellan (6) - 2 freq ballantrae (6) - 1 freq allover (6) - 3 freq allyboy (6) - 1 freq calabria (6) - 2 freq alienar (6) - 3 freq aller (6) - 2 freq algebra (6) - 3 freq |
SoundEx code - A451 alanbrazil - 1 freq alanferrier - 3 freq allanpetrie - 2 freq allieneave - 7 freq alanfresco - 1 freq alannahbh - 1 freq allanbri - 1 freq alanbk - 1 freq alanbrownsnp - 2 freq |
MetaPhone code - ALNBR allanbri - 1 freq |
ALLANBRI |
| Time to execute Levenshtein function - 0.244151 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.417049 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.027708 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.037161 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.000996 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. |