| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smiling (0) - 16 freq smilin' (1) - 1 freq smilin (1) - 155 freq sailing (1) - 6 freq stiling (1) - 1 freq skirling (2) - 1 freq sibling (2) - 1 freq nailing (2) - 3 freq boiling (2) - 2 freq sealing (2) - 1 freq skiing (2) - 2 freq swirling (2) - 2 freq filing (2) - 1 freq smilan (2) - 8 freq ski-ing (2) - 1 freq smirlin (2) - 1 freq sling (2) - 7 freq swiping (2) - 3 freq smitin (2) - 1 freq milin (2) - 2 freq sidling (2) - 1 freq stirling (2) - 28 freq skilin (2) - 4 freq shilling (2) - 4 freq mining (2) - 5 freq |
smiling (0) - 16 freq sailing (2) - 6 freq stiling (2) - 1 freq smilin' (2) - 1 freq smilin (2) - 155 freq smeilin (3) - 1 freq smoking (3) - 13 freq skailing (3) - 1 freq sembling (3) - 1 freq sapling (3) - 2 freq spoiling (3) - 3 freq smelling (3) - 4 freq rumiling (3) - 1 freq selling (3) - 10 freq mailing (3) - 3 freq shieling (3) - 1 freq sidling (3) - 1 freq sibling (3) - 1 freq smilan (3) - 8 freq sealing (3) - 1 freq sling (3) - 7 freq slung (4) - 14 freq sooming (4) - 2 freq splang (4) - 1 freq s'long (4) - 1 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 - SMLNK smiling - 16 freq sembling - 1 freq smelling - 4 freq |
SMILING smile - 458 freq smiles - 110 freq smiled - 238 freq smiling - 16 freq smilin - 155 freq |
| Time to execute Levenshtein function - 0.175613 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.380803 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.031309 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.055444 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.001378 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. |