| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| focusin (0) - 9 freq focusing (1) - 1 freq focusit (1) - 1 freq focuses (2) - 2 freq cousin (2) - 100 freq focus (2) - 106 freq excusin (2) - 1 freq dousin (2) - 1 freq rousin (2) - 5 freq housin (2) - 5 freq accusin (2) - 7 freq focussit (2) - 1 freq focused (2) - 26 freq fouin (2) - 1 freq lousin (2) - 4 freq fusion (3) - 4 freq brousin (3) - 2 freq posin (3) - 9 freq moupin (3) - 1 freq lourin (3) - 8 freq poussin (3) - 1 freq footin (3) - 1 freq fossil (3) - 9 freq foofin (3) - 1 freq fornin (3) - 1 freq |
focusin (0) - 9 freq focusing (2) - 1 freq focusit (2) - 1 freq focused (3) - 26 freq accusin (3) - 7 freq excusin (3) - 1 freq focuses (3) - 2 freq focus (3) - 106 freq cousin (3) - 100 freq causin (4) - 14 freq foosion (4) - 1 freq casin (4) - 3 freq fussin (4) - 6 freq fackin (4) - 1 freq fuckin (4) - 1018 freq cuisin (4) - 1 freq foirsein (4) - 1 freq frosin (4) - 1 freq feckin (4) - 51 freq featsin (4) - 2 freq fackson (4) - 1 freq facin (4) - 32 freq fauson (4) - 1 freq fraisin (4) - 1 freq fessin (4) - 1 freq |
SoundEx code - F225 focusin - 9 freq fush-skin - 1 freq fascism - 4 freq focusonceltic - 1 freq focusing - 1 freq fazagmrtza - 2 freq |
MetaPhone code - FKSN vexin - 5 freq fixin - 17 freq focusin - 9 freq fackson - 1 freq vaccine - 6 freq fixin' - 1 freq vexxin - 1 freq vixen - 1 freq vaccine' - 1 freq |
FOCUSIN |
| Time to execute Levenshtein function - 0.194889 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.316801 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.027082 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.036585 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.000856 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. |