| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norward (0) - 1 freq norwards (1) - 1 freq forward (1) - 162 freq norwa (2) - 3 freq howard (2) - 4 freq norrad (2) - 1 freq for'ard (2) - 2 freq forwaard (2) - 1 freq forrard (2) - 3 freq ootward (2) - 6 freq forwart (2) - 4 freq durward (2) - 2 freq norland (2) - 9 freq forwards (2) - 5 freq toward (2) - 24 freq norway (2) - 15 freq coward (2) - 12 freq forwird (2) - 2 freq onward (2) - 5 freq morear (3) - 3 freq steward (3) - 2 freq morcar (3) - 4 freq gerrard (3) - 1 freq normans (3) - 3 freq norway's (3) - 4 freq |
norward (0) - 1 freq norwards (2) - 1 freq forward (2) - 162 freq forwaard (3) - 1 freq onward (3) - 5 freq durward (3) - 2 freq forwird (3) - 2 freq norrad (3) - 1 freq forewurd (4) - 1 freq foreword (4) - 4 freq ainward (4) - 4 freq reward (4) - 47 freq inward (4) - 7 freq oanward (4) - 1 freq untoward (4) - 1 freq narraed (4) - 1 freq forewird (4) - 6 freq ferwerd (4) - 1 freq coward (4) - 12 freq ootward (4) - 6 freq forwart (4) - 4 freq forrard (4) - 3 freq for'ard (4) - 2 freq norwa (4) - 3 freq howard (4) - 4 freq |
SoundEx code - N663 norward - 1 freq norwards - 1 freq |
MetaPhone code - NRWRT norward - 1 freq |
NORWARD |
| Time to execute Levenshtein function - 0.215069 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.441321 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.039082 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.040295 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.000908 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. |