Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yellaes (0) - 2 freq yellaer (1) - 1 freq yellas (1) - 4 freq yellae (1) - 55 freq fellaes (1) - 9 freq follaes (2) - 58 freq yell's (2) - 1 freq cellars (2) - 1 freq sellars (2) - 1 freq yallae (2) - 5 freq yallas (2) - 1 freq fellae (2) - 40 freq bedlaes (2) - 1 freq yellan (2) - 1 freq bella's (2) - 5 freq elbaes (2) - 1 freq belles (2) - 1 freq yellay (2) - 2 freq mallaes (2) - 1 freq yalla's (2) - 1 freq fella's (2) - 2 freq bellies (2) - 22 freq yella (2) - 130 freq ella's (2) - 10 freq wellies (2) - 16 freq |
yellaes (0) - 2 freq yellas (1) - 4 freq yallas (2) - 1 freq fellaes (2) - 9 freq yells (2) - 10 freq yellae (2) - 55 freq yellaer (2) - 1 freq fellas (3) - 12 freq yellad (3) - 1 freq tellies (3) - 5 freq yellaw (3) - 1 freq bellas (3) - 1 freq fallaes (3) - 1 freq yellows (3) - 4 freq pillaes (3) - 7 freq yills (3) - 2 freq ellis (3) - 3 freq yalls (3) - 2 freq allies (3) - 8 freq iyillies (3) - 1 freq wellies (3) - 16 freq yallaed (3) - 1 freq allays (3) - 1 freq kellas (3) - 2 freq yelled (3) - 21 freq |
SoundEx code - Y420 yowls - 4 freq yelloch - 7 freq yolk - 6 freq yolks - 2 freq yalls - 2 freq yell's - 1 freq yellas - 4 freq yellaes - 2 freq yillhoose - 3 freq yills - 2 freq yells - 10 freq yill's - 1 freq yalla's - 1 freq yella-ish - 1 freq yellows - 4 freq yalk - 1 freq yoles - 9 freq yallows - 2 freq yallas - 1 freq yill-houss - 1 freq yallochie - 1 freq yill-hoose - 1 freq yellows - 1 freq ylk - 1 freq 'yule's - 1 freq |
MetaPhone code - YLS yowls - 4 freq yalls - 2 freq yell's - 1 freq yellas - 4 freq yellaes - 2 freq yills - 2 freq yells - 10 freq yill's - 1 freq yalla's - 1 freq yellows - 4 freq yoles - 9 freq yallows - 2 freq yallas - 1 freq yellows - 1 freq 'yule's - 1 freq |
YELLAES |
Time to execute Levenshtein function - 0.222263 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.353920 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.027797 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.037318 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.000883 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. |