| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalriada (0) - 8 freq alriddy (3) - 3 freq aalready (3) - 3 freq dallied (3) - 1 freq already (3) - 150 freq derrida (3) - 1 freq alana (4) - 12 freq rashida (4) - 2 freq darnae (4) - 5 freq loada (4) - 3 freq farawa (4) - 1 freq dahlias (4) - 2 freq allied (4) - 3 freq madrids (4) - 1 freq frieda (4) - 45 freq dinda (4) - 1 freq daursay (4) - 4 freq a'ready (4) - 11 freq haliday (4) - 1 freq daurnae (4) - 4 freq ariadne (4) - 4 freq hadrian (4) - 6 freq daurna (4) - 24 freq arid (4) - 4 freq halliday (4) - 1 freq |
dalriada (0) - 8 freq derrida (4) - 1 freq dallied (4) - 1 freq already (4) - 150 freq dalyrd (4) - 1 freq aalready (4) - 3 freq daared (5) - 2 freq railroad (5) - 1 freq decried (5) - 3 freq daled (5) - 5 freq daurd (5) - 1 freq alreidy (5) - 1 freq florida (5) - 4 freq dread (5) - 30 freq degrade (5) - 1 freq salaried (5) - 2 freq dared (5) - 11 freq dailiday (5) - 1 freq dalnoid (5) - 6 freq alreadee (5) - 1 freq alreedy (5) - 1 freq dalry (5) - 3 freq aalreydy (5) - 1 freq dorado (5) - 1 freq dried (5) - 71 freq |
SoundEx code - D463 deleerit - 8 freq dalriada - 8 freq deilward - 1 freq deleirit - 1 freq dalyrd - 1 freq |
MetaPhone code - TLRT deleerit - 8 freq dalriada - 8 freq tolerate - 7 freq tailored - 3 freq deleirit - 1 freq €˜tolerate - 1 freq ‘tolerateÂ’ - 1 freq dalyrd - 1 freq |
DALRIADA |
| Time to execute Levenshtein function - 0.202219 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.373237 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.028396 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.038145 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.000792 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. |