| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ferwerd (0) - 1 freq forwird (2) - 2 freq fermer (2) - 194 freq ferrer (2) - 8 freq ferrero (2) - 1 freq fermed (2) - 10 freq fewer (2) - 11 freq ferder (2) - 10 freq fermers (2) - 90 freq forward (2) - 162 freq feerd (2) - 1 freq merger (3) - 1 freq fermer's (3) - 21 freq seawird (3) - 1 freq ersed (3) - 6 freq firmer (3) - 4 freq werd (3) - 1 freq feeder (3) - 5 freq faercer (3) - 1 freq fowert (3) - 10 freq gerard (3) - 2 freq nerrer (3) - 2 freq feeld (3) - 1 freq berserk (3) - 3 freq ferr (3) - 48 freq |
ferwerd (0) - 1 freq forwird (2) - 2 freq forward (2) - 162 freq forwaard (3) - 1 freq furwaird (3) - 1 freq forewird (3) - 6 freq forewurd (3) - 1 freq foreword (3) - 4 freq afterward (4) - 4 freq firwid (4) - 1 freq for'ard (4) - 2 freq forred (4) - 1 freq efterword (4) - 2 freq forwart (4) - 4 freq reward (4) - 47 freq forwirds (4) - 1 freq f-word (4) - 2 freq firdered (4) - 1 freq norward (4) - 1 freq f-wurd (4) - 2 freq fordered (4) - 22 freq owerword (4) - 1 freq feerd (4) - 1 freq ferrer (4) - 8 freq fermers (4) - 90 freq |
SoundEx code - F663 forward - 162 freq forwardin - 1 freq forewird - 6 freq forwart - 4 freq furwirds - 1 freq forwards - 5 freq 'foreword' - 1 freq forwird - 2 freq frawart - 2 freq firey-reid - 2 freq forewurd - 1 freq forrard - 3 freq 'forward' - 1 freq foreword - 4 freq forwarded - 2 freq forordnar - 2 freq for'ard - 2 freq forrart - 3 freq forordinar - 1 freq forerede - 1 freq forwaard - 1 freq fair-haired - 1 freq faeryartemis - 1 freq forwirds - 1 freq furwaird - 1 freq ferwerd - 1 freq |
MetaPhone code - FRWRT forward - 162 freq forewird - 6 freq forwart - 4 freq 'foreword' - 1 freq forwird - 2 freq frawart - 2 freq forewurd - 1 freq 'forward' - 1 freq foreword - 4 freq forwaard - 1 freq furwaird - 1 freq ferwerd - 1 freq |
FERWERD |
| Time to execute Levenshtein function - 0.277844 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.419290 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.029398 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.041162 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.000975 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. |