| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| renfrew (0) - 8 freq renfra (2) - 10 freq redrew (2) - 1 freq renew (2) - 7 freq genres (3) - 13 freq beshrew (3) - 1 freq enew (3) - 2 freq repares (3) - 1 freq rerek (3) - 1 freq rented (3) - 5 freq tenures (3) - 1 freq retire (3) - 11 freq andrew (3) - 76 freq redraw (3) - 2 freq renyie (3) - 1 freq gunfre (3) - 1 freq rewire (3) - 2 freq renfra's (3) - 1 freq jondrew (3) - 2 freq rendered (3) - 5 freq regret (3) - 50 freq centre (3) - 275 freq reffled (3) - 2 freq endre (3) - 1 freq reflek (3) - 3 freq |
renfrew (0) - 8 freq renfra (3) - 10 freq renew (4) - 7 freq redrew (4) - 1 freq unfree (5) - 1 freq refer (5) - 37 freq jondrew (5) - 2 freq enfer (5) - 1 freq rendered (5) - 5 freq referee (5) - 15 freq re-fere (5) - 1 freq render (5) - 8 freq aandrew (5) - 5 freq 'andrew (5) - 3 freq renfra's (5) - 1 freq renfield (5) - 2 freq rentier (5) - 1 freq reinforce (5) - 6 freq redraw (5) - 2 freq andrew (5) - 76 freq gunfre (5) - 1 freq referees (6) - 2 freq unfreed (6) - 1 freq unbraw (6) - 2 freq unfreen (6) - 1 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 freq reinforcin - 2 freq reimbursed - 1 freq rembrandt - 4 freq rembrancer - 1 freq renfra - 10 freq renfrew - 8 freq renfrewshire - 6 freq renfra's - 1 freq remover - 3 freq room-fresh' - 1 freq reinforcement - 2 freq ramversit - 1 freq ramparts - 2 freq reinforced - 1 freq reinforces - 2 freq remberance - 1 freq ranforced - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RNFR renfra - 10 freq renfrew - 8 freq |
RENFREW |
| Time to execute Levenshtein function - 0.185510 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.343191 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.027887 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.037889 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.000871 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. |