| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettercap (0) - 11 freq attercap (1) - 1 freq ettercaps (1) - 4 freq ettercap's (2) - 1 freq wattertap (3) - 1 freq efteraw (3) - 17 freq utteran (3) - 1 freq ethernan (3) - 5 freq letterman (3) - 1 freq etter (3) - 2 freq etterin (3) - 1 freq ethereal (3) - 2 freq buttercup (3) - 14 freq eternal (3) - 25 freq external (3) - 7 freq setterda (3) - 1 freq eftercast (3) - 5 freq etterick (3) - 1 freq setterday (3) - 114 freq veteran (4) - 4 freq attemp (4) - 5 freq internal (4) - 19 freq bettering (4) - 1 freq cateran (4) - 3 freq leeterar (4) - 14 freq |
ettercap (0) - 11 freq attercap (1) - 1 freq ettercaps (2) - 4 freq etterick (4) - 1 freq buttercup (4) - 14 freq ettercap's (4) - 1 freq etterin (5) - 1 freq attrac (5) - 1 freq etter (5) - 2 freq wattertap (5) - 1 freq utteran (5) - 1 freq ettrick (5) - 10 freq attrak (6) - 1 freq terp (6) - 2 freq huttercups (6) - 1 freq strap (6) - 10 freq uttert (6) - 1 freq thrap (6) - 2 freq atterie (6) - 4 freq thercot (6) - 2 freq otters (6) - 3 freq uttered (6) - 10 freq rydercup (6) - 1 freq tatrp (6) - 1 freq atter (6) - 1 freq |
SoundEx code - E362 ettercaps - 4 freq ettercap - 11 freq ettrick - 10 freq eaters - 2 freq eithers - 1 freq ettercap's - 1 freq edders - 1 freq etterick - 1 freq edeworkintherain - 1 freq e'doric - 1 freq |
MetaPhone code - ETRKP ettercap - 11 freq |
ETTERCAP |
| Time to execute Levenshtein function - 0.239929 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.349058 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.027565 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.036598 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.000816 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. |