| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forewurd (0) - 1 freq forewird (1) - 6 freq foreword (1) - 4 freq firewuid (2) - 1 freq forewarn (2) - 1 freq forwird (2) - 2 freq forward (2) - 162 freq firewidd (3) - 3 freq firewurks (3) - 1 freq reward (3) - 47 freq forwart (3) - 4 freq fore-erm (3) - 4 freq ferwerd (3) - 1 freq f-wurd (3) - 2 freq firewid (3) - 26 freq forrard (3) - 3 freq furwur (3) - 1 freq forehead (3) - 5 freq foreheed (3) - 1 freq foreairm (3) - 1 freq byewurd (3) - 1 freq firewark (3) - 2 freq forwirds (3) - 1 freq homeward (3) - 3 freq firewirk (3) - 2 freq |
forewurd (0) - 1 freq foreword (1) - 4 freq forewird (1) - 6 freq forwird (2) - 2 freq forward (2) - 162 freq forwaard (3) - 1 freq forewarn (3) - 1 freq ferwerd (3) - 1 freq firewuid (3) - 1 freq norward (4) - 1 freq forwards (4) - 5 freq firewark (4) - 2 freq firewirk (4) - 2 freq owrewird (4) - 1 freq firework (4) - 9 freq furwaird (4) - 1 freq for'ard (4) - 2 freq firebird (4) - 1 freq forwirds (4) - 1 freq forrard (4) - 3 freq firewidd (4) - 3 freq reward (4) - 47 freq furwur (4) - 1 freq firewid (4) - 26 freq forwart (4) - 4 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 |
FOREWURD |
| Time to execute Levenshtein function - 0.373661 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.521365 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.061379 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.039255 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.000932 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. |