| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eteaueds (0) - 1 freq steamed (3) - 7 freq steads (3) - 6 freq teamed (3) - 1 freq taeds (3) - 1 freq taunds (3) - 1 freq teases (3) - 6 freq teased (3) - 6 freq straunds (3) - 1 freq teared (3) - 1 freq staunds (3) - 29 freq steamers (3) - 1 freq eseaes (3) - 1 freq steeds (3) - 2 freq ttands (4) - 1 freq avenues (4) - 5 freq reapers (4) - 2 freq needs (4) - 340 freq league's (4) - 1 freq tead (4) - 1 freq texters (4) - 1 freq efterwurds (4) - 1 freq texes (4) - 3 freq sheaves (4) - 6 freq streaked (4) - 2 freq |
eteaueds (0) - 1 freq taeds (3) - 1 freq teds (4) - 1 freq steeds (4) - 2 freq teases (4) - 6 freq taunds (4) - 1 freq taids (4) - 2 freq steads (4) - 6 freq thuds (5) - 3 freq dauds (5) - 26 freq leeds (5) - 9 freq seeds (5) - 47 freq taxes (5) - 24 freq eetems (5) - 1 freq etude (5) - 1 freq tidies (5) - 2 freq teas (5) - 3 freq teady (5) - 1 freq yauds (5) - 1 freq takes (5) - 137 freq treeds (5) - 1 freq eelids (5) - 2 freq steadies (5) - 1 freq weeds (5) - 56 freq feeds (5) - 23 freq |
SoundEx code - E332 eediotically - 1 freq eediotic - 4 freq eediotically-muckle - 1 freq eediotic-lookin - 1 freq eediots - 1 freq eedyits - 1 freq eteaueds - 1 freq eedyots - 1 freq |
MetaPhone code - ETTS eediots - 1 freq eteaueds - 1 freq |
ETEAUEDS |
| Time to execute Levenshtein function - 0.258762 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.388336 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.028147 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.037819 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.000896 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. |