Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
rhiannonv (0) - 1 freq rhiannna (2) - 1 freq shannons (3) - 1 freq shannon (3) - 2 freq shannoch (4) - 1 freq €œcannon (4) - 1 freq rinnan (4) - 3 freq rinnin' (4) - 3 freq cannon (4) - 13 freq phantons (4) - 1 freq rannoch (4) - 9 freq reinnen (4) - 1 freq chanson (4) - 1 freq chignon (4) - 1 freq rinnin (4) - 330 freq thinning (4) - 1 freq sinnons (4) - 1 freq rannan (4) - 1 freq rhino (4) - 3 freq rinnen (4) - 4 freq annone (4) - 1 freq rhinns (4) - 3 freq hannin (4) - 3 freq hanlon (4) - 2 freq rinning (4) - 7 freq |
rhiannonv (0) - 1 freq rhiannna (3) - 1 freq shannon (5) - 2 freq shannons (5) - 1 freq rinnen (6) - 4 freq rannan (6) - 1 freq rhinns (6) - 3 freq thinning (6) - 1 freq thinnan (6) - 1 freq chinnin (6) - 1 freq thinnin (6) - 1 freq rinning (6) - 7 freq hannin (6) - 3 freq rinnin (6) - 330 freq rinnin' (6) - 3 freq rinnan (6) - 3 freq reinnen (6) - 1 freq runnin' (7) - 7 freq cannons (7) - 7 freq rheonjones (7) - 1 freq running (7) - 47 freq erinnin (7) - 1 freq runnen (7) - 3 freq hnnin (7) - 1 freq rennin (7) - 6 freq |
SoundEx code - R551 remembers - 10 freq remember - 187 freq remembert - 10 freq rememberin - 4 freq remembering - 6 freq remembered - 23 freq rememberins - 1 freq 'remember' - 2 freq remembrance - 14 freq remember'd - 1 freq romanoff - 1 freq remembir - 1 freq remembraunce - 4 freq €™remember - 1 freq rhiannonv - 1 freq ramember - 2 freq 'remembrance - 1 freq |
MetaPhone code - RHNNF rhiannonv - 1 freq |
RHIANNONV |
Time to execute Levenshtein function - 0.287174 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.633501 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.035641 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.051209 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.000948 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. |