| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scanlon (0) - 49 freq canyon (2) - 1 freq cannon (2) - 13 freq sanson (2) - 1 freq salon (2) - 10 freq canton (2) - 2 freq scalin (2) - 2 freq conlon (2) - 1 freq canon (2) - 11 freq €˜scanlon (2) - 2 freq shannon (2) - 2 freq amscanlon (2) - 1 freq sablon (2) - 1 freq scansin (2) - 1 freq scancin (2) - 6 freq scallop (2) - 1 freq hanlon (2) - 2 freq scannan (2) - 1 freq scannin (2) - 8 freq danson (3) - 1 freq calloo (3) - 2 freq canto (3) - 27 freq spannin (3) - 4 freq scowlin (3) - 2 freq mcann (3) - 1 freq |
scanlon (0) - 49 freq scalin (3) - 2 freq conlon (3) - 1 freq scansin (3) - 1 freq scannin (3) - 8 freq scancin (3) - 6 freq scannan (3) - 1 freq amscanlon (3) - 1 freq scuilin (4) - 1 freq scowlin (4) - 2 freq snailin (4) - 1 freq scunn (4) - 1 freq scancein (4) - 1 freq scullion (4) - 2 freq scoatlan (4) - 12 freq scoolin (4) - 2 freq schulin (4) - 2 freq conlin (4) - 5 freq scotlan (4) - 63 freq €˜scanlon (4) - 2 freq canon (4) - 11 freq shannon (4) - 2 freq sablon (4) - 1 freq canton (4) - 2 freq sanson (4) - 1 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 - SKNLN signallin - 4 freq scanlon - 49 freq €˜scanlon - 2 freq |
SCANLON |
| Time to execute Levenshtein function - 0.262141 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.734534 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.040002 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.077081 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.003268 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. |