| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auchleven (0) - 1 freq auchteen (2) - 5 freq lochleven (2) - 1 freq achieved (3) - 14 freq aichteen (3) - 13 freq achieves (3) - 1 freq achievin (3) - 3 freq achieve (3) - 35 freq achteen (3) - 2 freq acheen (3) - 1 freq auchineden (3) - 1 freq suilven (4) - 1 freq ficheren (4) - 1 freq schlagen (4) - 1 freq mauchline (4) - 4 freq bauchlet (4) - 1 freq gleven (4) - 1 freq rauchled (4) - 1 freq archives (4) - 9 freq scrieven (4) - 2 freq lauchen (4) - 7 freq acteeve (4) - 1 freq dauchle (4) - 2 freq leven (4) - 17 freq echteen (4) - 27 freq |
auchleven (0) - 1 freq lochleven (3) - 1 freq auchteen (4) - 5 freq achievin (4) - 3 freq acheen (5) - 1 freq cloven (5) - 5 freq achteen (5) - 2 freq auchineden (5) - 1 freq aichteen (5) - 13 freq achieve (5) - 35 freq achieved (5) - 14 freq achieves (5) - 1 freq pleven (6) - 1 freq mauchlin (6) - 13 freq aleyven (6) - 2 freq chauvin (6) - 4 freq eichteen (6) - 15 freq colvin (6) - 1 freq heven (6) - 1 freq achten (6) - 1 freq fauchlin (6) - 1 freq achieving (6) - 1 freq wauchlin (6) - 1 freq alven (6) - 1 freq eleven (6) - 38 freq |
SoundEx code - A241 asleep - 157 freq auchleven - 1 freq asleap - 1 freq asleip - 2 freq ashleyfrankly - 1 freq |
MetaPhone code - AXLFN auchleven - 1 freq |
AUCHLEVEN |
| Time to execute Levenshtein function - 0.499564 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.799112 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.028690 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.085321 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.001088 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. |