| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeated (0) - 32 freq repeatet (1) - 6 freq repealed (1) - 1 freq repented (1) - 1 freq reverted (2) - 1 freq respected (2) - 11 freq released (2) - 31 freq revealed (2) - 13 freq repeyed (2) - 2 freq repeatic (2) - 1 freq repete (2) - 1 freq repeatit (2) - 52 freq reported (2) - 15 freq rejected (2) - 7 freq defeated (2) - 7 freq reeted (2) - 4 freq repeatedly (2) - 4 freq repeatan (2) - 3 freq replaced (2) - 52 freq relented (2) - 4 freq repeat (2) - 80 freq repeats (2) - 11 freq repeatin (2) - 24 freq resented (2) - 1 freq related (2) - 31 freq |
repeated (0) - 32 freq repealed (2) - 1 freq repented (2) - 1 freq repeatet (2) - 6 freq repeats (3) - 11 freq repeat (3) - 80 freq repeatedly (3) - 4 freq repeatin (3) - 24 freq repinted (3) - 2 freq reeted (3) - 4 freq replayed (3) - 1 freq related (3) - 31 freq repeatan (3) - 3 freq repeyed (3) - 2 freq repete (3) - 1 freq repeatit (3) - 52 freq reported (3) - 15 freq repeatic (3) - 1 freq rated (4) - 3 freq repute (4) - 12 freq repaired (4) - 8 freq ripened (4) - 2 freq erupted (4) - 8 freq radiated (4) - 1 freq repetit (4) - 1 freq |
SoundEx code - R133 repeatit - 52 freq repeated - 32 freq reputation - 30 freq refuted - 1 freq riftit - 1 freq reputit - 2 freq rifted - 1 freq repeatedly - 4 freq riveted - 1 freq repetition - 6 freq repeatet - 6 freq reputatioun - 2 freq rebooted - 1 freq repeteetion - 4 freq rapidity - 1 freq refutautioun - 2 freq repetit - 1 freq reputaetional - 1 freq repaitit - 5 freq rebattit - 2 freq repetitious - 1 freq 'reputations' - 1 freq repeteition - 1 freq rubbit-oot - 1 freq reputations - 1 freq €˜reputation - 1 freq repitition - 1 freq repetitive - 2 freq repeatitly - 2 freq rabbitheadal - 1 freq rippeditup - 1 freq refutation - 1 freq rebutted - 1 freq |
MetaPhone code - RPTT repeatit - 52 freq repeated - 32 freq reputit - 2 freq repeatet - 6 freq rapidity - 1 freq repetit - 1 freq repaitit - 5 freq |
REPEATED |
| Time to execute Levenshtein function - 0.195748 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.364653 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.027835 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.038296 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.000933 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. |