| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asylum (0) - 13 freq slum (2) - 5 freq sklum (2) - 1 freq slam (3) - 13 freq asls (3) - 25 freq salus (3) - 1 freq syrup (3) - 24 freq slut (3) - 5 freq asl (3) - 1 freq ashley (3) - 9 freq 'slam (3) - 1 freq aiyun (3) - 1 freq assume (3) - 24 freq annum (3) - 2 freq callum (3) - 81 freq arrum (3) - 7 freq gollum (3) - 1 freq sylv (3) - 3 freq assam (3) - 1 freq allus (3) - 4 freq aurum (3) - 1 freq a'luv (3) - 1 freq affcum (3) - 3 freq aslaug (3) - 1 freq willum (3) - 5 freq |
asylum (0) - 13 freq slum (2) - 5 freq islam (3) - 5 freq slim (3) - 16 freq slam (3) - 13 freq sklum (3) - 1 freq scum (4) - 11 freq slump (4) - 6 freq siloam (4) - 2 freq volum (4) - 1 freq slur (4) - 4 freq lum (4) - 139 freq sloom (4) - 5 freq serum (4) - 4 freq glum (4) - 10 freq sylk (4) - 1 freq skaum (4) - 1 freq weelum (4) - 5 freq shum (4) - 1 freq gaulum (4) - 1 freq plum (4) - 15 freq sulu (4) - 1 freq psalm (4) - 39 freq sclam (4) - 1 freq sklim (4) - 3 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.181586 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.331634 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.026888 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.036712 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.000783 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. |