| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rigmarole (0) - 3 freq rigmarie (2) - 2 freq rumpole (4) - 1 freq primrose (4) - 13 freq marple (4) - 2 freq mardle (4) - 1 freq figaro' (4) - 1 freq mermarble (4) - 1 freq bigmarkyb (4) - 2 freq marone (4) - 1 freq tightrope (4) - 2 freq carole (4) - 3 freq pigmobile (4) - 3 freq primarie (4) - 3 freq rigorous (4) - 1 freq improve (4) - 25 freq ragnarok (4) - 3 freq gargle (4) - 3 freq marble (4) - 21 freq dismantle (4) - 1 freq regale (4) - 2 freq cigale (4) - 1 freq primarily (4) - 2 freq rigbane (4) - 7 freq bigstyle (5) - 1 freq |
rigmarole (0) - 3 freq rigmarie (3) - 2 freq regale (6) - 2 freq regularly (6) - 17 freq pigmobile (6) - 3 freq rigorous (6) - 1 freq primarily (6) - 2 freq rogmull (6) - 1 freq regularlie (6) - 1 freq ragnarok (6) - 3 freq rumpole (6) - 1 freq rumle (7) - 1 freq gamble (7) - 13 freq arabcarol (7) - 2 freq regroup (7) - 1 freq gmail (7) - 1 freq loggarly (7) - 1 freq regiar (7) - 1 freq rigorously (7) - 1 freq orignal (7) - 1 freq rigger (7) - 2 freq reglar (7) - 39 freq rosemarkie (7) - 3 freq dagmar (7) - 1 freq rarely (7) - 43 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 - RKMRL rigmarole - 3 freq |
RIGMAROLE |
| Time to execute Levenshtein function - 0.240532 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.450593 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.036502 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.042497 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.000942 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. |