| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeats (0) - 10 freq repents (1) - 2 freq repeat (1) - 77 freq peats (2) - 49 freq repeatit (2) - 52 freq repeated (2) - 32 freq reports (2) - 41 freq repent (2) - 17 freq repeatan (2) - 3 freq reets (2) - 16 freq repeatic (2) - 1 freq reveals (2) - 10 freq speats (2) - 1 freq repete (2) - 1 freq repas (2) - 1 freq replays (2) - 1 freq repints (2) - 3 freq relents (2) - 3 freq repeatin (2) - 24 freq repeatet (2) - 6 freq rejects (2) - 1 freq respects (2) - 8 freq resets (2) - 1 freq repint (3) - 3 freq recreate (3) - 1 freq |
repeats (0) - 10 freq repeat (2) - 77 freq repents (2) - 2 freq repas (3) - 1 freq repete (3) - 1 freq replays (3) - 1 freq repeatet (3) - 6 freq speats (3) - 1 freq repeatin (3) - 24 freq repints (3) - 3 freq resets (3) - 1 freq reports (3) - 41 freq repeatit (3) - 52 freq peats (3) - 49 freq repeatan (3) - 3 freq repeatic (3) - 1 freq reets (3) - 16 freq repeated (3) - 32 freq poats (4) - 2 freq repetit (4) - 1 freq repute (4) - 12 freq reists (4) - 1 freq spats (4) - 3 freq reapers (4) - 2 freq rivets (4) - 1 freq |
SoundEx code - R132 rabbits - 29 freq rubbits - 14 freq rabbit's - 31 freq rafts - 3 freq rabbit-caught-in-a-set-aeheidlights - 1 freq repeatic - 1 freq rabbit's- - 2 freq repeats - 10 freq rifts - 6 freq rubbits' - 1 freq robots - 4 freq 'rabbit's - 3 freq robotic - 3 freq rapet's - 1 freq rubbit's - 2 freq robotik - 1 freq raifts - 1 freq rivets - 1 freq rapids - 1 freq rabdickson - 1 freq rbtkgsfa - 1 freq rpdzfctnuw - 1 freq |
MetaPhone code - RPTS repeats - 10 freq rapet's - 1 freq rapids - 1 freq |
REPEATS |
| Time to execute Levenshtein function - 0.239191 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.401166 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.028778 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.043211 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.000904 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. |