| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| renfra (0) - 10 freq venera (2) - 2 freq enbra (2) - 2 freq renfra's (2) - 1 freq renfrew (2) - 8 freq renga (2) - 2 freq reir (3) - 1 freq rentit (3) - 6 freq mera (3) - 2 freq renn (3) - 9 freq lectra (3) - 7 freq tentna (3) - 2 freq central (3) - 130 freq retirt (3) - 1 freq remord (3) - 2 freq ievfua (3) - 1 freq endre (3) - 1 freq rnr (3) - 1 freq kenna (3) - 11 freq efr (3) - 1 freq redraw (3) - 2 freq rendirs (3) - 2 freq ezra (3) - 3 freq resorb (3) - 1 freq wenna (3) - 1 freq |
renfra (0) - 10 freq renfrew (3) - 8 freq rendir (4) - 1 freq render (4) - 8 freq rnr (4) - 1 freq refer (4) - 37 freq re-fere (4) - 1 freq enfer (4) - 1 freq jnfr (4) - 1 freq gunfre (4) - 1 freq renga (4) - 2 freq renfra's (4) - 1 freq robfray (4) - 1 freq venera (4) - 2 freq enbra (4) - 2 freq rennin (5) - 6 freq rent (5) - 48 freq bonfire (5) - 28 freq reif (5) - 2 freq rinder (5) - 1 freq infor (5) - 1 freq re-fit (5) - 1 freq effray (5) - 1 freq reinforce (5) - 6 freq rend (5) - 2 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 |
RENFRA |
| Time to execute Levenshtein function - 0.219552 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.351148 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.033384 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.041401 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.000895 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. |