| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upricht (0) - 21 freq unricht (1) - 1 freq upright (1) - 10 freq 'richt (2) - 36 freq stricht (2) - 1 freq procht (2) - 3 freq plicht (2) - 12 freq praicht (2) - 5 freq outricht (2) - 1 freq apricot (2) - 1 freq aaricht (2) - 35 freq richt (2) - 4087 freq sudricht (2) - 1 freq vricht (2) - 6 freq aricht (2) - 71 freq a'richt (2) - 8 freq €˜richt (2) - 4 freq prucht (2) - 1 freq wricht (2) - 15 freq uptight (2) - 3 freq bricht (2) - 435 freq awricht (2) - 85 freq upbrocht (2) - 1 freq €œricht (2) - 11 freq ulrich (2) - 1 freq |
upricht (0) - 21 freq procht (2) - 3 freq prucht (2) - 1 freq praicht (2) - 5 freq upright (2) - 10 freq unricht (2) - 1 freq upbrocht (3) - 1 freq awricht (3) - 85 freq bricht (3) - 435 freq spraicht (3) - 1 freq wricht (3) - 15 freq alricht (3) - 4 freq preacht (3) - 8 freq parcht (3) - 1 freq percht (3) - 2 freq fricht (3) - 62 freq itricht (3) - 1 freq apricot (3) - 1 freq outricht (3) - 1 freq plicht (3) - 12 freq richt (3) - 4087 freq aaricht (3) - 35 freq aricht (3) - 71 freq vricht (3) - 6 freq a'richt (3) - 8 freq |
SoundEx code - U162 upricht - 21 freq upright - 10 freq uprisin - 5 freq upper-classes - 1 freq uppercut - 1 freq upraised - 2 freq upbraks - 1 freq uprichteous - 1 freq upbrocht - 1 freq uppers - 2 freq upbrak - 2 freq upraise - 1 freq uprising - 3 freq ueprjbsbg - 1 freq uppersenwick - 1 freq |
MetaPhone code - UPRXT upricht - 21 freq |
UPRICHT |
| Time to execute Levenshtein function - 0.178051 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.349657 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.030955 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.037321 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.000852 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. |