| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| robson (0) - 14 freq rowson (1) - 2 freq dobson (1) - 4 freq robeson (1) - 1 freq rollon (2) - 1 freq roon (2) - 1581 freq reason (2) - 315 freq bob-on (2) - 1 freq roblox (2) - 1 freq raison (2) - 51 freq robot (2) - 6 freq raeson (2) - 28 freq robin (2) - 196 freq robbin (2) - 5 freq ribbon (2) - 21 freq rooon (2) - 1 freq robo (2) - 1 freq ritson (2) - 1 freq rayson (2) - 1 freq robinson (2) - 22 freq boson (2) - 1 freq rousin (2) - 5 freq robson's (2) - 1 freq poison (2) - 28 freq robbo (2) - 1 freq |
robson (0) - 14 freq robeson (1) - 1 freq dobson (2) - 4 freq rowson (2) - 2 freq ritson (3) - 1 freq ribbon (3) - 21 freq robbin (3) - 5 freq rayson (3) - 1 freq gibson (3) - 21 freq robin (3) - 196 freq rousin (3) - 5 freq boson (3) - 1 freq robinson (3) - 22 freq raison (3) - 51 freq reason (3) - 315 freq raeson (3) - 28 freq ibsen (4) - 2 freq ruisin (4) - 2 freq rubs (4) - 9 freq ruisan (4) - 1 freq erosion (4) - 6 freq robust (4) - 10 freq ribbin (4) - 2 freq reesen (4) - 3 freq resin (4) - 6 freq |
SoundEx code - R125 revisin - 5 freq refusin - 16 freq rubicon - 3 freq revision - 9 freq robson - 14 freq rebiggin - 4 freq revisionist - 1 freq reveisioun - 1 freq robeson - 1 freq refusing - 5 freq ravishment - 1 freq €˜ravishin - 1 freq reveesions - 1 freq robson's - 1 freq robbycameron - 3 freq robgmacfarlane - 6 freq rufusmufasa - 1 freq rovcmuaxfs - 1 freq |
MetaPhone code - RBSN robson - 14 freq robeson - 1 freq |
ROBSON |
| Time to execute Levenshtein function - 0.178357 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.374796 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.028292 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.051599 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.000752 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. |