| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icarus (0) - 12 freq acaus (2) - 2 freq scarns (2) - 1 freq caus (2) - 8 freq caius (2) - 3 freq cards (2) - 33 freq carts (2) - 2 freq cars (2) - 91 freq ycars (2) - 1 freq scares (2) - 5 freq cares (2) - 58 freq scarfs (2) - 3 freq scarts (2) - 9 freq scars (2) - 11 freq vicars (2) - 1 freq car's (2) - 16 freq canus (2) - 1 freq circus (3) - 32 freq marks (3) - 44 freq cargo (3) - 12 freq scary (3) - 53 freq glares (3) - 7 freq boards (3) - 23 freq cans (3) - 45 freq scare (3) - 20 freq |
icarus (0) - 12 freq cares (2) - 58 freq cars (2) - 91 freq ycars (2) - 1 freq carse (3) - 17 freq caries (3) - 1 freq crys (3) - 1 freq careous (3) - 1 freq caurs (3) - 10 freq acres (3) - 24 freq cros (3) - 1 freq cerys (3) - 1 freq cures (3) - 4 freq cores (3) - 3 freq cors (3) - 1 freq coars (3) - 1 freq creus (3) - 1 freq caers (3) - 1 freq carso (3) - 1 freq cards (3) - 33 freq carts (3) - 2 freq caius (3) - 3 freq caus (3) - 8 freq acaus (3) - 2 freq acers (3) - 1 freq |
SoundEx code - I262 'igreja - 2 freq i'sark - 1 freq i'kirkton - 9 freq i'garioch - 2 freq ickers - 1 freq icarus - 12 freq isriggit - 1 freq ichrisfoy - 1 freq |
MetaPhone code - IKRS ickers - 1 freq icarus - 12 freq |
ICARUS |
| Time to execute Levenshtein function - 0.195823 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.352189 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.026846 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.036525 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.000825 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. |