| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alright (0) - 20 freq aalright (1) - 1 freq 'alright (1) - 2 freq alight (1) - 3 freq awright (1) - 147 freq alricht (1) - 4 freq aaright (1) - 3 freq ahright (1) - 1 freq aright (1) - 7 freq awright' (2) - 1 freq €œright (2) - 8 freq stright (2) - 1 freq -right (2) - 1 freq slight (2) - 10 freq plight (2) - 11 freq fright (2) - 26 freq awricht (2) - 85 freq €˜alright (2) - 1 freq sawright (2) - 3 freq aÂ’right (2) - 1 freq almighty (2) - 9 freq 'bright (2) - 1 freq allwight (2) - 2 freq flight (2) - 45 freq bright (2) - 99 freq |
alright (0) - 20 freq aalright (1) - 1 freq ahright (2) - 1 freq alricht (2) - 4 freq aright (2) - 7 freq aaright (2) - 3 freq alight (2) - 3 freq 'alright (2) - 2 freq awright (2) - 147 freq right (3) - 1385 freq bright (3) - 99 freq almighty (3) - 9 freq fright (3) - 26 freq wright (3) - 26 freq upright (3) - 10 freq 'right (3) - 21 freq -right (3) - 1 freq light (3) - 285 freq ootright (4) - 1 freq alicht (4) - 14 freq aaricht (4) - 35 freq laaght (4) - 1 freq wroght (4) - 1 freq freight (4) - 1 freq lenght (4) - 2 freq |
SoundEx code - A462 allargue - 1 freq alricht - 4 freq allergy - 4 freq alright - 20 freq auler's - 1 freq 'alright - 2 freq aalright - 1 freq allers - 1 freq allergic - 2 freq €˜alright - 1 freq alresis - 1 freq allergies - 2 freq |
MetaPhone code - ALRFT alright - 20 freq 'alright - 2 freq aalright - 1 freq €˜alright - 1 freq |
ALRIGHT |
| Time to execute Levenshtein function - 0.180022 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.352736 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.028464 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.037368 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.000888 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. |