| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yoruba (0) - 1 freq korba (2) - 1 freq trua (3) - 1 freq york (3) - 25 freq ora (3) - 1 freq yerb (3) - 1 freq rora (3) - 2 freq fora (3) - 3 freq youz (3) - 1 freq horus (3) - 1 freq hoofba (3) - 1 freq you (3) - 1 freq sorun (3) - 1 freq your' (3) - 1 freq grub (3) - 39 freq jojoba (3) - 1 freq portia (3) - 2 freq footba (3) - 2 freq grubs (3) - 2 freq boru's (3) - 1 freq dyoub (3) - 1 freq you'r (3) - 13 freq yor (3) - 4 freq norma (3) - 2 freq yerbs (3) - 2 freq |
yoruba (0) - 1 freq rub (3) - 51 freq rba (3) - 1 freq ruby (3) - 8 freq yerb (3) - 1 freq orb (3) - 2 freq korba (3) - 1 freq rbi (4) - 1 freq 'ruby (4) - 1 freq rab (4) - 172 freq yitba (4) - 1 freq orra (4) - 172 freq rua (4) - 3 freq orca (4) - 7 freq robe (4) - 5 freq forbae (4) - 1 freq orta (4) - 1 freq forby (4) - 497 freq oora (4) - 1 freq oorbye (4) - 1 freq arab (4) - 4 freq rubb (4) - 1 freq gorb (4) - 1 freq rib (4) - 8 freq tuba (4) - 1 freq |
SoundEx code - Y610 yerb - 1 freq yirp - 1 freq yrivvi - 1 freq yoruba - 1 freq yyrof - 1 freq |
MetaPhone code - YRB yerb - 1 freq yoruba - 1 freq |
YORUBA |
| Time to execute Levenshtein function - 0.177887 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.322477 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.027820 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.037241 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.000886 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. |