| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreidfae (0) - 2 freq dreidfu (2) - 20 freq davidfe (3) - 6 freq dreive (3) - 4 freq driffle (3) - 1 freq dreidsome (3) - 1 freq didmae (3) - 1 freq dreidit (3) - 5 freq deidlie (3) - 7 freq dreidin (3) - 4 freq deid-a (3) - 1 freq deidpan (3) - 1 freq reidan (3) - 1 freq fridae (3) - 1 freq dreid (3) - 51 freq deifie (3) - 4 freq reidie (3) - 2 freq dreiche (3) - 1 freq freida (3) - 1 freq weidae (3) - 2 freq didnae (3) - 1693 freq dreids (3) - 2 freq dreadful (3) - 5 freq dreedan (3) - 1 freq meidae (3) - 4 freq |
dreidfae (0) - 2 freq dreidfu (2) - 20 freq dredfu (3) - 1 freq dreadfu (3) - 7 freq dreids (4) - 2 freq dreidour (4) - 1 freq dredge (4) - 2 freq dreid (4) - 51 freq dreidin (4) - 4 freq dreidit (4) - 5 freq 'dreidfu (4) - 1 freq davidfe (4) - 6 freq dreided (4) - 4 freq dreedan (4) - 1 freq dreadful (4) - 5 freq deirdre (5) - 13 freq dreeded (5) - 2 freq druidic (5) - 1 freq dredd (5) - 6 freq dreaded (5) - 5 freq dreed (5) - 13 freq dreef (5) - 4 freq dread (5) - 34 freq daednae (5) - 3 freq druid (5) - 2 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 |
DREIDFAE |
| Time to execute Levenshtein function - 0.220942 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.383519 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.028542 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.037212 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.000866 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. |