| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tunnels (0) - 11 freq gunnels (1) - 4 freq hunnels (1) - 2 freq bunnels (1) - 1 freq funnels (1) - 4 freq tunnel (1) - 85 freq runnels (1) - 2 freq tonnels (1) - 1 freq tunnel's (1) - 1 freq vennels (2) - 12 freq tonnes (2) - 3 freq runners (2) - 9 freq caunnels (2) - 1 freq tunes (2) - 63 freq trunnel (2) - 1 freq munnell (2) - 2 freq wunners (2) - 21 freq bunnel (2) - 1 freq funnel (2) - 7 freq bunnils (2) - 1 freq gunnel (2) - 2 freq bennels (2) - 1 freq trunnelt (2) - 26 freq kennels (2) - 5 freq stunners (2) - 1 freq |
tunnels (0) - 11 freq tonnels (1) - 1 freq tunnel's (2) - 1 freq tunnel (2) - 85 freq runnels (2) - 2 freq funnels (2) - 4 freq hunnels (2) - 2 freq bunnels (2) - 1 freq gunnels (2) - 4 freq tanners (3) - 4 freq cannels (3) - 4 freq bennels (3) - 1 freq tenners (3) - 4 freq bunnils (3) - 1 freq tonnel (3) - 1 freq tonnes (3) - 3 freq vennels (3) - 12 freq sannels (3) - 1 freq kennels (3) - 5 freq caunnels (3) - 1 freq tinnies (4) - 6 freq haunnils (4) - 1 freq tonsils (4) - 2 freq caunnils (4) - 1 freq sannals (4) - 1 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 |
TUNNELS |
| Time to execute Levenshtein function - 0.354812 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.689252 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.028055 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.090017 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.000845 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. |