| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rogjnfx (0) - 1 freq romance (4) - 37 freq rogues' (4) - 1 freq roman (4) - 76 freq rkgbsx (4) - 1 freq rodney (4) - 1 freq ronnie (4) - 223 freq rou-fu (4) - 1 freq raging (4) - 3 freq regan (4) - 1 freq ragnar (4) - 18 freq okjjx (4) - 1 freq jnfr (4) - 1 freq rounds (4) - 8 freq wogan (4) - 1 freq ronas (4) - 3 freq roonds (4) - 8 freq ogyof (4) - 1 freq login (4) - 2 freq yjnx (4) - 1 freq rowan (4) - 18 freq robina (4) - 1 freq rouen (4) - 2 freq robin (4) - 196 freq roblox (4) - 1 freq |
rogjnfx (0) - 1 freq rgejjjfx (6) - 1 freq rging (7) - 1 freq regent (7) - 6 freq rougin (7) - 1 freq uorfx (7) - 1 freq romanoff (7) - 1 freq ragan (7) - 1 freq rgx (7) - 1 freq rxjfb (7) - 1 freq rijn (7) - 1 freq gfnf (7) - 1 freq ragin' (7) - 3 freq regina (7) - 1 freq rgnl (7) - 1 freq rtnf (7) - 1 freq rbnf (7) - 1 freq rlvyrfx (7) - 1 freq yjnx (7) - 1 freq ragin (7) - 65 freq raging (7) - 3 freq jnfr (7) - 1 freq ragnar (7) - 18 freq regan (7) - 1 freq ragein (8) - 1 freq |
SoundEx code - R251 resumption - 1 freq reassembled - 1 freq resembles - 8 freq rognvald - 6 freq rosin-fite - 1 freq reasonable - 20 freq resembled - 5 freq resemble - 3 freq resemblin - 6 freq resemblance - 6 freq resemblence - 1 freq reasonably - 5 freq raisonable - 1 freq resembling - 1 freq raesonable-sized - 1 freq recompense - 3 freq resemblances - 2 freq raisonablie - 1 freq resounable - 1 freq raesonable - 1 freq recumbent - 2 freq re-convenes - 1 freq reconvened - 1 freq reassemblet - 1 freq reassemble - 1 freq reasonablie - 1 freq recompance - 2 freq recompence - 2 freq €˜recompance - 1 freq €˜recompence - 1 freq recompensed - 1 freq rzmpm - 1 freq rossmable - 1 freq rogjnfx - 1 freq |
MetaPhone code - RKJNFKS rogjnfx - 1 freq |
ROGJNFX |
| Time to execute Levenshtein function - 0.199691 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.405304 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.029245 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.070630 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.000928 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. |