| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| task-forces (0) - 1 freq task-force (1) - 1 freq warkforce (4) - 1 freq gale-force' (4) - 1 freq resoorces (5) - 20 freq reinforces (5) - 2 freq forces (5) - 42 freq ranforced (5) - 1 freq fraserforbes (5) - 1 freq airforce (5) - 2 freq tak-ower (5) - 1 freq fause-faces (5) - 1 freq wark-oors (5) - 1 freq workforce (5) - 2 freq the-fore (5) - 1 freq rossforbes (5) - 5 freq fast-forrit (5) - 1 freq askboris (5) - 1 freq faktories (5) - 1 freq waarkforce (5) - 1 freq skonces (5) - 1 freq backfires (5) - 1 freq soorces (5) - 15 freq tam-fools (5) - 1 freq kateforbes (5) - 2 freq |
task-forces (0) - 1 freq task-force (2) - 1 freq fause-faces (8) - 1 freq warkforce (8) - 1 freq gale-force' (8) - 1 freq soorces (9) - 15 freq askboris (9) - 1 freq tam-fools (9) - 1 freq waarkforce (9) - 1 freq skonces (9) - 1 freq mack-flees (9) - 1 freq house-feres (9) - 1 freq take-offs (9) - 1 freq yatt-races (9) - 1 freq fast-forrit (9) - 1 freq kateforbes (9) - 2 freq backfires (9) - 1 freq tak-ower (9) - 1 freq forces (9) - 42 freq rossforbes (9) - 5 freq reinforces (9) - 2 freq wark-oors (9) - 1 freq fish-ferms (9) - 1 freq workforce (9) - 2 freq the-fore (9) - 1 freq |
SoundEx code - T216 tazper - 1 freq taxpeyer - 1 freq takeover - 2 freq tax-payers - 1 freq taxpayer - 1 freq tsipras - 1 freq task-forces - 1 freq task-force - 1 freq tgifridaysuk - 1 freq tasvrb - 1 freq tisfortracy - 1 freq tqjprmtqnx - 1 freq twgbr - 1 freq taegevver - 1 freq ticiaverveer - 1 freq tixqkbrmc - 1 freq taxiforshanksy - 1 freq |
MetaPhone code - TSKFRSS task-forces - 1 freq |
TASK-FORCES |
| Time to execute Levenshtein function - 0.298675 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.556040 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.033472 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.045292 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.000878 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. |