| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenant (1) - 14 freq tennent (1) - 2 freq pennant (1) - 1 freq tennants (1) - 1 freq remnant (2) - 7 freq pennan (2) - 2 freq tenenent (2) - 1 freq pennants (2) - 1 freq tenants (2) - 12 freq kennan (2) - 14 freq ternent (2) - 1 freq tendan (2) - 1 freq pendant (2) - 1 freq tennents (2) - 6 freq tenent (2) - 2 freq tennant's (2) - 1 freq ennit (3) - 2 freq kennen (3) - 2 freq leant (3) - 34 freq tannin (3) - 12 freq tensin (3) - 1 freq fennin (3) - 53 freq remnants (3) - 12 freq tin-an (3) - 1 freq teen't (3) - 1 freq |
tennent (1) - 2 freq tenenent (2) - 1 freq tennants (2) - 1 freq tenant (2) - 14 freq pennant (2) - 1 freq tennents (3) - 6 freq ternent (3) - 1 freq tenent (3) - 2 freq remnant (4) - 7 freq annint (4) - 1 freq tannin (4) - 12 freq tenement (4) - 21 freq tanning (4) - 3 freq tranent (4) - 28 freq tenants (4) - 12 freq tennant's (4) - 1 freq pennants (4) - 1 freq kennan (4) - 14 freq tendan (4) - 1 freq pendant (4) - 1 freq tinnin (4) - 1 freq pennan (4) - 2 freq kennin (5) - 297 freq fannan (5) - 1 freq kennit (5) - 1 freq |
SoundEx code - T553 tenant - 14 freq tennent's - 6 freq towmond - 12 freq teem-handit - 1 freq tomintoul - 1 freq tenants - 12 freq tammie-nid-nod - 1 freq tennent''s - 1 freq tennents - 6 freq tennants - 1 freq twa-month-aald - 1 freq tennant's - 1 freq tennent - 2 freq tenentis - 1 freq towmonds - 1 freq tonantzin - 1 freq tuim-wamit - 1 freq tuim-wamed - 1 freq tinints - 2 freq tenent - 2 freq tuim-haundit - 1 freq tonyandaiden - 1 freq tammhunter - 1 freq tonyhendrix - 1 freq themanutdway - 2 freq tennentslager - 1 freq themendozawoman - 1 freq |
MetaPhone code - TNNT tenant - 14 freq tennent - 2 freq tenent - 2 freq denend - 1 freq |
TENNANT |
| Time to execute Levenshtein function - 0.196858 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.355222 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.028894 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.037261 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.000862 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. |