| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undelivered (0) - 1 freq delivered (2) - 36 freq deliveren (3) - 1 freq undettered (3) - 1 freq deliverer (3) - 7 freq deliver (4) - 47 freq uncovered (4) - 2 freq unbeliever (4) - 2 freq underpeyed (4) - 1 freq deliveran (4) - 2 freq undecided (4) - 2 freq delivers (4) - 2 freq deliverit (4) - 4 freq deliveries (4) - 4 freq undeterred (4) - 7 freq unregistered (4) - 1 freq delivery (4) - 49 freq deliverin (4) - 15 freq unfettered (4) - 2 freq delivert (4) - 10 freq unleavened (4) - 1 freq underlined (4) - 2 freq lily-livered (5) - 1 freq unruddered (5) - 1 freq underweer (5) - 4 freq |
undelivered (0) - 1 freq delivered (3) - 36 freq deliverer (5) - 7 freq undettered (5) - 1 freq deliveren (5) - 1 freq delivery (6) - 49 freq deliveries (6) - 4 freq undeterred (6) - 7 freq endeavoured (6) - 2 freq deliverit (6) - 4 freq unleavened (6) - 1 freq delivert (6) - 10 freq deliverin (6) - 15 freq deliver (6) - 47 freq delivers (6) - 2 freq uncovered (6) - 2 freq unbeliever (6) - 2 freq deliveran (6) - 2 freq deleiverin (7) - 1 freq dovered (7) - 6 freq antlered (7) - 1 freq delivirt (7) - 1 freq deleiver (7) - 4 freq deleivert (7) - 6 freq davered (7) - 1 freq |
SoundEx code - U534 until - 495 freq untholeable - 1 freq undulatin - 1 freq untellt - 2 freq untul - 1 freq undulate - 1 freq undelivered - 1 freq untelt - 2 freq untholable - 1 freq unutilised - 1 freq unadulterate - 1 freq undilutit - 1 freq unadulterated - 3 freq untold - 1 freq |
MetaPhone code - UNTLFRT undelivered - 1 freq |
UNDELIVERED |
| Time to execute Levenshtein function - 0.262764 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.438951 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.028382 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.037672 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.000857 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. |