| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forwird (0) - 2 freq forwirds (1) - 1 freq forward (1) - 162 freq forewird (1) - 6 freq forwaard (2) - 1 freq ferwerd (2) - 1 freq forgied (2) - 2 freq for'ard (2) - 2 freq forwards (2) - 5 freq forrard (2) - 3 freq forewurd (2) - 1 freq firwid (2) - 1 freq furwaird (2) - 1 freq norward (2) - 1 freq forbid (2) - 10 freq forwart (2) - 4 freq forrid (2) - 1 freq furwirds (2) - 1 freq foreword (2) - 4 freq forgery (3) - 1 freq forbeir (3) - 3 freq forgit (3) - 8 freq forfend (3) - 3 freq norwards (3) - 1 freq forties (3) - 5 freq |
forwird (0) - 2 freq forward (1) - 162 freq forewird (1) - 6 freq forewurd (2) - 1 freq furwaird (2) - 1 freq foreword (2) - 4 freq forwirds (2) - 1 freq ferwerd (2) - 1 freq forwaard (2) - 1 freq forwart (3) - 4 freq forrid (3) - 1 freq furwirds (3) - 1 freq norward (3) - 1 freq firwid (3) - 1 freq for'ard (3) - 2 freq forrard (3) - 3 freq forwards (3) - 5 freq forrad (4) - 5 freq forwarded (4) - 2 freq ferried (4) - 2 freq forred (4) - 1 freq f-word (4) - 2 freq firewirk (4) - 2 freq forewarn (4) - 1 freq fordered (4) - 22 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 |
FORWIRD |
| Time to execute Levenshtein function - 0.211649 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.385517 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.029060 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.038386 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.000958 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. |