| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wershest (0) - 1 freq wershness (2) - 3 freq ferthest (2) - 3 freq weishes (2) - 3 freq weeshes (2) - 1 freq worsest (2) - 1 freq wersht (2) - 2 freq rerrest (3) - 1 freq owerset (3) - 81 freq wersh (3) - 24 freq horshes (3) - 1 freq ferrest (3) - 1 freq aesiest (3) - 1 freq ernest (3) - 6 freq wershy (3) - 1 freq weeiest (3) - 1 freq bedsheet (3) - 2 freq wushes (3) - 1 freq weathert (3) - 1 freq wurthet (3) - 1 freq oer-het (3) - 1 freq worset (3) - 2 freq wershly (3) - 1 freq wirksheet (3) - 1 freq berthet (3) - 1 freq |
wershest (0) - 1 freq worsest (3) - 1 freq wersht (3) - 2 freq weishes (4) - 3 freq wirshipt (4) - 1 freq wershness (4) - 3 freq wurshipt (4) - 2 freq weeshes (4) - 1 freq ferthest (4) - 3 freq worshipt (4) - 1 freq wishes (5) - 39 freq furthest (5) - 3 freq worsent (5) - 1 freq reishelt (5) - 1 freq farthest (5) - 1 freq warslet (5) - 6 freq washes (5) - 11 freq waashes (5) - 4 freq westist (5) - 1 freq warmest (5) - 5 freq plushest (5) - 1 freq owerfest (5) - 1 freq perishes (5) - 1 freq weesh't (5) - 1 freq wisest (5) - 2 freq |
SoundEx code - W622 wirkies - 1 freq wirricowes - 1 freq warkhoose - 2 freq worricows - 1 freq wershest - 1 freq wreckage - 4 freq warsaw's - 1 freq wirkwyse - 1 freq workies - 1 freq 'wirawjocktamsonsbairns' - 1 freq waorgujmd - 1 freq wrxag - 1 freq worsest - 1 freq worsestest - 1 freq wrujcizqw - 1 freq wrjygglxem - 1 freq wrgez - 1 freq |
MetaPhone code - WRXST wershest - 1 freq |
WERSHEST |
| Time to execute Levenshtein function - 0.208672 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.344212 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.027656 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.037147 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.000953 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. |