| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asylum (0) - 13 freq sklum (2) - 1 freq slum (2) - 5 freq ayui (3) - 1 freq asyde (3) - 13 freq anthum (3) - 1 freq solumn (3) - 1 freq asl (3) - 1 freq vellum (3) - 2 freq ayl (3) - 1 freq aeolus (3) - 2 freq sclumb (3) - 1 freq album (3) - 24 freq allus (3) - 4 freq slim (3) - 17 freq asls (3) - 25 freq sulu (3) - 1 freq astorm (3) - 1 freq aurum (3) - 1 freq haslam (3) - 1 freq colum (3) - 2 freq amyl (3) - 1 freq atrium (3) - 1 freq warklum (3) - 1 freq arrum (3) - 7 freq |
asylum (0) - 13 freq slum (2) - 5 freq islam (3) - 5 freq slam (3) - 15 freq slim (3) - 17 freq sklum (3) - 1 freq slug (4) - 11 freq sylv (4) - 3 freq salome (4) - 1 freq aesum (4) - 2 freq aslaug (4) - 1 freq sclim (4) - 25 freq shum (4) - 1 freq slut (4) - 5 freq sklim (4) - 3 freq sylk (4) - 1 freq assume (4) - 25 freq slump (4) - 6 freq volum (4) - 1 freq i'lum (4) - 1 freq slur (4) - 4 freq salus (4) - 1 freq 'slam (4) - 1 freq slums (4) - 8 freq calum (4) - 12 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 - ASLM asylum - 13 freq |
ASYLUM |
| Time to execute Levenshtein function - 0.175906 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.350292 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.027735 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.037529 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.000931 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. |