| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drrosebland (0) - 2 freq birseland (4) - 7 freq dreeblin (5) - 3 freq disneyland (5) - 11 freq yreland (5) - 1 freq croftland (5) - 1 freq greenland (5) - 16 freq ireland (5) - 145 freq rebrand (5) - 2 freq copeland (5) - 1 freq doublan (5) - 2 freq doggerland (5) - 2 freq roland (5) - 2 freq grassland (5) - 3 freq dream-land (5) - 1 freq sealand (5) - 1 freq bryceland (5) - 1 freq dreebled (5) - 2 freq discoverland (5) - 1 freq broadband (5) - 4 freq friesland (5) - 8 freq ferlieland (5) - 2 freq ferlie-land (5) - 1 freq rostand (5) - 1 freq mossland (5) - 1 freq |
drrosebland (0) - 2 freq birseland (7) - 7 freq dreebled (8) - 2 freq friesland (8) - 8 freq dream-land (8) - 1 freq scrubland (8) - 1 freq dreamland (8) - 1 freq grassland (8) - 3 freq irishland (8) - 1 freq disband (8) - 2 freq disneyland (8) - 11 freq dreeblin (8) - 3 freq yreland (9) - 1 freq raceland (9) - 1 freq gruneland (9) - 2 freq croftland (9) - 1 freq disabled (9) - 7 freq doublan (9) - 2 freq dribblin (9) - 5 freq mirrland (9) - 2 freq driblin (9) - 1 freq rosebed (9) - 1 freq dribbling (9) - 1 freq mossland (9) - 1 freq sealand (9) - 1 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRSBLNT drrosebland - 2 freq |
DRROSEBLAND |
| Time to execute Levenshtein function - 0.248344 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.444436 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.028013 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.037360 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.000854 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. |