| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bicycle (0) - 8 freq bicycles (1) - 1 freq cycle (2) - 24 freq recycle (2) - 3 freq ricicle (2) - 1 freq icicle (2) - 3 freq tricycle (2) - 2 freq sickle (3) - 4 freq tickle (3) - 13 freq bittle (3) - 1 freq pickle (3) - 30 freq recycled (3) - 2 freq circle (3) - 87 freq bachle (3) - 1 freq rickle (3) - 31 freq boyle (3) - 17 freq bbckile (3) - 1 freq oiyle (3) - 1 freq byle (3) - 16 freq bile (3) - 56 freq mickle (3) - 13 freq bryce (3) - 5 freq birsle (3) - 1 freq miracle (3) - 43 freq fickle (3) - 11 freq |
bicycle (0) - 8 freq bicycles (2) - 1 freq ricicle (3) - 1 freq icicle (3) - 3 freq recycle (3) - 3 freq cycle (3) - 24 freq bachle (4) - 1 freq buckle (4) - 12 freq baccie (4) - 1 freq tricycle (4) - 2 freq cycles (5) - 5 freq brickle (5) - 1 freq cycled (5) - 4 freq bachly (5) - 1 freq bille (5) - 2 freq bible (5) - 95 freq bcc (5) - 1 freq buccar (5) - 1 freq bacca (5) - 2 freq bauchle (5) - 26 freq boccies (5) - 1 freq michele (5) - 2 freq mcclue (5) - 2 freq beccsley (5) - 1 freq baccy (5) - 17 freq |
SoundEx code - B224 basically - 35 freq bicycle - 8 freq bi-sexual - 1 freq bicycles - 1 freq bisexuality - 1 freq bbchighlands - 1 freq beckyexcell - 1 freq buckiehighlib - 1 freq |
MetaPhone code - BSKL basically - 35 freq bicycle - 8 freq |
BICYCLE |
| Time to execute Levenshtein function - 0.195831 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.349995 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.028000 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.043183 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.000865 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. |