Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ronaldo (0) - 2 freq ronald (1) - 49 freq donaldo (1) - 1 freq ronaldh (1) - 1 freq donald (2) - 193 freq donalds (2) - 2 freq ronald's (2) - 3 freq arnaldo (2) - 2 freq roald (2) - 8 freq ronaldson (2) - 2 freq ronalt (2) - 32 freq inaldz (3) - 1 freq rognvald (3) - 6 freq rosal (3) - 1 freq donald's (3) - 17 freq ronas (3) - 3 freq €œronald (3) - 1 freq roaqd (3) - 1 freq €™aldo (3) - 7 freq donaldson (3) - 20 freq donal (3) - 7 freq rpnldf (3) - 1 freq onand (3) - 1 freq roads (3) - 105 freq road (3) - 1150 freq |
ronaldo (0) - 2 freq ronald (1) - 49 freq ronaldh (2) - 1 freq donaldo (2) - 1 freq arnaldo (2) - 2 freq roald (3) - 8 freq donald (3) - 193 freq ronalt (3) - 32 freq ronda (4) - 1 freq nald (4) - 1 freq ronged (4) - 1 freq ronaldson (4) - 2 freq ronald's (4) - 3 freq donalds (4) - 2 freq ronaldsay (4) - 3 freq arnold (4) - 6 freq rankled (5) - 1 freq rund (5) - 2 freq renault (5) - 2 freq ranged (5) - 1 freq rnnd (5) - 1 freq rend (5) - 2 freq rounded (5) - 9 freq reibald (5) - 1 freq loado (5) - 1 freq |
SoundEx code - R543 rummelt - 7 freq rammelt - 1 freq reinhold - 1 freq renault - 2 freq rummiled - 1 freq ronald - 49 freq ronald's - 3 freq rummult - 1 freq ronalt - 32 freq ronalt's - 4 freq rummled - 3 freq rummilt - 4 freq rummeled - 2 freq ronaldo - 2 freq ronaldsay - 3 freq renaults - 1 freq reynolds - 4 freq rummle-tummle - 1 freq rummelled - 3 freq rummlet - 1 freq rummlt - 1 freq €œronald - 1 freq ronaldh - 1 freq reynoldsiain - 1 freq ronaldcampbell - 1 freq ronaldson - 2 freq |
MetaPhone code - RNLT renault - 2 freq ronald - 49 freq ronalt - 32 freq ronaldo - 2 freq €œronald - 1 freq ronaldh - 1 freq |
RONALDO |
Time to execute Levenshtein function - 0.250331 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.398470 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.027719 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.037475 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.001073 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. |