| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twafald (0) - 1 freq twafauld (1) - 4 freq twafaald (1) - 2 freq twaalt (2) - 1 freq twaard (2) - 5 freq twofold (2) - 1 freq twaal (2) - 6 freq twa-fauld (2) - 1 freq twa-fal (2) - 1 freq waalk (3) - 5 freq twal' (3) - 1 freq twad (3) - 1 freq waaled (3) - 2 freq swaall (3) - 1 freq awfal (3) - 1 freq kaald (3) - 4 freq tauld (3) - 11 freq twaul (3) - 2 freq twal (3) - 120 freq waall (3) - 1 freq traaled (3) - 1 freq aald (3) - 202 freq waffled (3) - 1 freq taall (3) - 6 freq twaa (3) - 30 freq |
twafald (0) - 1 freq twafaald (1) - 2 freq twafauld (1) - 4 freq twofold (2) - 1 freq twa-fauld (3) - 1 freq two-fold (4) - 1 freq twa-fal (4) - 1 freq twaalt (4) - 1 freq twaal (4) - 6 freq twaard (4) - 5 freq twirled (5) - 2 freq twa-faul (5) - 1 freq watld (5) - 1 freq twall (5) - 3 freq waarld (5) - 1 freq swald (5) - 2 freq twalt (5) - 2 freq wald (5) - 2 freq awald (5) - 3 freq twa-taed (5) - 2 freq trifled (5) - 1 freq wafted (5) - 7 freq warld (5) - 820 freq waffed (5) - 4 freq twa-leid (5) - 9 freq |
SoundEx code - T143 tableheid - 1 freq toppled - 3 freq tablets - 7 freq taiblet - 3 freq tablet - 23 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 |
TWAFALD |
| Time to execute Levenshtein function - 0.212307 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.372418 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.028525 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.037904 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.000877 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. |