| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeatan (0) - 3 freq repeatin (1) - 24 freq repeatit (2) - 52 freq repeatic (2) - 1 freq repeatet (2) - 6 freq repeatin' (2) - 1 freq reheatin (2) - 1 freq repentin (2) - 1 freq repeated (2) - 32 freq repeating (2) - 2 freq repentant (2) - 3 freq repeats (2) - 11 freq repeat (2) - 80 freq resistan (3) - 1 freq reekan (3) - 1 freq reversan (3) - 1 freq repete (3) - 1 freq reelan (3) - 3 freq rejectin (3) - 4 freq reevlan (3) - 2 freq respectin (3) - 4 freq bemeanan (3) - 1 freq repented (3) - 1 freq repetit (3) - 1 freq sereaman (3) - 1 freq |
repeatan (0) - 3 freq repeatin (1) - 24 freq repeating (3) - 2 freq repeats (3) - 11 freq repeat (3) - 80 freq repentin (3) - 1 freq repeated (3) - 32 freq repeatic (3) - 1 freq repeatit (3) - 52 freq reheatin (3) - 1 freq repeatet (3) - 6 freq repeatin' (3) - 1 freq repetit (4) - 1 freq reportin (4) - 15 freq restan (4) - 4 freq reestin (4) - 1 freq relatin (4) - 9 freq repentant (4) - 3 freq repete (4) - 1 freq replayin (4) - 1 freq radiatin (5) - 3 freq ratin (5) - 1 freq ripen (5) - 8 freq recitin (5) - 7 freq poatin (5) - 1 freq |
SoundEx code - R135 repeatin - 24 freq riftin - 6 freq repeatin' - 1 freq repeatan - 3 freq rubbitin - 1 freq rabbitin - 2 freq repeating - 2 freq |
MetaPhone code - RPTN repeatin - 24 freq repeatin' - 1 freq repeatan - 3 freq |
REPEATAN |
| Time to execute Levenshtein function - 0.797771 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 - 1.114135 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.087891 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.098991 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.000930 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. |