| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forwards (0) - 5 freq forward (1) - 162 freq forwirds (1) - 1 freq norwards (1) - 1 freq forwardin (2) - 1 freq furwirds (2) - 1 freq forrard (2) - 3 freq forwird (2) - 2 freq 'forward' (2) - 1 freq cowards (2) - 5 freq forearms (2) - 1 freq for'ard (2) - 2 freq ootwards (2) - 12 freq coowards (2) - 1 freq fitwards (2) - 1 freq forwaard (2) - 1 freq onwards (2) - 19 freq norward (2) - 1 freq forwarded (2) - 2 freq forwart (2) - 4 freq towards (2) - 170 freq friars (3) - 4 freq forbad (3) - 5 freq afterwards (3) - 15 freq inwards (3) - 7 freq |
forwards (0) - 5 freq forwirds (1) - 1 freq norwards (2) - 1 freq furwirds (2) - 1 freq forward (2) - 162 freq forwaard (3) - 1 freq fitwards (3) - 1 freq forwird (3) - 2 freq forwarded (3) - 2 freq forwardin (3) - 1 freq ferwerd (4) - 1 freq afterwards (4) - 15 freq rewards (4) - 6 freq forewurd (4) - 1 freq foreword (4) - 4 freq forewird (4) - 6 freq eftirwards (4) - 2 freq efterwards (4) - 17 freq furwaird (4) - 1 freq towards (4) - 170 freq for'ard (4) - 2 freq forwart (4) - 4 freq forearms (4) - 1 freq cowards (4) - 5 freq forrard (4) - 3 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 - FRWRTS furwirds - 1 freq forwards - 5 freq forwirds - 1 freq |
FORWARDS forward - 162 freq forwards - 5 freq fowert - 10 freq forrit - 529 freq |
| Time to execute Levenshtein function - 0.180715 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.361032 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.028111 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.037312 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.000925 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. |