| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreidfae (0) - 2 freq dreidfu (2) - 20 freq weidae (3) - 2 freq reidan (3) - 1 freq deidpan (3) - 1 freq dreid-na (3) - 1 freq dreid (3) - 51 freq dreiche (3) - 1 freq deid-a (3) - 1 freq 'dreidfu (3) - 1 freq reidware (3) - 1 freq freida (3) - 1 freq dredfu (3) - 1 freq meidae (3) - 4 freq fridae (3) - 1 freq dreidin (3) - 4 freq dreadfu (3) - 7 freq dredge (3) - 2 freq davidfe (3) - 6 freq dreids (3) - 2 freq reidie (3) - 2 freq deifie (3) - 4 freq dreidour (3) - 1 freq dreided (3) - 4 freq dreidsome (3) - 1 freq |
dreidfae (0) - 2 freq dreidfu (2) - 20 freq dreadfu (3) - 7 freq dredfu (3) - 1 freq dredge (4) - 2 freq dreidin (4) - 4 freq davidfe (4) - 6 freq dreidour (4) - 1 freq dreadful (4) - 5 freq dreidit (4) - 5 freq dreided (4) - 4 freq dreids (4) - 2 freq dreedan (4) - 1 freq dreid (4) - 51 freq 'dreidfu (4) - 1 freq dreadin (5) - 8 freq druidic (5) - 1 freq didmae (5) - 1 freq driffle (5) - 1 freq druids (5) - 5 freq daednae (5) - 3 freq freida (5) - 1 freq deirdre (5) - 13 freq dread (5) - 30 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.279913 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.403063 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.029543 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.038835 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.000794 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. |