| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alricht (0) - 4 freq alicht (1) - 14 freq aaricht (1) - 35 freq aricht (1) - 71 freq a'richt (1) - 8 freq awricht (1) - 85 freq alright (1) - 21 freq licht (2) - 909 freq aa'richt (2) - 1 freq 'awricht (2) - 13 freq €œricht (2) - 11 freq bricht (2) - 442 freq almichty (2) - 40 freq itricht (2) - 1 freq upricht (2) - 22 freq stricht (2) - 1 freq awericht (2) - 2 freq apricot (2) - 1 freq fricht (2) - 63 freq aright (2) - 7 freq albrecht (2) - 1 freq 'a'richt (2) - 1 freq ulrich (2) - 1 freq liicht (2) - 1 freq aalright (2) - 1 freq |
alricht (0) - 4 freq awricht (2) - 85 freq alicht (2) - 14 freq a'richt (2) - 8 freq alright (2) - 21 freq aaricht (2) - 35 freq aricht (2) - 71 freq vricht (3) - 6 freq 'aaricht (3) - 3 freq unricht (3) - 1 freq aalright (3) - 1 freq leicht (3) - 2 freq liicht (3) - 1 freq ulrich (3) - 1 freq wricht (3) - 15 freq 'richt (3) - 37 freq richt (3) - 4119 freq aircht (3) - 1 freq arecht (3) - 1 freq albrecht (3) - 1 freq itricht (3) - 1 freq almichty (3) - 40 freq awericht (3) - 2 freq aa'richt (3) - 1 freq fricht (3) - 63 freq |
SoundEx code - A462 allargue - 1 freq alricht - 4 freq alright - 21 freq allergy - 4 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 - ALRXT alricht - 4 freq |
ALRICHT |
| Time to execute Levenshtein function - 0.188215 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.342636 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.027529 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.038292 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.000899 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. |