| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| renfra (0) - 10 freq renfrew (2) - 8 freq venera (2) - 2 freq enbra (2) - 2 freq renfra's (2) - 1 freq renga (2) - 2 freq ren (3) - 11 freq retard (3) - 2 freq verra (3) - 434 freq rental (3) - 9 freq dener (3) - 2 freq kenna (3) - 11 freq hendry (3) - 6 freq rana (3) - 1 freq rettea (3) - 1 freq general (3) - 200 freq centre (3) - 268 freq rora (3) - 2 freq andra (3) - 116 freq robfray (3) - 1 freq extra (3) - 88 freq retiral (3) - 5 freq remark (3) - 43 freq kentna (3) - 12 freq rea (3) - 1 freq |
renfra (0) - 10 freq renfrew (3) - 8 freq refer (4) - 37 freq robfray (4) - 1 freq gunfre (4) - 1 freq jnfr (4) - 1 freq render (4) - 8 freq rnr (4) - 1 freq re-fere (4) - 1 freq enfer (4) - 1 freq rendir (4) - 1 freq venera (4) - 2 freq enbra (4) - 2 freq renfra's (4) - 1 freq renga (4) - 2 freq reffel (5) - 2 freq belfry (5) - 1 freq fanfare (5) - 5 freq arena (5) - 41 freq effray (5) - 1 freq renew (5) - 7 freq winfa (5) - 1 freq rennet (5) - 1 freq reef (5) - 58 freq rented (5) - 4 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 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 reinforcin - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RNFR renfra - 10 freq renfrew - 8 freq |
RENFRA |
| Time to execute Levenshtein function - 0.193771 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.355314 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.033749 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.043998 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.000939 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. |