Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yisterday (0) - 38 freq yisterdays (1) - 8 freq yistirday (1) - 5 freq yesterday (1) - 132 freq yesterdae (2) - 1 freq yesterdays (2) - 3 freq 'yesterday (2) - 1 freq yestirday (2) - 2 freq yestrday (2) - 1 freq yÂ’isterday (2) - 1 freq yisterday's (2) - 5 freq winterday (2) - 1 freq sisterly (3) - 1 freq riteday (3) - 1 freq listeria (3) - 1 freq winter-day (3) - 1 freq seterday (3) - 10 freq weeterday (3) - 1 freq mistery (3) - 1 freq amsterdam (3) - 5 freq yesterday's (3) - 5 freq saiterday (3) - 2 freq setterday (3) - 114 freq mister- (4) - 1 freq misery (4) - 31 freq |
yisterday (0) - 38 freq yistirday (1) - 5 freq yesterday (1) - 132 freq yestirday (2) - 2 freq yestrday (2) - 1 freq yisterdays (2) - 8 freq yesterdae (2) - 1 freq seterday (3) - 10 freq saiterday (3) - 2 freq yesterdays (3) - 3 freq 'yesterday (3) - 1 freq yisterday's (4) - 5 freq saturday (4) - 198 freq sturdy (4) - 27 freq setterday (4) - 114 freq saiturday (4) - 2 freq seturday (4) - 29 freq weeterday (4) - 1 freq easterd (4) - 1 freq saiterdae (4) - 1 freq seterdae (4) - 1 freq yÂ’isterday (4) - 1 freq winterday (4) - 1 freq unsturdy (5) - 1 freq aistern (5) - 2 freq |
SoundEx code - Y236 yesterday - 132 freq yisterday - 38 freq yestreen - 58 freq yestereen - 1 freq yistirday - 5 freq yestreen's - 3 freq yesterday's - 5 freq yisterday's - 5 freq yester - 4 freq yggdrasil - 3 freq yesterdays - 3 freq yestirday - 2 freq yisterdays - 8 freq yesternicht - 1 freq 'yesterday - 1 freq yestrein - 5 freq yesteryear's - 2 freq yestrday - 1 freq €œyestrein - 1 freq yistreen - 4 freq yÂ’isterday - 1 freq yestreens - 1 freq yesterdayÂ’s - 1 freq yesteryear - 2 freq yesterdae - 1 freq |
MetaPhone code - YSTRT yesterday - 132 freq yisterday - 38 freq yistirday - 5 freq yestirday - 2 freq 'yesterday - 1 freq yestrday - 1 freq yesterdae - 1 freq |
YISTERDAY |
Time to execute Levenshtein function - 0.313867 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.628631 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.056712 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.037217 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.000823 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. |