| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icicles (0) - 6 freq iceicles (1) - 1 freq icicle (1) - 3 freq cycles (2) - 5 freq circles (2) - 34 freq eccles (2) - 1 freq ricicle (2) - 1 freq bicycles (2) - 1 freq hailes (3) - 3 freq smiles (3) - 103 freq articles (3) - 23 freq voices (3) - 110 freq daiches (3) - 2 freq slices (3) - 19 freq ices (3) - 2 freq juices (3) - 8 freq riches (3) - 23 freq niches (3) - 1 freq siles (3) - 1 freq saikles (3) - 2 freq spiles (3) - 1 freq chices (3) - 1 freq cycle (3) - 22 freq trickles (3) - 3 freq inimies (3) - 2 freq |
icicles (0) - 6 freq iceicles (1) - 1 freq eccles (2) - 1 freq icicle (2) - 3 freq cycles (2) - 5 freq bicycles (3) - 1 freq circles (3) - 34 freq cemicles (4) - 1 freq cclew (4) - 7 freq scales (4) - 21 freq cycled (4) - 3 freq isoceles (4) - 1 freq cycle (4) - 22 freq scules (4) - 1 freq cobles (4) - 2 freq coles (4) - 4 freq nicoles (4) - 1 freq carles (4) - 6 freq cackles (4) - 1 freq eccies (4) - 3 freq accies (4) - 2 freq uncles (4) - 19 freq auncles (4) - 1 freq cables (4) - 6 freq cockles (4) - 6 freq |
SoundEx code - I224 icicles - 6 freq iceicles - 1 freq isoceles - 1 freq ice-cold - 1 freq ice-cloak - 1 freq ice-cauld - 1 freq ice-cloored - 1 freq iceslabs - 1 freq icicle - 3 freq icecold - 1 freq |
MetaPhone code - ISKLS icicles - 6 freq iceicles - 1 freq |
ICICLES |
| Time to execute Levenshtein function - 0.328832 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.556599 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.031100 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.039495 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.000807 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. |