| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rjeffrey (0) - 1 freq jeffrey (1) - 2 freq reffel (3) - 2 freq geofrey (3) - 1 freq reffled (3) - 2 freq effray (3) - 1 freq referee (3) - 15 freq geoffrey (3) - 14 freq renfrew (3) - 8 freq toffey (4) - 1 freq pfeffel (4) - 1 freq jeered (4) - 1 freq refereed (4) - 1 freq ruffles (4) - 1 freq referred (4) - 18 freq reefed (4) - 1 freq suffre (4) - 1 freq before' (4) - 1 freq effek (4) - 4 freq before (4) - 560 freq diffren (4) - 1 freq raffie (4) - 1 freq weffle (4) - 1 freq refarin (4) - 1 freq refers (4) - 27 freq |
rjeffrey (0) - 1 freq jeffrey (2) - 2 freq referee (5) - 15 freq effray (5) - 1 freq geoffrey (5) - 14 freq reffel (5) - 2 freq jeffco (6) - 1 freq raffie (6) - 1 freq reek-free (6) - 1 freq ruffle (6) - 5 freq robfray (6) - 1 freq heffer (6) - 2 freq re-fere (6) - 1 freq refinery (6) - 1 freq riffle (6) - 1 freq renfra (6) - 10 freq refer (6) - 37 freq jiffy (6) - 4 freq jeff (6) - 32 freq renfrew (6) - 8 freq reffled (6) - 2 freq geofrey (6) - 1 freq suffre (6) - 1 freq raffle (6) - 13 freq seffer (6) - 1 freq |
SoundEx code - R216 recovert - 10 freq recovered - 11 freq raspberry - 15 freq recoverin - 7 freq rockport - 1 freq recover - 7 freq receever's - 1 freq ricuvert - 1 freq reciprocated - 1 freq resprayed - 1 freq recovery - 13 freq rocafort - 1 freq roosbreakfast - 1 freq respiratour - 1 freq raspberries - 7 freq rashieburn - 1 freq recuivers - 1 freq receiver - 4 freq reciprocatit - 1 freq roxburgh - 1 freq recoverie - 1 freq respiratory - 1 freq reekiebraes - 1 freq reek-free - 1 freq reciprocation - 1 freq reciprocal - 2 freq reciprocate - 1 freq roxburghshire - 5 freq rockform - 1 freq reciproc - 1 freq rekiver - 1 freq rasper - 1 freq rosebrook - 12 freq rsprqm - 1 freq recovers - 1 freq recovering - 2 freq receever - 1 freq rashford - 2 freq rjeffrey - 1 freq rossforbes - 5 freq |
MetaPhone code - RJFR rjeffrey - 1 freq |
RJEFFREY |
| Time to execute Levenshtein function - 0.206421 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.340683 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.029286 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.037099 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.000893 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. |