| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recoop (0) - 1 freq recoup (1) - 3 freq recoont (2) - 3 freq recap (2) - 1 freq scoop (2) - 16 freq re-bop (2) - 1 freq coop (2) - 1 freq recon (2) - 1 freq record (2) - 99 freq rector (2) - 4 freq reckon (2) - 69 freq recoil (2) - 3 freq reca (3) - 6 freq repond (3) - 1 freq reform (3) - 42 freq peoor (3) - 1 freq recess (3) - 3 freq secoypp (3) - 1 freq revote (3) - 1 freq europ (3) - 2 freq rep (3) - 3 freq records (3) - 34 freq becom (3) - 1 freq 'cook (3) - 1 freq redrob (3) - 1 freq |
recoop (0) - 1 freq recoup (1) - 3 freq recap (2) - 1 freq recon (3) - 1 freq recoil (3) - 3 freq coop (3) - 1 freq recipe (3) - 33 freq scoop (3) - 16 freq ropp (4) - 7 freq reap (4) - 10 freq recaa (4) - 1 freq recl (4) - 1 freq coap (4) - 2 freq re-bop (4) - 1 freq recce (4) - 1 freq recipt (4) - 1 freq reclee (4) - 1 freq roup (4) - 24 freq robocop (4) - 2 freq reep (4) - 2 freq reck (4) - 20 freq rowp (4) - 4 freq redup (4) - 1 freq roap (4) - 3 freq recile (4) - 1 freq |
SoundEx code - R210 recipe - 33 freq rugby - 49 freq receive - 21 freq rasp - 11 freq 'rugby - 1 freq 'recipe' - 1 freq rosscoff - 1 freq recap - 1 freq raspy - 3 freq recoop - 1 freq recipie - 2 freq rock-a-bye - 1 freq rspb - 11 freq rspba - 6 freq risp - 2 freq resaif - 2 freq rose-hip - 1 freq rougvie - 1 freq recoup - 3 freq rokeby - 1 freq reshape - 1 freq rkwp - 1 freq rcf - 1 freq rrrxb - 1 freq rzyebw - 1 freq rxjfb - 1 freq rgwip - 1 freq rqp - 1 freq royxf - 1 freq rwowzp - 1 freq rgohev - 1 freq |
MetaPhone code - RKP recap - 1 freq recoop - 1 freq recoup - 3 freq rkwp - 1 freq rqp - 1 freq |
RECOOP |
| Time to execute Levenshtein function - 0.199680 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.370234 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.028264 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.037328 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. |