| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| details (0) - 70 freq retails (1) - 1 freq detailt (1) - 2 freq detail (1) - 42 freq deivils (2) - 1 freq derail (2) - 1 freq tails (2) - 53 freq petals (2) - 22 freq devals (2) - 1 freq decals (2) - 1 freq metals (2) - 5 freq emails (2) - 14 freq devauls (2) - 1 freq detailed (2) - 15 freq de'ils (2) - 2 freq nettils (2) - 1 freq devaill (2) - 1 freq deils (2) - 35 freq deevils (2) - 11 freq entails (2) - 1 freq retains (2) - 4 freq deals (2) - 18 freq retail (2) - 7 freq desairs (2) - 1 freq ettils (2) - 14 freq |
details (0) - 70 freq detailt (2) - 2 freq detail (2) - 42 freq retails (2) - 1 freq deevils (3) - 11 freq deils (3) - 35 freq de'ils (3) - 2 freq entails (3) - 1 freq devils (3) - 1 freq detailed (3) - 15 freq ettils (3) - 14 freq deals (3) - 18 freq dentals (3) - 1 freq decals (3) - 1 freq petals (3) - 22 freq tails (3) - 53 freq metals (3) - 5 freq devals (3) - 1 freq deivils (3) - 1 freq devauls (3) - 1 freq dalls (4) - 1 freq delays (4) - 1 freq staels (4) - 2 freq ideals (4) - 6 freq ditties (4) - 1 freq |
SoundEx code - D342 details - 70 freq dootless - 7 freq deathlike - 1 freq daithless - 2 freq deedless - 1 freq doddles - 2 freq doutless - 4 freq dawdles - 1 freq deidlike - 2 freq deidliest - 1 freq dedalus - 1 freq daedalus - 27 freq dedalusdenaries - 4 freq deadlock - 1 freq |
MetaPhone code - TTLS details - 70 freq dootless - 7 freq toddles - 1 freq tytal's - 1 freq titles - 13 freq title's - 1 freq deedless - 1 freq doddles - 2 freq doutless - 4 freq dawdles - 1 freq teitils - 2 freq teetles - 1 freq dedalus - 1 freq daedalus - 27 freq tiddles - 8 freq €œtiddles - 1 freq tattles - 3 freq |
DETAILS |
| Time to execute Levenshtein function - 0.175052 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.334608 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.027043 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.036882 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.000838 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. |