| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| semolina (0) - 5 freq sembling (2) - 1 freq semolinie (2) - 1 freq smoliar (3) - 1 freq smilin' (3) - 1 freq demolish (3) - 2 freq removin (3) - 4 freq sestina (3) - 2 freq setlin (3) - 1 freq seedling (3) - 3 freq sellin (3) - 70 freq smoking (3) - 13 freq sealing (3) - 1 freq samplin (3) - 2 freq smokin' (3) - 4 freq seedlin (3) - 2 freq olina (3) - 11 freq semifinal (3) - 2 freq gemblin (3) - 1 freq settlin (3) - 37 freq settlin' (3) - 3 freq seeplin (3) - 1 freq scoolin (3) - 2 freq seminal (3) - 1 freq semein (3) - 4 freq |
semolina (0) - 5 freq semolinie (2) - 1 freq smilin (3) - 153 freq seeplin (4) - 1 freq seowlin (4) - 1 freq smeilin (4) - 1 freq seedlin (4) - 2 freq semein (4) - 4 freq soolin (4) - 2 freq smorin (4) - 5 freq smiling (4) - 16 freq samplin (4) - 2 freq smokin (4) - 92 freq scoolin (4) - 2 freq sellin (4) - 70 freq sembling (4) - 1 freq setlin (4) - 1 freq smoliar (4) - 1 freq smilin' (4) - 1 freq smilan (4) - 8 freq sumin (5) - 6 freq semicolon (5) - 1 freq souklin (5) - 1 freq spielin (5) - 1 freq seemon (5) - 17 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 |
SEMOLINA |
| Time to execute Levenshtein function - 0.219416 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.404539 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.029768 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.037241 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.000864 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. |