| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ochils (0) - 8 freq ochil (1) - 4 freq childs (2) - 1 freq pochil (2) - 1 freq ochres (2) - 2 freq child (2) - 56 freq cuils (2) - 1 freq schips (2) - 1 freq locails (2) - 2 freq orchids (2) - 2 freq 'chill (2) - 2 freq chins (2) - 5 freq ocht's (2) - 1 freq schuils (2) - 138 freq ochts (2) - 3 freq chibs (2) - 5 freq chirls (2) - 2 freq onkils (2) - 1 freq phils (2) - 1 freq chile (2) - 15 freq chips (2) - 117 freq chiks (2) - 17 freq oils (2) - 2 freq 'child (2) - 2 freq ochie (2) - 8 freq |
ochils (0) - 8 freq chiels (2) - 110 freq ochil (2) - 4 freq cheils (2) - 33 freq chiks (3) - 17 freq chips (3) - 117 freq phils (3) - 1 freq chirls (3) - 2 freq chile (3) - 15 freq chill (3) - 45 freq cheels (3) - 2 freq chits (3) - 1 freq chills (3) - 7 freq coils (3) - 11 freq chibs (3) - 5 freq chis (3) - 2 freq ochres (3) - 2 freq ochts (3) - 3 freq childs (3) - 1 freq cuils (3) - 1 freq child (3) - 56 freq schuils (3) - 138 freq chins (3) - 5 freq schools (4) - 42 freq weechils (4) - 1 freq |
SoundEx code - O242 oclock - 3 freq o'clock - 97 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.671442 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.892352 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.039788 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.087010 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.000834 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. |