| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yaisers (0) - 6 freq yaiser (1) - 3 freq yaiser' (1) - 1 freq yaises (1) - 18 freq aises (2) - 1 freq raises (2) - 24 freq dailers (2) - 2 freq maissers (2) - 1 freq haimers (2) - 2 freq uisers (2) - 17 freq lasers (2) - 2 freq faiders (2) - 1 freq yaisless (2) - 1 freq yaisefu (2) - 2 freq yatters (2) - 2 freq waiters (2) - 8 freq yaised (2) - 238 freq tasers (2) - 1 freq guisers (2) - 8 freq caises (2) - 2 freq kaiser (2) - 1 freq yammers (2) - 3 freq baiters (2) - 2 freq saasers (2) - 1 freq jailers (2) - 1 freq |
yaisers (0) - 6 freq yaises (2) - 18 freq uisers (2) - 17 freq yaiser' (2) - 1 freq yaiser (2) - 3 freq users (3) - 7 freq saasers (3) - 1 freq sairs (3) - 8 freq sayers (3) - 17 freq osiers (3) - 1 freq guisers (3) - 8 freq sers (3) - 11 freq aises (3) - 1 freq yessers (3) - 2 freq misers (3) - 1 freq tasers (3) - 1 freq lasers (3) - 2 freq yers (4) - 20 freq airrs (4) - 2 freq lairs (4) - 15 freq yaasss (4) - 1 freq aweers (4) - 1 freq eilers (4) - 1 freq saies (4) - 1 freq saucers (4) - 6 freq |
SoundEx code - Y262 ycars - 1 freq yaisers - 6 freq yessers - 2 freq yesargyll - 1 freq ykrxcyiqlv - 1 freq |
MetaPhone code - YSRS yaisers - 6 freq yessers - 2 freq |
YAISERS |
| Time to execute Levenshtein function - 0.206614 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.336597 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.027392 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.037091 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.000956 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. |