| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recipe (0) - 33 freq recile (1) - 1 freq recipie (1) - 2 freq recipt (1) - 1 freq recite (1) - 9 freq recipes (1) - 17 freq relive (2) - 1 freq reive (2) - 5 freq recce (2) - 1 freq rewire (2) - 2 freq resile (2) - 1 freq precise (2) - 14 freq receipt (2) - 18 freq remine (2) - 2 freq reine (2) - 2 freq recipies (2) - 1 freq recited (2) - 2 freq racine (2) - 3 freq recline (2) - 2 freq revile (2) - 3 freq ripe (2) - 28 freq regime (2) - 10 freq reclee (2) - 1 freq retire (2) - 11 freq receive (2) - 21 freq |
recipe (0) - 33 freq recipie (1) - 2 freq recap (2) - 1 freq recite (2) - 9 freq recipes (2) - 17 freq recile (2) - 1 freq recipt (2) - 1 freq receive (3) - 21 freq reclee (3) - 1 freq recipies (3) - 1 freq recoop (3) - 1 freq receipt (3) - 18 freq recce (3) - 1 freq recoup (3) - 3 freq racine (3) - 3 freq ripe (3) - 28 freq redup (4) - 1 freq richie (4) - 2 freq reca (4) - 6 freq racin (4) - 43 freq reece (4) - 1 freq reich (4) - 5 freq euripe (4) - 1 freq scape (4) - 1 freq raip (4) - 32 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 - RSP recipe - 33 freq rasp - 11 freq 'recipe' - 1 freq raspy - 3 freq recipie - 2 freq risp - 2 freq |
RECIPE |
| Time to execute Levenshtein function - 0.184653 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.390616 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.028493 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.038592 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.001173 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. |