| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rtnf (0) - 1 freq rbnf (1) - 1 freq tne (2) - 2 freq ren (2) - 11 freq yonf (2) - 1 freq rutf (2) - 1 freq rona (2) - 3 freq rüf (2) - 7 freq etf (2) - 1 freq ptyf (2) - 1 freq rmf (2) - 1 freq ttkf (2) - 1 freq hanf (2) - 2 freq røf (2) - 2 freq röf (2) - 15 freq rted (2) - 1 freq rgnl (2) - 1 freq itn (2) - 2 freq rn (2) - 7 freq raf (2) - 7 freq ryn (2) - 2 freq rtin (2) - 1 freq tn (2) - 8 freq rtÉ (2) - 1 freq nknf (2) - 1 freq |
rtnf (0) - 1 freq rbnf (2) - 1 freq rtin (3) - 1 freq rutf (3) - 1 freq wtf (4) - 14 freq banf (4) - 1 freq rt (4) - 44 freq rone (4) - 2 freq rand (4) - 2 freq rank (4) - 42 freq rund (4) - 2 freq tf (4) - 9 freq rend (4) - 2 freq rtt (4) - 1 freq tng (4) - 1 freq rine (4) - 1 freq raef (4) - 2 freq riff (4) - 1 freq rolf (4) - 1 freq rte (4) - 2 freq dtn (4) - 1 freq conf (4) - 1 freq ripf (4) - 1 freq rtnsw (4) - 1 freq tbf (4) - 3 freq |
SoundEx code - R351 redemption - 4 freq reddin-up - 1 freq roddenberrie - 12 freq roadmap - 2 freq rtnf - 1 freq |
MetaPhone code - RTNF rtnf - 1 freq |
RTNF |
| Time to execute Levenshtein function - 0.194176 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.368268 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.027606 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.038046 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.001022 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. |