| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ragnarok (0) - 3 freq ragnar (2) - 18 freq ragnar's (2) - 3 freq lanark (3) - 29 freq ragnails (3) - 1 freq rayner (4) - 1 freq androo (4) - 1 freq rogart (4) - 1 freq raynal (4) - 1 freq haggard (4) - 1 freq dagmar's (4) - 1 freq ramrod (4) - 1 freq tagalog (4) - 2 freq kangaroo (4) - 2 freq garnard (4) - 1 freq carpark (4) - 5 freq ransack (4) - 1 freq taggart (4) - 4 freq pandrop (4) - 5 freq rampart (4) - 2 freq ragoran (4) - 6 freq rag-oot (4) - 1 freq cantrol (4) - 1 freq anar (4) - 1 freq waark (4) - 110 freq |
ragnarok (0) - 3 freq ragnar (3) - 18 freq ragnar's (4) - 3 freq ragnails (5) - 1 freq lanark (5) - 29 freq ragan (6) - 1 freq rigmarie (6) - 2 freq rank (6) - 43 freq lanrik (6) - 2 freq regiar (6) - 1 freq raiglar (6) - 15 freq raigiar (6) - 1 freq regard (6) - 16 freq knark (6) - 1 freq raynor (6) - 1 freq wagner (6) - 1 freq remark (6) - 44 freq ragwort (6) - 1 freq gnar (6) - 1 freq nark (6) - 1 freq ragoran (6) - 6 freq reynard (6) - 3 freq oarwark (6) - 1 freq anorak (6) - 11 freq rogart (6) - 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 - RKNRK ragnarok - 3 freq |
RAGNAROK |
| Time to execute Levenshtein function - 0.250633 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.390230 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.028472 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.044524 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.001141 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. |