| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wurthet (0) - 1 freq berthet (2) - 1 freq burthen (2) - 6 freq wuthert (2) - 7 freq wuther (2) - 3 freq wurket (2) - 31 freq hurtet (2) - 2 freq murthert (2) - 9 freq wurthie (2) - 1 freq murther (2) - 28 freq furthset (2) - 34 freq further (2) - 158 freq furthest (2) - 3 freq wurths (2) - 1 freq wurth (2) - 7 freq wunther (2) - 2 freq muther (3) - 26 freq 'murther (3) - 2 freq wurkmen (3) - 1 freq wirthy (3) - 7 freq futtret (3) - 1 freq worthies (3) - 4 freq outlet (3) - 3 freq wusht (3) - 2 freq wurt (3) - 4 freq |
wurthet (0) - 1 freq wurths (3) - 1 freq wurth (3) - 7 freq berthet (3) - 1 freq wurthie (3) - 1 freq wersht (4) - 2 freq warth (4) - 64 freq worth' (4) - 1 freq werth (4) - 2 freq wirth (4) - 91 freq wirthies (4) - 2 freq wrather (4) - 1 freq writhed (4) - 1 freq birthit (4) - 3 freq writhes (4) - 1 freq worthy (4) - 21 freq writhe (4) - 1 freq worthies (4) - 4 freq warthie (4) - 9 freq owrehet (4) - 1 freq worth (4) - 251 freq murthert (4) - 9 freq murther (4) - 28 freq worthie (4) - 5 freq further (4) - 158 freq |
SoundEx code - W633 weirdit - 5 freq wurthet - 1 freq wreathed - 5 freq wirdit - 1 freq writhed - 1 freq wurriet'at - 1 freq wair-tid - 2 freq wearetidelines - 2 freq wordhttps - 1 freq worded - 1 freq word--what - 1 freq |
MetaPhone code - WR0T wurthet - 1 freq |
WURTHET |
| Time to execute Levenshtein function - 0.274458 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.403599 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.032491 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.042682 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.001050 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. |