| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twelvr (0) - 1 freq twelve (1) - 89 freq twalve (2) - 10 freq welr (2) - 1 freq telr (2) - 1 freq 'twelve (2) - 2 freq twelves (2) - 1 freq twelth (2) - 1 freq twel (2) - 1 freq tver (3) - 3 freq twein (3) - 1 freq twenty (3) - 165 freq telle (3) - 7 freq tyler (3) - 15 freq teir (3) - 11 freq weliy (3) - 1 freq welts (3) - 1 freq tenor (3) - 4 freq twesna (3) - 1 freq tele (3) - 32 freq tweed (3) - 26 freq taelem (3) - 1 freq tulv (3) - 1 freq meeler (3) - 1 freq telfer (3) - 2 freq |
twelvr (0) - 1 freq twelve (2) - 89 freq twalve (3) - 10 freq twelves (3) - 1 freq twelth (4) - 1 freq wulver (4) - 1 freq twel (4) - 1 freq telr (4) - 1 freq 'twelve (4) - 2 freq welr (4) - 1 freq tylor (5) - 1 freq weaver (5) - 12 freq towels (5) - 5 freq twill (5) - 1 freq trevor (5) - 3 freq tlr (5) - 1 freq twall (5) - 3 freq tweeter (5) - 2 freq twilts (5) - 1 freq tweelin (5) - 2 freq twalbore (5) - 1 freq taaler (5) - 3 freq twalt (5) - 2 freq twa'r (5) - 10 freq twar (5) - 2 freq |
SoundEx code - T416 tulip-roots - 4 freq twelve-year-old - 1 freq tulip-ruits - 1 freq twelve-year-aulds - 1 freq tulip-röts - 1 freq tullyford - 1 freq twelvr - 1 freq tilfers - 1 freq toolbar - 1 freq teleport - 1 freq telfer - 2 freq twalbore - 1 freq tailfer - 1 freq |
MetaPhone code - TWLFR twelvr - 1 freq |
TWELVR |
| Time to execute Levenshtein function - 0.379486 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.488185 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.028188 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.071881 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.001510 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. |