Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
focused (0) - 27 freq focuses (1) - 2 freq focussed (1) - 8 freq excused (2) - 3 freq soused (2) - 2 freq housed (2) - 1 freq roused (2) - 14 freq accused (2) - 24 freq focusin (2) - 9 freq focusit (2) - 1 freq loused (2) - 5 freq fused (2) - 6 freq doused (2) - 2 freq focus (2) - 115 freq youse' (3) - 1 freq paused (3) - 74 freq mouse (3) - 32 freq bossed (3) - 6 freq boued (3) - 22 freq nosed (3) - 6 freq forced (3) - 73 freq floued (3) - 1 freq encased (3) - 2 freq pochled (3) - 3 freq mocked (3) - 9 freq |
focused (0) - 27 freq focuses (2) - 2 freq focussed (2) - 8 freq focusin (3) - 9 freq focusit (3) - 1 freq accused (3) - 24 freq focus (3) - 115 freq fused (3) - 6 freq excused (3) - 3 freq fecked (4) - 16 freq faced (4) - 69 freq fluised (4) - 1 freq fussed (4) - 13 freq encased (4) - 2 freq fessed (4) - 5 freq fucked (4) - 64 freq caused (4) - 78 freq loused (4) - 5 freq housed (4) - 1 freq excuised (4) - 2 freq doused (4) - 2 freq fraised (4) - 3 freq soused (4) - 2 freq roused (4) - 14 freq hoched (5) - 1 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 |
FOCUSED |
Time to execute Levenshtein function - 0.193678 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.419966 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.029087 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.037219 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.000898 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. |