| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanrest (0) - 1 freq wanresty (1) - 2 freq wanst (2) - 32 freq warst (2) - 72 freq naarest (2) - 1 freq wanrestie (2) - 3 freq narrest (2) - 6 freq waekest (2) - 2 freq wanes (2) - 2 freq faarest (2) - 1 freq langest (2) - 20 freq wares (2) - 6 freq wrangest (2) - 1 freq wandert (2) - 5 freq wance't (2) - 3 freq hanest (2) - 1 freq naurest (2) - 1 freq wannert (2) - 22 freq unrest (2) - 6 freq wanrestfu (2) - 5 freq sairest (2) - 4 freq arrest (2) - 9 freq waarmest (2) - 1 freq warmest (2) - 5 freq wanless (2) - 3 freq |
wanrest (0) - 1 freq wanresty (1) - 2 freq wanrestie (2) - 3 freq unrest (3) - 6 freq waurst (3) - 5 freq naurest (3) - 1 freq wanrestfu (3) - 5 freq wanristie (3) - 1 freq wanst (3) - 32 freq warst (3) - 72 freq naarest (3) - 1 freq wurst (4) - 11 freq wneist (4) - 1 freq fairest (4) - 7 freq rarest (4) - 4 freq wairmest (4) - 2 freq waanert (4) - 1 freq wirst (4) - 2 freq waunert (4) - 6 freq wfirst (4) - 2 freq nearest (4) - 64 freq wrist (4) - 22 freq worst (4) - 103 freq wanrestfou (4) - 1 freq wheerest (4) - 2 freq |
SoundEx code - W562 wunners - 21 freq wanrestfu - 5 freq wanrestie - 3 freq winners - 30 freq wauners - 1 freq wanrest - 1 freq wunnersome - 8 freq wanners - 3 freq wunnerous - 1 freq wunnérs - 1 freq winnurs - 1 freq wanrestfou - 1 freq weinreich - 2 freq winnerstaan - 8 freq winnersteed - 1 freq winnersome - 1 freq winnerstaanin - 1 freq wonners - 1 freq waunners - 2 freq wanristie - 1 freq wanresty - 2 freq wunorse - 2 freq 'waymark' - 1 freq winners' - 1 freq whmrwhxcjp - 1 freq |
MetaPhone code - WNRST wanrestie - 3 freq wanrest - 1 freq wanristie - 1 freq wanresty - 2 freq |
WANREST |
| Time to execute Levenshtein function - 0.416216 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.785760 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.028000 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.083940 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.000867 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. |