| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twofold (0) - 1 freq two-fold (1) - 1 freq twafald (2) - 1 freq twofur (3) - 1 freq tools (3) - 47 freq 'world (3) - 1 freq fold (3) - 18 freq unfold (3) - 8 freq toole (3) - 1 freq wford (3) - 1 freq woond (3) - 5 freq told (3) - 134 freq wool (3) - 31 freq twafauld (3) - 4 freq toonfolk (3) - 1 freq tooled (3) - 3 freq woful (3) - 2 freq would (3) - 722 freq tould (3) - 2 freq moold (3) - 1 freq goold (3) - 3 freq wood (3) - 67 freq 'wool' (3) - 1 freq tood (3) - 1 freq swoord (3) - 4 freq |
twofold (0) - 1 freq two-fold (2) - 1 freq twafald (2) - 1 freq twafauld (3) - 4 freq twafaald (3) - 2 freq towld (4) - 5 freq toffed (5) - 1 freq twa-fauld (5) - 1 freq tould (5) - 2 freq would (5) - 722 freq world (5) - 449 freq trifled (5) - 1 freq woful (5) - 2 freq tweetled (5) - 1 freq wold (5) - 1 freq twirled (5) - 2 freq woarld (5) - 7 freq 'world (5) - 1 freq fold (5) - 18 freq wford (5) - 1 freq unfold (5) - 8 freq twofur (5) - 1 freq toonfolk (5) - 1 freq told (5) - 134 freq tooled (5) - 3 freq |
SoundEx code - T143 tableheid - 1 freq toppled - 3 freq tablets - 7 freq taiblet - 3 freq tablet - 25 freq table-tap - 1 freq tablet-waal - 1 freq tablet-waaleh - 1 freq tabloids - 6 freq tabloid - 3 freq twafauld - 4 freq twa-fauld - 1 freq twafaald - 2 freq tabulet - 1 freq tabletap - 1 freq tabled - 1 freq twofold - 1 freq twafald - 1 freq tea-blaudit - 1 freq tbltalkmedia - 1 freq tablet's - 1 freq two-fold - 1 freq theboldtype - 1 freq |
MetaPhone code - TWFLT twafauld - 4 freq twa-fauld - 1 freq twafaald - 2 freq twofold - 1 freq twafald - 1 freq two-fold - 1 freq |
TWOFOLD |
| Time to execute Levenshtein function - 0.213158 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.356710 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.027935 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.037605 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.000888 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. |