| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smilin (0) - 153 freq smeilin (1) - 1 freq sailin (1) - 37 freq spilin (1) - 2 freq smilin' (1) - 1 freq milin (1) - 2 freq smiling (1) - 16 freq shilin (1) - 1 freq smirlin (1) - 1 freq skilin (1) - 4 freq smilan (1) - 8 freq smilit (1) - 1 freq swirin (2) - 1 freq slidin (2) - 21 freq sheilin (2) - 2 freq ailin (2) - 2 freq smile (2) - 450 freq rilin (2) - 2 freq swipin (2) - 4 freq swillin (2) - 2 freq smiles (2) - 103 freq sitin (2) - 1 freq seilie (2) - 6 freq mixin (2) - 13 freq spikin (2) - 28 freq |
smilin (0) - 153 freq smeilin (1) - 1 freq smilan (1) - 8 freq smirlin (2) - 1 freq skilin (2) - 4 freq shilin (2) - 1 freq smilit (2) - 1 freq sailin (2) - 37 freq spilin (2) - 2 freq smilin' (2) - 1 freq smiling (2) - 16 freq milin (2) - 2 freq simiain (3) - 1 freq snuilin (3) - 1 freq smiler (3) - 1 freq miln (3) - 3 freq scuilin (3) - 1 freq soolin (3) - 2 freq emailin (3) - 1 freq smellin (3) - 14 freq surlin (3) - 1 freq smilet (3) - 19 freq siblin (3) - 1 freq sellin (3) - 70 freq saulin (3) - 2 freq |
SoundEx code - S545 smilin - 153 freq smallness - 1 freq smellin - 14 freq smiling - 16 freq smilin' - 1 freq semolina - 5 freq snailin - 1 freq snuilin - 1 freq sun-loungers - 1 freq smilan - 8 freq smelling - 4 freq skinnylinky - 1 freq smeilin - 1 freq sun-lounge - 1 freq somnolent - 1 freq semolina-textured - 1 freq semolinie - 1 freq sámiland - 1 freq scanlon - 49 freq €˜scanlon - 2 freq snawline - 1 freq smilnehomes - 1 freq smellin' - 1 freq shonawhillansx - 1 freq |
MetaPhone code - SMLN smilin - 153 freq smellin - 14 freq smilin' - 1 freq semolina - 5 freq smilan - 8 freq smeilin - 1 freq semolinie - 1 freq smellin' - 1 freq |
SMILIN |
| Time to execute Levenshtein function - 0.175122 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.339502 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.028824 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.037292 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.000841 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. |