Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
focussit (0) - 1 freq focusit (1) - 1 freq focussed (2) - 8 freq focusin (2) - 9 freq forssit (2) - 1 freq foustit (2) - 1 freq poussin (3) - 1 freq cursit (3) - 4 freq tousit (3) - 1 freq fusst (3) - 1 freq locust (3) - 2 freq focused (3) - 27 freq foistit (3) - 1 freq decessit (3) - 1 freq discussit (3) - 3 freq foundit (3) - 6 freq fossil (3) - 10 freq foubeit (3) - 7 freq focus (3) - 115 freq forrsit (3) - 1 freq dousit (3) - 1 freq lowssit (3) - 1 freq fessit (3) - 2 freq accursit (3) - 1 freq roustit (3) - 5 freq |
focussit (0) - 1 freq focusit (2) - 1 freq forssit (3) - 1 freq focussed (3) - 8 freq fusst (4) - 1 freq decessit (4) - 1 freq focuses (4) - 2 freq fessit (4) - 2 freq foustit (4) - 1 freq focusin (4) - 9 freq fussin (5) - 6 freq focusing (5) - 1 freq accusit (5) - 1 freq accursit (5) - 1 freq necessity (5) - 7 freq cassat (5) - 1 freq cosst (5) - 1 freq lowssit (5) - 1 freq foostit (5) - 1 freq loessit (5) - 1 freq foust (5) - 1 freq cosset (5) - 1 freq casset (5) - 2 freq fesst (5) - 1 freq discussit (5) - 3 freq |
SoundEx code - F223 foggiest - 8 freq fykiest - 2 freq focused - 27 freq fokest - 1 freq fascist - 5 freq focussit - 1 freq feughside - 1 freq fish-guts - 1 freq focusit - 1 freq focussed - 8 freq fascists - 4 freq fuyksgysid - 1 freq fwaxysdjvy - 1 freq fxcxczgekd - 1 freq |
MetaPhone code - FKST fixed - 73 freq foggiest - 8 freq fykiest - 2 freq vext - 14 freq vexed - 47 freq focused - 27 freq fixit - 7 freq vexit - 2 freq fokest - 1 freq focussit - 1 freq vex't - 2 freq foxed - 2 freq vexxed - 1 freq focusit - 1 freq focussed - 8 freq figst - 1 freq |
FOCUSSIT |
Time to execute Levenshtein function - 0.228024 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.374793 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.028526 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.037514 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.000912 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. |