| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| devices (0) - 8 freq device (1) - 23 freq sevices (1) - 1 freq crevices (2) - 2 freq devils (2) - 1 freq defies (2) - 2 freq derives (2) - 10 freq desires (2) - 10 freq divines (2) - 1 freq defines (2) - 7 freq davies (2) - 13 freq levies (2) - 1 freq devide (2) - 1 freq depicts (2) - 2 freq vices (2) - 12 freq decides (2) - 27 freq devise (2) - 2 freq devine (2) - 3 freq deives (2) - 1 freq evites (2) - 1 freq devined (2) - 1 freq divides (2) - 4 freq devised (2) - 1 freq denies (2) - 12 freq advices (2) - 1 freq |
devices (0) - 8 freq advices (2) - 1 freq sevices (2) - 1 freq device (2) - 23 freq davies (3) - 13 freq vices (3) - 12 freq divines (3) - 1 freq deives (3) - 1 freq divides (3) - 4 freq devious (3) - 4 freq devise (3) - 2 freq devils (3) - 1 freq devals (4) - 1 freq daves (4) - 2 freq deivils (4) - 1 freq davis (4) - 7 freq divits (4) - 1 freq dances (4) - 43 freq dunces (4) - 5 freq voices (4) - 113 freq devotees (4) - 3 freq dorics (4) - 2 freq doves (4) - 2 freq advice (4) - 137 freq dics (4) - 1 freq |
SoundEx code - D122 devices - 8 freq deep-couch - 1 freq deep-seasoned - 1 freq debshoes - 5 freq debsshoes - 1 freq dvigwjk - 1 freq |
MetaPhone code - TFSS devices - 8 freq |
DEVICES |
| Time to execute Levenshtein function - 0.239912 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.363444 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.028166 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.039575 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.000974 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. |