| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twa-fal (0) - 1 freq twa-faul (1) - 1 freq twafald (2) - 1 freq twaal (2) - 6 freq twa-fauld (2) - 1 freq twa-fit (2) - 1 freq twa-faced (3) - 3 freq twa-oor (3) - 1 freq aafal (3) - 22 freq ta-ra (3) - 29 freq twaul (3) - 2 freq waal (3) - 45 freq swaal (3) - 2 freq tea-nae (3) - 1 freq tod-fam (3) - 1 freq twaa (3) - 32 freq tearful (3) - 2 freq toaffay (3) - 1 freq twa-pun (3) - 1 freq twa-foot (3) - 1 freq taal (3) - 7 freq twa-twa (3) - 1 freq two-fold (3) - 1 freq ta-ta (3) - 2 freq twa-wey (3) - 6 freq |
twa-fal (0) - 1 freq twa-faul (1) - 1 freq twa-fauld (3) - 1 freq twa-fit (3) - 1 freq twa-foot (4) - 1 freq twafald (4) - 1 freq twaal (4) - 6 freq two-fold (4) - 1 freq twa-year (5) - 2 freq awfal (5) - 1 freq twa-taed (5) - 2 freq twa-twa (5) - 1 freq two-man (5) - 1 freq twall (5) - 3 freq twafauld (5) - 4 freq tin-foil (5) - 1 freq twafaald (5) - 2 freq twal (5) - 120 freq twa-wey (5) - 6 freq twa-oor (5) - 1 freq twa-pun (5) - 1 freq twaul (5) - 2 freq tod-fam (5) - 1 freq towtful (5) - 1 freq twae-mile (5) - 1 freq |
SoundEx code - T140 table - 686 freq tipple - 3 freq twa-fal - 1 freq twa-faul - 1 freq tebel - 1 freq taible - 2 freq topple - 1 freq tibble - 18 freq tivoli - 5 freq teeble - 6 freq taibil - 3 freq taeble - 3 freq t'boyl - 1 freq the-ablow - 2 freq tap'll - 1 freq tfel - 1 freq tyfbl - 1 freq table' - 1 freq tvl - 1 freq tbl - 1 freq |
MetaPhone code - TWFL twa-fal - 1 freq twa-faul - 1 freq |
TWA-FAL |
| Time to execute Levenshtein function - 0.597109 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.813987 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.085449 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.095761 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.000858 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. |