| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albeest (0) - 1 freq beest (2) - 11 freq albert (2) - 25 freq albeit (2) - 6 freq allest (2) - 1 freq alreet (2) - 3 freq aldest (2) - 1 freq leest (2) - 12 freq ageest (2) - 2 freq ameest (2) - 1 freq leist (3) - 3 freq bawbees (3) - 23 freq atweesht (3) - 1 freq arrest (3) - 9 freq aloes (3) - 1 freq lees' (3) - 1 freq beese (3) - 5 freq alreedy (3) - 1 freq ballest (3) - 3 freq 'lees' (3) - 1 freq at-best (3) - 1 freq asseert (3) - 1 freq €œbest (3) - 4 freq aalest (3) - 4 freq lest (3) - 218 freq |
albeest (0) - 1 freq aldest (3) - 1 freq leest (3) - 12 freq allest (3) - 1 freq alabast (3) - 1 freq beest (3) - 11 freq albert (3) - 25 freq albeit (3) - 6 freq best (4) - 1613 freq arabest (4) - 3 freq lawest (4) - 1 freq laest (4) - 48 freq i'best (4) - 7 freq laetest (4) - 4 freq alberta (4) - 1 freq baest (4) - 27 freq beast (4) - 141 freq elbaes (4) - 1 freq loest (4) - 1 freq alist (4) - 2 freq almost (4) - 120 freq albais (4) - 1 freq alberto (4) - 2 freq lowest (4) - 10 freq alset (4) - 1 freq |
SoundEx code - A412 alba's - 6 freq alps - 2 freq alfie's - 8 freq alfiie's - 1 freq albus - 4 freq aul-fashioned - 5 freq aal-fashioned - 1 freq alibis - 2 freq alf's - 1 freq alphaeus - 1 freq alphaeus's - 1 freq alphaeus' - 1 freq alabast - 1 freq albeest - 1 freq alabaster - 3 freq albais - 1 freq albagal - 1 freq albagman - 2 freq |
MetaPhone code - ALBST alabast - 1 freq albeest - 1 freq |
ALBEEST |
| Time to execute Levenshtein function - 0.232782 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.412316 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.032401 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.043548 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.001310 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. |