| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sairer (0) - 6 freq skairer (1) - 1 freq sairrer (1) - 1 freq saire (1) - 4 freq shairer (1) - 1 freq saifer (1) - 3 freq fairer (1) - 12 freq airer (1) - 1 freq saired (1) - 7 freq puirer (2) - 6 freq faired (2) - 2 freq sairly (2) - 28 freq seerer (2) - 1 freq stairter (2) - 4 freq wairmer (2) - 1 freq baiker (2) - 1 freq sairch (2) - 7 freq sire (2) - 8 freq raiser (2) - 2 freq saime (2) - 14 freq spires (2) - 2 freq naider (2) - 1 freq naiter (2) - 2 freq sairie (2) - 22 freq cairter (2) - 1 freq |
sairer (0) - 6 freq airer (2) - 1 freq saired (2) - 7 freq saifer (2) - 3 freq seerer (2) - 1 freq fairer (2) - 12 freq skairer (2) - 1 freq saire (2) - 4 freq sairrer (2) - 1 freq shairer (2) - 1 freq suire (3) - 2 freq spire (3) - 5 freq cairier (3) - 1 freq storer (3) - 1 freq hirer (3) - 2 freq rarer (3) - 8 freq sawyer (3) - 1 freq sairy (3) - 5 freq shuirer (3) - 1 freq sairs (3) - 8 freq smirr (3) - 39 freq saucer (3) - 13 freq skier (3) - 2 freq saufer (3) - 2 freq siren (3) - 10 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 - SRR sairrer - 1 freq sor-ree - 2 freq cerrier - 1 freq sairer - 6 freq surer' - 1 freq seerer - 1 freq zrohr - 1 freq |
SAIRER |
| Time to execute Levenshtein function - 0.239422 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.381743 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.027185 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.038175 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.000882 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. |