| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foreword (0) - 4 freq forewird (1) - 6 freq forewurd (1) - 1 freq forewarn (2) - 1 freq foreswore (2) - 1 freq forward (2) - 158 freq firework (2) - 7 freq forwird (2) - 2 freq 'foreword' (2) - 1 freq forrard (3) - 3 freq foreshore (3) - 3 freq forenoon (3) - 6 freq foreerm (3) - 1 freq forwards (3) - 5 freq record (3) - 98 freq forlorn (3) - 8 freq foretoul (3) - 3 freq fore'er (3) - 1 freq f-word (3) - 2 freq firewid (3) - 26 freq owerword (3) - 1 freq firewark (3) - 2 freq hameword (3) - 1 freq remord (3) - 2 freq reward (3) - 46 freq |
foreword (0) - 4 freq forewurd (1) - 1 freq forewird (1) - 6 freq forwird (2) - 2 freq forward (2) - 158 freq forwaard (3) - 1 freq firework (3) - 7 freq ferwerd (3) - 1 freq forewarn (3) - 1 freq firewidd (4) - 3 freq firewark (4) - 2 freq owerword (4) - 1 freq reward (4) - 46 freq firebird (4) - 1 freq firewuid (4) - 1 freq firewid (4) - 26 freq furwaird (4) - 1 freq firewirk (4) - 2 freq for'ard (4) - 2 freq norward (4) - 1 freq forrard (4) - 3 freq 'foreword' (4) - 1 freq foreswore (4) - 1 freq owrewird (4) - 1 freq forwards (4) - 5 freq |
SoundEx code - F663 forward - 158 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 forewurd - 1 freq forrard - 3 freq firey-reid - 1 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 - 158 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 |
FOREWORD |
| Time to execute Levenshtein function - 0.210347 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.337439 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.026932 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.038120 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.000807 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. |