| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doxievee (0) - 1 freq oxiegene (3) - 1 freq boxieweel (3) - 1 freq dreven (4) - 1 freq deived (4) - 1 freq relieve (4) - 2 freq howivver (4) - 21 freq oniewey (4) - 52 freq scrieve (4) - 168 freq vievie (4) - 1 freq slieve (4) - 1 freq davee (4) - 1 freq oliver (4) - 10 freq motives (4) - 4 freq daiver (4) - 4 freq dorie (4) - 1 freq denee (4) - 1 freq doenae (4) - 1 freq derive (4) - 2 freq hooivver (4) - 51 freq oxides (4) - 1 freq oxide (4) - 1 freq teevee (4) - 1 freq deive (4) - 1 freq notiece (4) - 2 freq |
doxievee (0) - 1 freq drive (5) - 170 freq davee (5) - 1 freq dovey (5) - 3 freq derive (5) - 2 freq dive (5) - 44 freq dioxide (5) - 2 freq dovie (5) - 1 freq dreive (5) - 4 freq dixie (5) - 10 freq dayvee (5) - 1 freq deeve (5) - 5 freq dove (5) - 7 freq deive (5) - 1 freq daeve (5) - 1 freq dominie (6) - 66 freq diva (6) - 1 freq sieve (6) - 6 freq doited (6) - 2 freq boxies (6) - 4 freq thieve (6) - 3 freq dhrive (6) - 4 freq diver (6) - 5 freq davie (6) - 229 freq doe-eyed (6) - 1 freq |
SoundEx code - D210 disobey - 5 freq dickiebow - 1 freq day-joab - 1 freq deceive - 7 freq dough-baw - 1 freq doughbaw - 1 freq dug-up - 1 freq digby - 3 freq disavou - 1 freq dookie-up - 1 freq dug-shape - 2 freq dqgeyv - 1 freq dzf - 1 freq doxievee - 1 freq deejaypb - 3 freq dqb - 1 freq djgfyh - 1 freq dtaqzbu - 1 freq dyjvb - 1 freq dsp - 1 freq dickybeau - 1 freq dogpoo - 1 freq dyqpo - 1 freq dczhhb - 2 freq dcibw - 1 freq decaf - 1 freq dxpa - 1 freq |
MetaPhone code - TKSF doxievee - 1 freq txph - 1 freq |
DOXIEVEE |
| Time to execute Levenshtein function - 0.262098 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.443492 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.037922 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.046270 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.000960 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. |