| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twalve (0) - 10 freq twelve (1) - 85 freq twal' (2) - 1 freq walie (2) - 1 freq salve (2) - 5 freq tyaave (2) - 2 freq twaese (2) - 3 freq valve (2) - 1 freq twal (2) - 120 freq twelvr (2) - 1 freq twalt (2) - 2 freq twall (2) - 3 freq halve (2) - 1 freq 'twelve (2) - 2 freq tsalne (2) - 1 freq toalie (2) - 1 freq twalth (2) - 1 freq tyauve (2) - 20 freq tale (2) - 299 freq twae (2) - 228 freq waeve (2) - 1 freq wale (2) - 34 freq waive (2) - 3 freq twelves (2) - 1 freq wave (2) - 129 freq |
twalve (0) - 10 freq twelve (1) - 85 freq twall (3) - 3 freq twelvr (3) - 1 freq 'twelve (3) - 2 freq twelves (3) - 1 freq twal (3) - 120 freq twalt (3) - 2 freq twal' (3) - 1 freq twelfie (4) - 1 freq outwale (4) - 3 freq wave (4) - 129 freq twaal (4) - 6 freq walee (4) - 1 freq twilt (4) - 2 freq waive (4) - 3 freq twaul (4) - 2 freq twill (4) - 1 freq twaalt (4) - 1 freq ootwale (4) - 3 freq twel (4) - 1 freq tulv (4) - 1 freq wale (4) - 34 freq salve (4) - 5 freq halve (4) - 1 freq |
SoundEx code - T410 twelve - 85 freq twalve - 10 freq tulip - 2 freq 'twelve - 2 freq tea-leaf - 1 freq tulv - 1 freq twelfie - 1 freq tohlp - 1 freq tlup - 1 freq |
MetaPhone code - TWLF twelve - 85 freq twalve - 10 freq 'twelve - 2 freq twelfie - 1 freq |
TWALVE |
| Time to execute Levenshtein function - 0.199215 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.352173 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.029238 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.038472 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.000850 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. |