| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shairer (0) - 1 freq skairer (1) - 1 freq shaired (1) - 3 freq shuirer (1) - 1 freq sairer (1) - 6 freq shaire (1) - 8 freq shairper (1) - 2 freq shearer (2) - 4 freq shaner (2) - 3 freq saire (2) - 4 freq chaired (2) - 6 freq shairn (2) - 17 freq stairter (2) - 4 freq smairter (2) - 1 freq fairer (2) - 12 freq saired (2) - 7 freq thair'r (2) - 1 freq saifer (2) - 3 freq whaiver (2) - 30 freq shaker (2) - 1 freq shared (2) - 86 freq clairer (2) - 1 freq haired (2) - 5 freq shairp (2) - 80 freq shaver (2) - 2 freq |
shairer (0) - 1 freq shuirer (1) - 1 freq shearer (2) - 4 freq shaire (2) - 8 freq shairper (2) - 2 freq sairer (2) - 6 freq skairer (2) - 1 freq shaired (2) - 3 freq sharet (3) - 3 freq shares (3) - 27 freq share (3) - 281 freq hirer (3) - 1 freq share' (3) - 1 freq hairier (3) - 2 freq speirer (3) - 2 freq shuire (3) - 1 freq shiver (3) - 32 freq shiner (3) - 3 freq shairny (3) - 2 freq shair (3) - 445 freq shairin (3) - 2 freq shires (3) - 1 freq shired (3) - 5 freq sharper (3) - 1 freq sharger (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.682485 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.924900 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.087256 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.095282 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.000790 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. |