| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asclent (0) - 1 freq asklent (1) - 8 freq ascent (1) - 2 freq aucient (2) - 1 freq scent (2) - 65 freq sclents (2) - 1 freq ascend (2) - 7 freq sklent (2) - 31 freq assent (2) - 2 freq asklenty (2) - 1 freq accent (2) - 116 freq ancient (2) - 109 freq nascent (2) - 3 freq silent (2) - 143 freq glent (3) - 30 freq scen (3) - 1 freq asseert (3) - 1 freq aulest (3) - 7 freq advent (3) - 8 freq raecent (3) - 3 freq slant (3) - 3 freq ascreus (3) - 1 freq lent (3) - 38 freq cleat (3) - 1 freq alert (3) - 17 freq |
asclent (0) - 1 freq ascent (2) - 2 freq asklent (2) - 8 freq silent (3) - 143 freq asklenty (3) - 1 freq sklent (3) - 31 freq scent (3) - 65 freq sclents (3) - 1 freq declint (4) - 1 freq saicent (4) - 1 freq scrunt (4) - 7 freq sickent (4) - 1 freq inclint (4) - 3 freq clint (4) - 4 freq sleent (4) - 1 freq scale't (4) - 1 freq seilent (4) - 6 freq salient (4) - 2 freq seelent (4) - 25 freq sklenty (4) - 1 freq scint (4) - 2 freq client (4) - 2 freq scant (4) - 34 freq sclimt (4) - 9 freq cleant (4) - 4 freq |
SoundEx code - A245 asclent - 1 freq acclamation - 2 freq asklent - 8 freq aisling - 1 freq acclaimit - 2 freq a-glowin - 1 freq auckland - 3 freq asklenty - 1 freq agglan - 1 freq a-sailin - 1 freq asylum - 13 freq acclaim - 3 freq asylum-seekin - 1 freq assailant - 1 freq agcolehamilton - 7 freq achillin - 1 freq |
MetaPhone code - ASKLNT asclent - 1 freq asklent - 8 freq asklenty - 1 freq |
ASCLENT |
| Time to execute Levenshtein function - 0.351372 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.548991 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.060445 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.038882 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. |