| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yaiser (0) - 3 freq yaise (1) - 255 freq yaises (1) - 18 freq kaiser (1) - 1 freq raiser (1) - 2 freq yaised (1) - 238 freq yaiser' (1) - 1 freq yaisers (1) - 6 freq yasee (2) - 1 freq yuise (2) - 10 freq danser (2) - 1 freq uiser (2) - 5 freq dainer (2) - 5 freq baised (2) - 3 freq aise (2) - 14 freq aised (2) - 6 freq fairer (2) - 12 freq yaized (2) - 5 freq maiter (2) - 71 freq aiger (2) - 2 freq yammer (2) - 5 freq waiter (2) - 34 freq caises (2) - 2 freq maise (2) - 2 freq maister (2) - 216 freq |
yaiser (0) - 3 freq yaisers (2) - 6 freq aisier (2) - 12 freq yaise (2) - 255 freq aser (2) - 1 freq yaiser' (2) - 1 freq uiser (2) - 5 freq raiser (2) - 2 freq yaised (2) - 238 freq yaises (2) - 18 freq kaiser (2) - 1 freq yesser (3) - 1 freq anser (3) - 5 freq saifer (3) - 3 freq user (3) - 3 freq yase (3) - 13 freq yair (3) - 1 freq yaer (3) - 1 freq guiser (3) - 1 freq yised (3) - 4 freq yuised (3) - 4 freq yais (3) - 1 freq aises (3) - 1 freq laser (3) - 4 freq yaisit (3) - 4 freq |
SoundEx code - Y260 'yous're - 1 freq yous're - 2 freq yugir - 2 freq yaiser - 3 freq yesser - 1 freq yaiser' - 1 freq |
MetaPhone code - YSR 'yous're - 1 freq yous're - 2 freq yaiser - 3 freq yesser - 1 freq yaiser' - 1 freq |
YAISER |
| Time to execute Levenshtein function - 0.214827 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.370997 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.029354 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.039367 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.000946 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. |