| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ochils (0) - 8 freq ochil (1) - 4 freq scuils (2) - 54 freq chirls (2) - 2 freq child (2) - 57 freq ocht's (2) - 1 freq chips (2) - 118 freq cuils (2) - 1 freq cheils (2) - 33 freq pochil (2) - 1 freq coils (2) - 11 freq 'chill (2) - 2 freq ochres (2) - 2 freq chis (2) - 2 freq schuils (2) - 139 freq chiks (2) - 17 freq 'child (2) - 2 freq onkils (2) - 1 freq chile (2) - 15 freq childs (2) - 1 freq chins (2) - 5 freq oboils (2) - 1 freq chill (2) - 45 freq phils (2) - 1 freq chills (2) - 7 freq |
ochils (0) - 8 freq chiels (2) - 112 freq ochil (2) - 4 freq cheils (2) - 33 freq chill (3) - 45 freq chins (3) - 5 freq childs (3) - 1 freq chiks (3) - 17 freq chills (3) - 7 freq chibs (3) - 5 freq chits (3) - 1 freq ochts (3) - 3 freq schuils (3) - 139 freq phils (3) - 1 freq chile (3) - 15 freq chips (3) - 118 freq chis (3) - 2 freq child (3) - 57 freq chirls (3) - 2 freq cuils (3) - 1 freq cheels (3) - 2 freq ochres (3) - 2 freq coils (3) - 11 freq chaas (4) - 2 freq chows (4) - 1 freq |
SoundEx code - O242 oclock - 3 freq o'clock - 98 freq o'cloack - 1 freq o'kellys - 1 freq o'cloke - 1 freq o'cloak - 1 freq oslo's - 1 freq o'clockish - 1 freq ocklester - 1 freq och-like - 1 freq ochils - 8 freq okzlx - 1 freq oclock - 2 freq oacaiwlkks - 1 freq |
MetaPhone code - OXLS ochils - 8 freq |
OCHILS |
| Time to execute Levenshtein function - 0.198906 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.376090 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.029741 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.037726 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.000901 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. |