| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenenent (0) - 1 freq tennent (1) - 2 freq tenement (1) - 21 freq tenements (2) - 20 freq ternent (2) - 1 freq tenent (2) - 2 freq tennents (2) - 6 freq referent (3) - 3 freq tenpenny (3) - 1 freq emerent (3) - 1 freq tenner (3) - 25 freq teeden (3) - 1 freq keneen (3) - 2 freq dependent (3) - 5 freq kennen (3) - 2 freq pennents (3) - 1 freq hereanent (3) - 1 freq defendent (3) - 1 freq keenest (3) - 1 freq seelent (3) - 25 freq lenient (3) - 2 freq kennelt (3) - 1 freq teletext (3) - 1 freq jennet (3) - 94 freq eenocent (3) - 2 freq |
tenenent (0) - 1 freq tennent (1) - 2 freq tenement (2) - 21 freq tennents (3) - 6 freq tenent (3) - 2 freq ternent (3) - 1 freq tennants (4) - 1 freq tenant (4) - 14 freq atonement (4) - 1 freq pennant (4) - 1 freq tranent (4) - 28 freq tenements (4) - 20 freq teen't (5) - 1 freq forenent (5) - 68 freq rennen (5) - 2 freq tenners (5) - 4 freq tenentis (5) - 1 freq kennet (5) - 1 freq bennett (5) - 6 freq itinerant (5) - 1 freq tannin (5) - 12 freq tanning (5) - 3 freq sentient (5) - 1 freq tennent's (5) - 6 freq entent (5) - 1 freq |
SoundEx code - T555 tenement - 21 freq tenements - 20 freq tenenent - 1 freq tinamint - 1 freq |
MetaPhone code - TNNNT tenenent - 1 freq |
TENENENT |
| Time to execute Levenshtein function - 0.216933 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.396627 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.027331 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.038360 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.000912 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. |