| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| robohanrahan (0) - 1 freq brahan (6) - 3 freq robmarshall (6) - 6 freq roaran (6) - 4 freq robotars (6) - 1 freq ronniegraham (6) - 1 freq researchan (6) - 1 freq robinsonalan (6) - 1 freq shangshan (6) - 2 freq rhanratty (6) - 13 freq roondan (6) - 4 freq dollaghan (7) - 1 freq ooadaa (7) - 1 freq hahahaaha (7) - 1 freq johnnyabdn (7) - 5 freq boaren (7) - 1 freq lorihoulihan (7) - 1 freq chainchan (7) - 1 freq kilbarchan (7) - 6 freq moarnan (7) - 3 freq 'botanical (7) - 1 freq rooshian (7) - 1 freq romansch (7) - 4 freq roberston (7) - 1 freq loubanana (7) - 1 freq |
robohanrahan (0) - 1 freq rhanratty (9) - 13 freq brahan (9) - 3 freq ratherryan (10) - 1 freq bahrain (10) - 1 freq nearhan (10) - 28 freq rathfrilan (10) - 4 freq rainrainrain (10) - 1 freq reborn (10) - 7 freq richt-han (10) - 2 freq roberton (10) - 49 freq naarhan (10) - 17 freq bhrochan (10) - 1 freq hanchin (10) - 1 freq ahinhaan (10) - 1 freq branchin (10) - 3 freq chainchan (10) - 1 freq robinson (10) - 22 freq robinsonalan (10) - 1 freq robotars (10) - 1 freq roondan (10) - 4 freq ronniegraham (10) - 1 freq roaran (10) - 4 freq researchan (10) - 1 freq shangshan (10) - 2 freq |
SoundEx code - R156 rabin-rin-tha-hedge - 1 freq rabin-rin-the-hedge - 1 freq refinery - 1 freq rowwfvimru - 1 freq robmarshall - 6 freq robohanrahan - 1 freq |
MetaPhone code - RBHNRHN robohanrahan - 1 freq |
ROBOHANRAHAN |
| Time to execute Levenshtein function - 0.303687 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.495837 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.034353 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.041803 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.000897 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. |