| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aisment (0) - 1 freq aisement (1) - 2 freq ailment (1) - 2 freq ascent (2) - 2 freq aipent (2) - 1 freq maidment (2) - 2 freq dissent (2) - 8 freq miskent (2) - 4 freq lisent (2) - 1 freq raiment (2) - 2 freq augment (2) - 2 freq ailmint (2) - 1 freq aksent (2) - 4 freq absent (2) - 12 freq figment (2) - 1 freq airmen (2) - 2 freq listent (2) - 10 freq maiment (2) - 2 freq assent (2) - 2 freq ailments (2) - 9 freq wairmest (3) - 2 freq appent (3) - 7 freq aipen't (3) - 1 freq nascent (3) - 3 freq mirkent (3) - 1 freq |
aisment (0) - 1 freq aisement (1) - 2 freq ailment (2) - 2 freq raiment (3) - 2 freq ailmint (3) - 1 freq maiment (3) - 2 freq augment (3) - 2 freq easement (3) - 9 freq ascent (3) - 2 freq assent (3) - 2 freq segment (4) - 1 freq spent (4) - 281 freq adamant (4) - 5 freq wament (4) - 1 freq stent (4) - 30 freq element (4) - 45 freq ment (4) - 18 freq maument (4) - 9 freq aagmint (4) - 1 freq iniment (4) - 1 freq casement (4) - 3 freq saicent (4) - 1 freq assint (4) - 1 freq peyment (4) - 6 freq dismount (4) - 1 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - ASMNT aisement - 2 freq aisment - 1 freq |
AISMENT |
| Time to execute Levenshtein function - 0.222729 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.410736 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.029944 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.039742 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.000938 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. |