Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tennents (0) - 5 freq tennent's (1) - 6 freq tennent (1) - 2 freq pennents (1) - 1 freq tennants (1) - 1 freq tennant's (2) - 1 freq ternent (2) - 1 freq tenent (2) - 2 freq tenenent (2) - 1 freq tenets (2) - 1 freq tennet's (2) - 1 freq tenants (2) - 12 freq pennants (2) - 1 freq tennent''s (2) - 1 freq tenner's (2) - 1 freq tenentis (2) - 1 freq tenements (2) - 19 freq tenners (2) - 4 freq tenner (3) - 25 freq teenas (3) - 1 freq tenon's (3) - 1 freq peyments (3) - 5 freq kenneth (3) - 16 freq stenness (3) - 4 freq kennings (3) - 1 freq |
tennents (0) - 5 freq tennants (1) - 1 freq tennent (2) - 2 freq pennents (2) - 1 freq tennent's (2) - 6 freq tenants (3) - 12 freq tenements (3) - 19 freq pennants (3) - 1 freq tenentis (3) - 1 freq tennant's (3) - 1 freq tenenent (3) - 1 freq tenners (4) - 4 freq tinints (4) - 2 freq tenner's (4) - 1 freq tenent (4) - 2 freq ternent (4) - 1 freq tenets (4) - 1 freq tennent''s (4) - 1 freq tennet's (4) - 1 freq tonnes (5) - 3 freq connects (5) - 4 freq tenant (5) - 14 freq tonnels (5) - 1 freq tunnels (5) - 11 freq talents (5) - 13 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 |
TENNENTS |
Time to execute Levenshtein function - 0.219241 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.363134 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.027044 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.038158 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.000832 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. |