| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dream-land (0) - 1 freq dreamland (1) - 1 freq dreaman (3) - 2 freq dream-child (4) - 1 freq hameland (4) - 7 freq raceland (4) - 1 freq dreamily (4) - 1 freq drawlan (4) - 1 freq sealand (4) - 1 freq dwam-an (4) - 1 freq draa-an (4) - 1 freq greenland (4) - 16 freq heartland (4) - 1 freq dreamin (4) - 38 freq fermland (4) - 1 freq tremblan (4) - 6 freq ireland (4) - 145 freq remand (4) - 2 freq dreaming (4) - 3 freq dem-an (4) - 1 freq grassland (4) - 3 freq dream-bairn (4) - 1 freq brediland (4) - 2 freq creamola (4) - 3 freq day-lang (4) - 1 freq |
dream-land (0) - 1 freq dreamland (2) - 1 freq fermland (6) - 1 freq dreaman (6) - 2 freq year-lang (7) - 3 freq dreamed (7) - 14 freq day-lang (7) - 1 freq brediland (7) - 2 freq dream-bairn (7) - 1 freq yreland (7) - 1 freq drumblade (7) - 1 freq demand (7) - 51 freq tree-lined (7) - 2 freq drumlins (7) - 5 freq ferlie-land (7) - 1 freq lamland (7) - 1 freq grassland (7) - 3 freq dreamin' (7) - 1 freq dreamless (7) - 1 freq drummond (7) - 6 freq raceland (7) - 1 freq dwam-an (7) - 1 freq greenland (7) - 16 freq drawlan (7) - 1 freq hameland (7) - 7 freq |
SoundEx code - D654 drumlie - 14 freq drumly - 3 freq dream-land - 1 freq darnley - 59 freq drumlins - 5 freq drumlithie - 1 freq darnley's - 15 freq doornail - 1 freq diurnal - 1 freq dreamless - 1 freq dreamily - 1 freq dreamland - 1 freq drumlanrig - 1 freq drneilkirk - 6 freq darrenmiller - 1 freq darrenlittle - 2 freq |
MetaPhone code - TRMLNT dream-land - 1 freq dreamland - 1 freq |
DREAM-LAND |
| Time to execute Levenshtein function - 0.518215 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 - 1.098919 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.094720 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.106573 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.000894 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. |