| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reynolds (0) - 4 freq reynard (3) - 3 freq responds (3) - 6 freq re-told (3) - 1 freq redpolls (3) - 1 freq revolts (3) - 1 freq records (3) - 34 freq keyholes (3) - 2 freq reynard's (3) - 1 freq reinhold (3) - 1 freq reyns (3) - 2 freq redds (4) - 3 freq reds (4) - 5 freq kennels (4) - 5 freq scolds (4) - 2 freq record' (4) - 1 freq tentles (4) - 2 freq rescours (4) - 3 freq yields (4) - 3 freq synod (4) - 1 freq meynd (4) - 1 freq keyboords (4) - 1 freq realms (4) - 6 freq rpnldf (4) - 1 freq pends (4) - 2 freq |
reynolds (0) - 4 freq renaults (5) - 1 freq arnold (5) - 6 freq roonds (5) - 8 freq rinds (5) - 1 freq ronaldo (5) - 2 freq reynoldsiain (5) - 1 freq ronald (5) - 49 freq reyns (5) - 2 freq rounds (5) - 9 freq ronaldh (5) - 1 freq reinhold (5) - 1 freq revolts (5) - 1 freq records (5) - 34 freq ronald's (5) - 3 freq ronaldsay (5) - 3 freq donalds (5) - 2 freq reynard's (5) - 1 freq reynard (5) - 3 freq mends (6) - 3 freq kynds (6) - 5 freq helds (6) - 1 freq reengers (6) - 2 freq rebounds (6) - 1 freq reveals (6) - 10 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 - RNLTS ronald's - 3 freq ronalt's - 4 freq ronaldsay - 3 freq renaults - 1 freq reynolds - 4 freq |
REYNOLDS |
| Time to execute Levenshtein function - 0.264555 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.445412 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.036590 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.044174 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.000813 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. |