| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smilan (0) - 8 freq smilin (1) - 153 freq sailan (1) - 5 freq soilan (1) - 1 freq milan (1) - 3 freq smiling (2) - 16 freq smiler (2) - 1 freq ceilan (2) - 1 freq skirlan (2) - 1 freq smirkan (2) - 1 freq heilan (2) - 17 freq roilan (2) - 1 freq smiles (2) - 103 freq slipan (2) - 1 freq boilan (2) - 1 freq skilin (2) - 4 freq milin (2) - 2 freq shiran (2) - 3 freq similar (2) - 59 freq shinan (2) - 10 freq shillan (2) - 1 freq solan (2) - 7 freq shilin (2) - 1 freq sealan (2) - 1 freq miln (2) - 3 freq |
smilan (0) - 8 freq smilin (1) - 153 freq smeilin (2) - 1 freq milan (2) - 3 freq soilan (2) - 1 freq sailan (2) - 5 freq sheilan (3) - 2 freq smilet (3) - 19 freq smokan (3) - 2 freq shielan (3) - 1 freq smiled (3) - 232 freq smilt (3) - 1 freq spilin (3) - 2 freq smileq (3) - 1 freq sailin (3) - 37 freq simian (3) - 1 freq smilit (3) - 1 freq skailan (3) - 1 freq smile (3) - 450 freq smilin' (3) - 1 freq sellan (3) - 1 freq smiley (3) - 12 freq miln (3) - 3 freq smirlin (3) - 1 freq sailen (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 |
SMILAN |
| Time to execute Levenshtein function - 0.190801 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.332825 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.027651 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.036780 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.000867 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. |