| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asklent (0) - 8 freq sklent (1) - 31 freq asclent (1) - 1 freq asklenty (1) - 1 freq ascent (2) - 2 freq silent (2) - 144 freq assent (2) - 2 freq aksent (2) - 4 freq sklents (2) - 2 freq asken (2) - 4 freq sklenty (2) - 1 freq asket (2) - 1 freq skleff (3) - 2 freq violent (3) - 18 freq aipent (3) - 1 freq basement (3) - 9 freq splet (3) - 5 freq insolent (3) - 1 freq aucient (3) - 1 freq agent (3) - 14 freq antlert (3) - 1 freq skelt (3) - 1 freq asseert (3) - 1 freq 'stent (3) - 1 freq attent (3) - 1 freq |
asklent (0) - 8 freq sklent (1) - 31 freq asklenty (1) - 1 freq sklenty (2) - 1 freq asclent (2) - 1 freq sklentie (3) - 1 freq sklents (3) - 2 freq silent (3) - 144 freq skant (4) - 1 freq salient (4) - 2 freq sleent (4) - 1 freq splint (4) - 1 freq seelent (4) - 25 freq sklentit (4) - 8 freq seilent (4) - 6 freq slant (4) - 3 freq skint (4) - 27 freq skelt (4) - 1 freq skelet (4) - 3 freq sklentan (4) - 2 freq skinnt (4) - 6 freq sklented (4) - 1 freq asket (4) - 1 freq aksent (4) - 4 freq asken (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 |
ASKLENT |
| Time to execute Levenshtein function - 0.198451 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.373414 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.028328 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.039212 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.000943 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. |