Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yallt (0) - 1 freq yalls (1) - 2 freq yallo (1) - 5 freq yalla (1) - 99 freq yallit (1) - 1 freq callt (1) - 25 freq yall (1) - 3 freq yellt (1) - 4 freq pall (2) - 5 freq fahlt (2) - 1 freq caalt (2) - 24 freq gullt (2) - 1 freq yellit (2) - 1 freq fullt (2) - 23 freq galt (2) - 6 freq hall (2) - 190 freq mall (2) - 4 freq galla (2) - 2 freq galle (2) - 1 freq hally (2) - 1 freq haalt (2) - 2 freq pallet (2) - 3 freq swallt (2) - 15 freq yacht (2) - 11 freq bellt (2) - 1 freq |
yallt (0) - 1 freq yallit (1) - 1 freq yellt (1) - 4 freq yalls (2) - 2 freq yalla (2) - 99 freq yellit (2) - 1 freq yall (2) - 3 freq yallo (2) - 5 freq callt (2) - 25 freq yowlt (3) - 4 freq callit (3) - 3 freq aall (3) - 3 freq yolt (3) - 1 freq all' (3) - 3 freq ballet (3) - 4 freq dollt (3) - 1 freq ballot (3) - 10 freq valet (3) - 1 freq yallas (3) - 1 freq bailt (3) - 1 freq failt (3) - 7 freq hailt (3) - 6 freq railt (3) - 1 freq rollt (3) - 4 freq ballat (3) - 1 freq |
SoundEx code - Y430 yellt - 4 freq yawled - 1 freq yolt - 1 freq yowled - 54 freq yield - 16 freq yowlt - 4 freq yallt - 1 freq yallad - 1 freq yauld - 2 freq yeld - 2 freq yelled - 21 freq yallit - 1 freq yaldie - 3 freq yellad - 1 freq yowlit - 1 freq yella-eed - 1 freq yauled - 7 freq yellit - 1 freq yallaed - 1 freq yalled - 5 freq yella'd - 2 freq yaldy - 3 freq yalday - 1 freq yaldi - 2 freq |
MetaPhone code - YLT yellt - 4 freq yawled - 1 freq yolt - 1 freq yowled - 54 freq yield - 16 freq yowlt - 4 freq yallt - 1 freq yallad - 1 freq yauld - 2 freq yeld - 2 freq yelled - 21 freq yallit - 1 freq yaldie - 3 freq yellad - 1 freq yowlit - 1 freq yella-eed - 1 freq yauled - 7 freq yellit - 1 freq yallaed - 1 freq yalled - 5 freq yella'd - 2 freq yaldy - 3 freq yalday - 1 freq yaldi - 2 freq |
YALLT |
Time to execute Levenshtein function - 0.310301 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.655358 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.028211 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.072491 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.000904 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. |