| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albeit (0) - 6 freq albert (1) - 25 freq awbeit (1) - 9 freq arbeit (1) - 1 freq aabeit (1) - 3 freq abeit (1) - 1 freq albeid (1) - 1 freq abet (2) - 1 freq leit (2) - 15 freq halbert (2) - 2 freq oleit (2) - 1 freq 'albert (2) - 1 freq fleit (2) - 2 freq alreet (2) - 3 freq alberta (2) - 1 freq awbesit (2) - 2 freq alert (2) - 17 freq aboit (2) - 1 freq alset (2) - 1 freq allest (2) - 1 freq abit (2) - 1 freq aldest (2) - 1 freq albais (2) - 1 freq beit (2) - 13 freq alberto (2) - 2 freq |
albeit (0) - 6 freq abeit (2) - 1 freq aabeit (2) - 3 freq albeid (2) - 1 freq albert (2) - 25 freq awbeit (2) - 9 freq arbeit (2) - 1 freq aboit (3) - 1 freq albais (3) - 1 freq abit (3) - 1 freq alberto (3) - 2 freq alert (3) - 17 freq albeest (3) - 1 freq beit (3) - 13 freq alset (3) - 1 freq leit (3) - 15 freq oleit (3) - 1 freq alreet (3) - 3 freq alberta (3) - 1 freq abet (3) - 1 freq loert (4) - 2 freq alist (4) - 2 freq elbain (4) - 1 freq leist (4) - 3 freq liet (4) - 4 freq |
SoundEx code - A413 alaft - 2 freq alfdi - 1 freq alleviated - 1 freq 'alaft - 1 freq aloft - 3 freq albeit - 6 freq alleviatit - 1 freq albeid - 1 freq alfieheydrich - 1 freq alloftheabove - 1 freq alba-the - 1 freq |
MetaPhone code - ALBT albeit - 6 freq albeid - 1 freq |
ALBEIT |
| Time to execute Levenshtein function - 0.187663 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.357507 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.030554 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.037153 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.000867 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. |