Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oclock (0) - 3 freq clock (1) - 197 freq o'clock (1) - 98 freq aclock (1) - 1 freq 'lock (2) - 1 freq block (2) - 55 freq clocks (2) - 18 freq a'clock (2) - 13 freq cock (2) - 82 freq cloak (2) - 30 freq slock (2) - 8 freq clok (2) - 2 freq o'cloack (2) - 1 freq clack (2) - 9 freq €˜lock (2) - 1 freq cleck (2) - 10 freq €™clock (2) - 12 freq flock (2) - 43 freq lock (2) - 156 freq i'clock (2) - 1 freq cluck (2) - 2 freq clonk (2) - 2 freq crock (2) - 13 freq clook (2) - 3 freq olick (2) - 1 freq |
oclock (0) - 3 freq aclock (1) - 1 freq clock (1) - 197 freq cleck (2) - 10 freq click (2) - 132 freq cloack (2) - 20 freq clack (2) - 9 freq cluck (2) - 2 freq o'clock (2) - 98 freq clockt (3) - 1 freq chock (3) - 1 freq cock (3) - 82 freq clook (3) - 3 freq crock (3) - 13 freq unlock (3) - 7 freq block (3) - 55 freq clicky (3) - 41 freq claick (3) - 1 freq clyack (3) - 6 freq 'lock (3) - 1 freq clonk (3) - 2 freq olick (3) - 1 freq slock (3) - 8 freq a'clock (3) - 13 freq clok (3) - 2 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 oÂ’clock - 2 freq oacaiwlkks - 1 freq |
MetaPhone code - OKLK oclock - 3 freq o'clock - 98 freq o'cloack - 1 freq o'cloke - 1 freq o'cloak - 1 freq oÂ’clock - 2 freq |
OCLOCK |
Time to execute Levenshtein function - 0.257147 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.337257 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.028477 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.040464 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. |