| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenement (0) - 21 freq tenements (1) - 19 freq tenenent (1) - 1 freq atonement (2) - 1 freq mevement (2) - 1 freq teemen (2) - 2 freq tenent (2) - 2 freq element (2) - 45 freq tennent (2) - 2 freq repeyment (3) - 1 freq traetment (3) - 2 freq treatment (3) - 39 freq seevent (3) - 3 freq bellement (3) - 3 freq enagement (3) - 1 freq teletext (3) - 1 freq movement (3) - 67 freq segment (3) - 1 freq ternent (3) - 1 freq eenocent (3) - 2 freq greement (3) - 20 freq remeent (3) - 2 freq regiment (3) - 21 freq tinamint (3) - 1 freq teemed (3) - 21 freq |
tenement (0) - 21 freq atonement (2) - 1 freq tenenent (2) - 1 freq tenements (2) - 19 freq tennent (3) - 2 freq tenent (3) - 2 freq tinamint (3) - 1 freq moniement (4) - 1 freq ornament (4) - 5 freq element (4) - 45 freq iniment (4) - 1 freq termint (4) - 2 freq torment (4) - 15 freq moniment (4) - 9 freq denouement (4) - 1 freq liniment (4) - 1 freq ornyment (4) - 1 freq tenant (4) - 14 freq monument (4) - 16 freq mevement (4) - 1 freq teemen (4) - 2 freq teemt (5) - 3 freq entent (5) - 1 freq basement (5) - 9 freq tormint (5) - 1 freq |
SoundEx code - T555 tenement - 21 freq tenements - 19 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.188593 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.368801 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.032951 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.040173 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.000845 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. |