| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shilcorn (0) - 2 freq unicorn (3) - 61 freq alcorn (3) - 7 freq silicon (3) - 1 freq shillin (3) - 29 freq shorn (3) - 7 freq scorn (3) - 18 freq shilleen (3) - 1 freq shiltry (3) - 1 freq saiconn (3) - 4 freq shilin (3) - 1 freq stillborn (3) - 1 freq chilton (3) - 1 freq sailors (3) - 17 freq shillan (3) - 1 freq whithorn (3) - 2 freq sailor (3) - 20 freq hilton (3) - 2 freq shilter (3) - 2 freq haycorn (3) - 2 freq stilton (3) - 2 freq shilters (3) - 1 freq shicken (3) - 2 freq shidders (4) - 2 freq chicken (4) - 82 freq |
shilcorn (0) - 2 freq shelterin (5) - 1 freq shilin (5) - 1 freq shillan (5) - 1 freq shilters (5) - 1 freq shicken (5) - 2 freq shiltry (5) - 1 freq haycorn (5) - 2 freq shilter (5) - 2 freq shillin (5) - 29 freq silicon (5) - 1 freq shorn (5) - 7 freq alcorn (5) - 7 freq shilleen (5) - 1 freq scorn (5) - 18 freq shrucken (6) - 1 freq shuillin (6) - 1 freq sheilin (6) - 2 freq sweetcorn (6) - 3 freq scorin (6) - 6 freq shiveran (6) - 1 freq shuchin (6) - 1 freq halcyon (6) - 2 freq shalders (6) - 6 freq sharn (6) - 29 freq |
SoundEx code - S426 sluggard' - 5 freq slaigert - 1 freq sel-ashuirance - 1 freq selkirk - 10 freq slessor - 4 freq silksrin'r - 1 freq shalls'r - 1 freq shilcorn - 2 freq slicer - 1 freq sluggard - 1 freq solsgirth - 1 freq slagger - 2 freq 'sheilagreen' - 1 freq saul-searchan - 1 freq shell-grittit - 1 freq slaigerin - 2 freq slogie-riddles - 2 freq selkirkshire - 1 freq siliguri - 1 freq sowel-searchin - 2 freq sel-assertin - 1 freq slaugherhoose - 1 freq schoolsreopen - 1 freq sluggerotoole - 4 freq skillsr - 1 freq slugger - 1 freq slashertrash - 1 freq selkirkalereds - 2 freq schoolsgrowingfood - 1 freq |
MetaPhone code - XLKRN shilcorn - 2 freq 'sheilagreen' - 1 freq |
SHILCORN |
| Time to execute Levenshtein function - 0.226161 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.406613 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.030464 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.040728 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.001168 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. |