| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iscot (0) - 1 freq scot (1) - 108 freq ascot (1) - 3 freq i'cat (2) - 1 freq issit (2) - 1 freq swot (2) - 4 freq isnt (2) - 2 freq inco (2) - 1 freq 'scots (2) - 17 freq idoot (2) - 1 freq 'shot (2) - 1 freq is-oh (2) - 3 freq csco (2) - 1 freq mascot (2) - 2 freq isn't (2) - 34 freq misgot (2) - 1 freq sct (2) - 1 freq is'nt (2) - 1 freq soot (2) - 10 freq cot (2) - 44 freq scots (2) - 6843 freq idiot (2) - 24 freq gcscot (2) - 1 freq wi-cot (2) - 1 freq mscott (2) - 1 freq |
iscot (0) - 1 freq ascot (1) - 3 freq scot (1) - 108 freq scota (2) - 2 freq scoot (2) - 13 freq scoit (2) - 1 freq scoto (2) - 1 freq sct (2) - 1 freq scoti (2) - 1 freq scout (2) - 13 freq scott (3) - 309 freq scol (3) - 1 freq swot (3) - 4 freq snot (3) - 2 freq spot (3) - 251 freq escort (3) - 3 freq sco (3) - 13 freq isnt (3) - 2 freq ict (3) - 1 freq ist (3) - 11 freq slot (3) - 12 freq scata (3) - 2 freq i'cat (3) - 1 freq scooty (3) - 2 freq issit (3) - 1 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 47 freq 'is't - 1 freq iste - 1 freq i-ight - 1 freq ist - 11 freq iiokket - 1 freq iikit - 1 freq izat - 1 freq issued - 6 freq is-the - 1 freq ict - 1 freq i'stew - 1 freq i'cat - 1 freq i'settee - 1 freq i'shade - 5 freq iside - 1 freq izatt - 2 freq ischewed - 1 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq ixd - 1 freq izt - 1 freq isd - 1 freq iogjkota - 1 freq iscot - 1 freq isaidaye - 2 freq ikcd - 1 freq |
MetaPhone code - ISKT iscot - 1 freq |
ISCOT |
| Time to execute Levenshtein function - 0.195361 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.352083 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.031331 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.039187 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.000935 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. |