| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aesop (0) - 8 freq eso (2) - 1 freq atop (2) - 6 freq alson (2) - 1 freq saeson (2) - 4 freq also (2) - 324 freq aesome (2) - 7 freq asap (2) - 10 freq besom (2) - 30 freq sop (2) - 4 freq raeson (2) - 28 freq aesy (2) - 57 freq aesir (2) - 4 freq aero (2) - 1 freq aest (2) - 21 freq esp (2) - 10 freq aese (2) - 8 freq aesum (2) - 2 freq aesopic (2) - 1 freq aesie (2) - 3 freq anso (2) - 1 freq aesin (2) - 2 freq hesp (2) - 1 freq aesed (2) - 2 freq aes (2) - 4 freq |
aesop (0) - 8 freq esp (2) - 10 freq asap (2) - 10 freq sop (2) - 4 freq sup (3) - 53 freq sap (3) - 10 freq seep (3) - 5 freq aesed (3) - 2 freq aes (3) - 4 freq soap (3) - 45 freq sepo (3) - 34 freq yasp (3) - 1 freq usp (3) - 1 freq soup (3) - 243 freq osp (3) - 2 freq isp (3) - 3 freq soep (3) - 1 freq sp (3) - 8 freq hesp (3) - 1 freq sope (3) - 3 freq soop (3) - 17 freq espy (3) - 2 freq sip (3) - 28 freq aest (3) - 21 freq aese (3) - 8 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 35 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - ESP aesop - 8 freq espy - 2 freq €™espa - 1 freq esp - 10 freq |
AESOP |
| Time to execute Levenshtein function - 0.230541 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.677506 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.083458 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.062230 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.001685 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. |