| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| achilles (0) - 5 freq achilles' (1) - 1 freq chills (2) - 7 freq 'chilled (2) - 1 freq chilled (2) - 9 freq schiller (2) - 1 freq achieves (2) - 1 freq achillin (2) - 1 freq chollers (3) - 1 freq alchies (3) - 1 freq a-holes (3) - 1 freq alles (3) - 1 freq 'whiles (3) - 2 freq vehicles (3) - 14 freq childs (3) - 1 freq whiles (3) - 478 freq chile (3) - 15 freq chimley (3) - 11 freq chices (3) - 1 freq arillas (3) - 1 freq charles (3) - 51 freq awhile (3) - 15 freq iceicles (3) - 1 freq chile's (3) - 1 freq awhyles (3) - 1 freq |
achilles (0) - 5 freq achilles' (2) - 1 freq chills (2) - 7 freq achillin (3) - 1 freq chilled (3) - 9 freq chilly (4) - 12 freq chillier (4) - 1 freq chillin (4) - 6 freq schuills (4) - 3 freq chirls (4) - 2 freq chile's (4) - 1 freq ghillies (4) - 1 freq chill (4) - 45 freq chimleys (4) - 1 freq shills (4) - 3 freq ochils (4) - 8 freq hillies (4) - 11 freq charles (4) - 51 freq chiels (4) - 110 freq hills (4) - 242 freq chiel's (4) - 17 freq chollers (4) - 1 freq chairles (4) - 16 freq achieves (4) - 1 freq schiller (4) - 1 freq |
SoundEx code - A242 ageless - 5 freq a'cloak - 2 freq aizles - 1 freq assails - 2 freq aclock - 1 freq achilles - 5 freq asweel's - 1 freq asls - 25 freq a'clock - 13 freq ash-light - 1 freq 'azulejo' - 1 freq azulejo - 1 freq aslaug - 1 freq agalis - 1 freq aijlice - 1 freq aijilice - 1 freq ajilice - 1 freq axle-grease - 1 freq a'chaolais - 1 freq aw-gaelic - 1 freq achilles' - 1 freq aeschylus - 1 freq aisles - 3 freq a'cloke - 2 freq azaleas - 3 freq aigles - 1 freq aaouyajylk - 1 freq ashleycscotland - 1 freq auclsdsvob - 1 freq ashleystorrie - 4 freq aglasgowgirl - 11 freq aslsschools - 2 freq aslss - 1 freq ashwilsonauthor - 44 freq azscholes - 1 freq |
MetaPhone code - AXLS achilles - 5 freq a'chaolais - 1 freq achilles' - 1 freq |
ACHILLES |
| Time to execute Levenshtein function - 0.342369 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.558887 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.039652 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.079515 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.000892 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. |