| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| semolinie (0) - 1 freq semolina (2) - 5 freq sehlince (3) - 1 freq semblance (3) - 3 freq sembling (3) - 1 freq semplie (3) - 2 freq sealing (4) - 1 freq setlin (4) - 1 freq symbolise (4) - 1 freq seiklie (4) - 1 freq timeline (4) - 14 freq minie (4) - 2 freq seelence (4) - 73 freq pey-line (4) - 1 freq simplified (4) - 2 freq demolishit (4) - 1 freq soolin (4) - 2 freq smellie (4) - 1 freq demonise (4) - 1 freq sexpince (4) - 1 freq semmelie (4) - 8 freq smorin (4) - 5 freq gemblin (4) - 1 freq seedling (4) - 3 freq smokin (4) - 97 freq |
semolinie (0) - 1 freq semolina (2) - 5 freq smilin (4) - 155 freq smiling (5) - 16 freq smilan (5) - 8 freq smilin' (5) - 1 freq smokin (5) - 97 freq skyline (5) - 6 freq smorin (5) - 5 freq samplin (5) - 2 freq seedlin (5) - 2 freq seeplin (5) - 1 freq somelike (5) - 2 freq smoliar (5) - 1 freq samelike (5) - 2 freq sellin (5) - 70 freq seowlin (5) - 1 freq melanie (5) - 1 freq simone (5) - 4 freq smeilin (5) - 1 freq setlin (5) - 1 freq semplie (5) - 2 freq sembling (5) - 1 freq sehlince (5) - 1 freq semblance (5) - 3 freq |
SoundEx code - S545 smilin - 155 freq smallness - 1 freq smellin - 15 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 - 155 freq smellin - 15 freq smilin' - 1 freq semolina - 5 freq smilan - 8 freq smeilin - 1 freq semolinie - 1 freq smellin' - 1 freq |
SEMOLINIE |
| Time to execute Levenshtein function - 0.431695 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.777858 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.038149 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.050958 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.001275 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. |