| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreidfu (0) - 20 freq 'dreidfu (1) - 1 freq dreadfu (1) - 7 freq dredfu (1) - 1 freq dreided (2) - 4 freq dreidfae (2) - 2 freq dreids (2) - 2 freq dreidit (2) - 5 freq dreidin (2) - 4 freq dreadful (2) - 5 freq dreidour (2) - 1 freq dreid (2) - 51 freq leidfu (2) - 1 freq dreiver (3) - 1 freq reids (3) - 3 freq reidy (3) - 1 freq weirdfu (3) - 1 freq dreid-na (3) - 1 freq reid's (3) - 5 freq dreink (3) - 2 freq reid (3) - 394 freq druid (3) - 2 freq treids (3) - 1 freq dreef (3) - 4 freq preif (3) - 1 freq |
dreidfu (0) - 20 freq dredfu (1) - 1 freq dreadfu (1) - 7 freq dreidfae (2) - 2 freq 'dreidfu (2) - 1 freq dreidour (3) - 1 freq dreid (3) - 51 freq dreidin (3) - 4 freq dreadful (3) - 5 freq dreided (3) - 4 freq dreids (3) - 2 freq dreidit (3) - 5 freq dreeded (4) - 2 freq dredd (4) - 6 freq dreedan (4) - 1 freq dreed (4) - 13 freq dreadin (4) - 8 freq druidic (4) - 1 freq droid (4) - 1 freq davidfe (4) - 6 freq dredge (4) - 2 freq dreadit (4) - 1 freq dread (4) - 30 freq druids (4) - 5 freq dreaded (4) - 4 freq |
SoundEx code - D631 dreadfu - 7 freq dreidfu - 20 freq dartboord - 1 freq dried-up - 2 freq dirtyfair - 1 freq 'dreidfu - 1 freq dartboard - 1 freq dreidfae - 2 freq dreadfully - 2 freq dreadful - 5 freq derthfu - 1 freq dare-deevils - 1 freq dirthope - 1 freq dredfu - 1 freq |
MetaPhone code - TRTF dreadfu - 7 freq dreidfu - 20 freq 'dreidfu - 1 freq dreidfae - 2 freq tartuffe - 15 freq dredfu - 1 freq |
DREIDFU |
| Time to execute Levenshtein function - 0.203491 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.377255 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.042289 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.039995 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.000781 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. |