| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shairer (0) - 1 freq shaired (1) - 3 freq sairer (1) - 6 freq skairer (1) - 1 freq shuirer (1) - 1 freq shairper (1) - 3 freq shaire (1) - 8 freq shairp (2) - 80 freq shatter (2) - 1 freq haired (2) - 7 freq shire (2) - 26 freq speirer (2) - 2 freq shaver (2) - 2 freq hairier (2) - 2 freq shairly (2) - 107 freq chairter (2) - 71 freq shairds (2) - 5 freq sharper (2) - 1 freq shiner (2) - 3 freq haiver (2) - 6 freq shearer (2) - 4 freq staired (2) - 1 freq shired (2) - 5 freq stairen (2) - 2 freq thair'r (2) - 1 freq |
shairer (0) - 1 freq shuirer (1) - 1 freq shaired (2) - 3 freq shearer (2) - 4 freq shaire (2) - 8 freq shairper (2) - 3 freq sairer (2) - 6 freq skairer (2) - 1 freq shaker (3) - 1 freq shairin (3) - 2 freq shairn (3) - 17 freq sharet (3) - 3 freq shair (3) - 445 freq hirer (3) - 2 freq shuiner (3) - 6 freq shared (3) - 87 freq shaner (3) - 3 freq sairrer (3) - 1 freq shairny (3) - 2 freq shires (3) - 1 freq shirra (3) - 5 freq sharger (3) - 1 freq shares (3) - 27 freq shiver (3) - 35 freq share' (3) - 1 freq |
SoundEx code - S660 shuirer - 1 freq sairrer - 1 freq shairer - 1 freq skairer - 1 freq scurriewhirrie - 1 freq shearer - 4 freq sairer - 6 freq surer' - 1 freq seerer - 1 freq scarier - 1 freq scorer - 3 freq sarwar - 3 freq |
MetaPhone code - XRR shuirer - 1 freq shairer - 1 freq shearer - 4 freq |
SHAIRER |
| Time to execute Levenshtein function - 0.743445 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.710610 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.056486 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.038436 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.000870 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. |