| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenants (0) - 12 freq tenant (1) - 14 freq tennants (1) - 1 freq tenancy (2) - 12 freq tennant's (2) - 1 freq tinints (2) - 2 freq tenon's (2) - 1 freq remnants (2) - 11 freq tennents (2) - 5 freq tenets (2) - 1 freq tents (2) - 22 freq tetanus (2) - 1 freq bejants (2) - 2 freq tenent (2) - 2 freq tennis (2) - 23 freq tenentis (2) - 1 freq tyrants (2) - 2 freq enfants (2) - 1 freq pennants (2) - 1 freq teats (2) - 1 freq demands (3) - 21 freq tears (3) - 305 freq bejant (3) - 4 freq transs (3) - 2 freq heats (3) - 2 freq |
tenants (0) - 12 freq tinints (2) - 2 freq tenentis (2) - 1 freq tennants (2) - 1 freq tenant (2) - 14 freq tents (3) - 22 freq tenent (3) - 2 freq tennis (3) - 23 freq tyrants (3) - 2 freq tenets (3) - 1 freq tennents (3) - 5 freq tenon's (3) - 1 freq taunts (4) - 2 freq tenements (4) - 19 freq tonnes (4) - 3 freq minents (4) - 1 freq tints (4) - 3 freq taints (4) - 1 freq talents (4) - 13 freq tenners (4) - 4 freq tennet's (4) - 1 freq bejants (4) - 2 freq enfants (4) - 1 freq teats (4) - 1 freq remnants (4) - 11 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 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 tennents - 5 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 - TNNTS tennent's - 6 freq tenants - 12 freq tennent''s - 1 freq tennants - 1 freq doon-an-oots - 1 freq tennant's - 1 freq tenentis - 1 freq tennents - 5 freq tinints - 2 freq |
TENANTS |
| Time to execute Levenshtein function - 0.294443 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.590789 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.059623 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.037094 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.000783 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. |