| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rcsneartshub (0) - 1 freq near-shut (5) - 2 freq researchit (6) - 1 freq mcarthur (6) - 11 freq unearthly (6) - 1 freq rinners-up (6) - 4 freq research' (6) - 1 freq unearthed (6) - 7 freq researched (6) - 2 freq seasub (6) - 1 freq research (6) - 166 freq researchin (6) - 2 freq researches (6) - 1 freq researcher (6) - 3 freq researchan (6) - 1 freq beneath (7) - 35 freq earthen (7) - 2 freq snatched (7) - 9 freq shears (7) - 11 freq snashed (7) - 11 freq snares (7) - 4 freq refreshes (7) - 1 freq drunkarts (7) - 1 freq neethur (7) - 2 freq sneists (7) - 1 freq |
rcsneartshub (0) - 1 freq near-shut (10) - 2 freq snorts (11) - 5 freq researchan (11) - 1 freq cairtshed (11) - 2 freq snurts (11) - 1 freq coortship (11) - 1 freq smartish (11) - 2 freq rcstweets (11) - 1 freq researches (11) - 1 freq cornershop (11) - 2 freq researcher (11) - 3 freq rinners-up (11) - 4 freq research' (11) - 1 freq unearthly (11) - 1 freq mcarthur (11) - 11 freq researchit (11) - 1 freq researchin (11) - 2 freq unearthed (11) - 7 freq research (11) - 166 freq researched (11) - 2 freq courtship (11) - 1 freq stannarts- (12) - 1 freq sneert (12) - 2 freq rersearch (12) - 1 freq |
SoundEx code - R256 ragnar - 18 freq ragnar's - 3 freq ragnarok - 3 freq raisonneur - 1 freq russamyre - 1 freq rigmarole - 3 freq reckoners - 1 freq rash-ma-reishilt - 1 freq rockin-horse - 1 freq regeneration - 3 freq regenerate - 1 freq rosemarkie - 3 freq rushmore - 2 freq rigmarie - 2 freq rosiemoore - 1 freq rsmorrow - 1 freq rcsneartshub - 1 freq rocknroll - 1 freq |
MetaPhone code - RKSNRTXB rcsneartshub - 1 freq |
RCSNEARTSHUB |
| Time to execute Levenshtein function - 0.285782 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.474258 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.028356 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.037193 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.000879 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. |