Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tonnels (0) - 1 freq tonnes (1) - 3 freq tunnels (1) - 11 freq tonnel (1) - 1 freq tornes (2) - 26 freq donne's (2) - 1 freq gunnels (2) - 4 freq sannels (2) - 1 freq kennels (2) - 5 freq conneks (2) - 2 freq wonners (2) - 1 freq donnell (2) - 1 freq torness (2) - 2 freq runnels (2) - 2 freq funnels (2) - 4 freq tossels (2) - 1 freq cannels (2) - 4 freq tonner (2) - 1 freq tenners (2) - 4 freq bonnets (2) - 5 freq bunnels (2) - 1 freq hunnels (2) - 2 freq bennels (2) - 1 freq tunnel's (2) - 1 freq sonnets (2) - 8 freq |
tonnels (0) - 1 freq tunnels (1) - 11 freq tonnes (2) - 3 freq tonnel (2) - 1 freq runnels (3) - 2 freq funnels (3) - 4 freq tunnel (3) - 85 freq bunnels (3) - 1 freq tenners (3) - 4 freq cannels (3) - 4 freq tanners (3) - 4 freq hunnels (3) - 2 freq tonsils (3) - 2 freq vennels (3) - 12 freq gunnels (3) - 4 freq sannels (3) - 1 freq tunnel's (3) - 1 freq kennels (3) - 5 freq bennels (3) - 1 freq tinnies (4) - 6 freq tooels (4) - 3 freq rinnals (4) - 1 freq connolys (4) - 1 freq toonmils (4) - 1 freq tennis (4) - 23 freq |
SoundEx code - T542 tunnels - 11 freq tuneless - 2 freq timeliest - 1 freq timeless - 5 freq tummles - 2 freq taenails - 2 freq taen-like - 3 freq tunnel's - 1 freq then-always - 1 freq teenless - 1 freq toonmils - 1 freq taen-lik - 1 freq tonnels - 1 freq |
MetaPhone code - TNLS tunnels - 11 freq daniel's - 17 freq tuneless - 2 freq daniels - 1 freq taenails - 2 freq tunnel's - 1 freq dinnles - 1 freq dinless - 1 freq teenless - 1 freq tonnels - 1 freq |
TONNELS |
Time to execute Levenshtein function - 0.187142 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.325647 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.027188 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.036974 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.000802 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. |