| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenement (0) - 21 freq tenements (1) - 20 freq tenenent (1) - 1 freq mevement (2) - 1 freq tenent (2) - 2 freq element (2) - 45 freq atonement (2) - 1 freq tennent (2) - 2 freq teemen (2) - 2 freq elements (3) - 35 freq seevent (3) - 3 freq repeyment (3) - 1 freq eyntment (3) - 2 freq waement (3) - 1 freq monument (3) - 16 freq tenant (3) - 14 freq muvement (3) - 4 freq weemen' (3) - 1 freq refinement (3) - 3 freq bazement (3) - 1 freq lenient (3) - 2 freq enagement (3) - 1 freq easement (3) - 9 freq segment (3) - 1 freq degerent (3) - 1 freq |
tenement (0) - 21 freq tenenent (2) - 1 freq atonement (2) - 1 freq tenements (2) - 20 freq tinamint (3) - 1 freq tenent (3) - 2 freq tennent (3) - 2 freq iniment (4) - 1 freq termint (4) - 2 freq torment (4) - 15 freq liniment (4) - 1 freq moniement (4) - 1 freq tenant (4) - 14 freq ornament (4) - 7 freq monument (4) - 16 freq moniment (4) - 9 freq ornyment (4) - 1 freq teemen (4) - 2 freq element (4) - 45 freq denouement (4) - 1 freq mevement (4) - 1 freq ointment (5) - 5 freq griement (5) - 1 freq kinmont (5) - 3 freq ternent (5) - 1 freq |
SoundEx code - T555 tenement - 21 freq tenements - 20 freq tenenent - 1 freq tinamint - 1 freq |
MetaPhone code - TNMNT tenement - 21 freq denouement - 1 freq tinamint - 1 freq downmanned - 1 freq |
TENEMENT |
| Time to execute Levenshtein function - 0.269034 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.395500 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.028591 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.039286 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.000893 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. |