| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| seemlar (0) - 9 freq seemilar (1) - 17 freq sellar (2) - 15 freq seemly (2) - 1 freq seimilar (2) - 7 freq secular (2) - 3 freq seemtae (2) - 3 freq settler (3) - 1 freq settlan (3) - 1 freq shelah (3) - 3 freq cellar (3) - 26 freq seemon (3) - 17 freq seekly (3) - 1 freq smear (3) - 2 freq peeler (3) - 3 freq teegar (3) - 4 freq speller (3) - 2 freq seem't (3) - 24 freq sweemer (3) - 1 freq elmar (3) - 2 freq seeger (3) - 1 freq seethan (3) - 1 freq seerly (3) - 13 freq leear (3) - 16 freq seller (3) - 11 freq |
seemlar (0) - 9 freq seemilar (1) - 17 freq seimilar (2) - 7 freq similar (3) - 60 freq secular (3) - 3 freq sellar (3) - 15 freq seemly (3) - 1 freq seemilarly (4) - 1 freq simmilar (4) - 1 freq smaar (4) - 2 freq seller (4) - 11 freq smiler (4) - 1 freq smoar (4) - 1 freq smoliar (4) - 1 freq seemetry (4) - 1 freq solar (4) - 23 freq sumfar (4) - 1 freq seminar (4) - 5 freq sillar (4) - 3 freq sempler (4) - 2 freq smear (4) - 2 freq skolar (4) - 1 freq seemtae (4) - 3 freq meeler (4) - 1 freq seembol (5) - 1 freq |
SoundEx code - S546 smiler - 1 freq similar - 60 freq similarity - 2 freq smaller - 13 freq similarly - 3 freq seemilar - 17 freq smellerman - 10 freq smellerman's - 5 freq seimilar - 7 freq seimilarlie - 1 freq snellryfe - 1 freq seemlar - 9 freq seemilarity - 2 freq similarities - 8 freq seimilarities - 1 freq seemilarly - 1 freq seemilarities - 1 freq similar-like - 1 freq seemilaritie - 1 freq smoliar - 1 freq simmilar - 1 freq sammillar - 1 freq sunallergy - 1 freq |
MetaPhone code - SMLR smiler - 1 freq similar - 60 freq smaller - 13 freq seemilar - 17 freq seimilar - 7 freq seemlar - 9 freq smoliar - 1 freq simmilar - 1 freq sammillar - 1 freq |
SEEMLAR |
| Time to execute Levenshtein function - 0.183239 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.362493 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.027809 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.039119 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.000873 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. |