| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| durward (0) - 2 freq forward (2) - 162 freq norward (2) - 1 freq aukward (2) - 1 freq dounward (2) - 1 freq durand (2) - 8 freq outward (2) - 2 freq furwaird (2) - 1 freq upward (2) - 5 freq bursary (3) - 1 freq ootward (3) - 6 freq edward (3) - 33 freq mustard (3) - 18 freq buzzard (3) - 3 freq toward (3) - 24 freq duror (3) - 1 freq tounward (3) - 1 freq donard (3) - 1 freq forwards (3) - 5 freq coward (3) - 12 freq bernard (3) - 5 freq doonward (3) - 5 freq draar (3) - 6 freq drear (3) - 10 freq ainward (3) - 4 freq |
durward (0) - 2 freq furwaird (3) - 1 freq forward (3) - 162 freq dounward (3) - 1 freq norward (3) - 1 freq ferwerd (4) - 1 freq forwaard (4) - 1 freq deilward (4) - 1 freq edward (4) - 33 freq reward (4) - 47 freq doonward (4) - 5 freq forwird (4) - 2 freq durand (4) - 8 freq outward (4) - 2 freq upward (4) - 5 freq aukward (4) - 1 freq launward (5) - 1 freq gerrard (5) - 1 freq for'ard (5) - 2 freq onward (5) - 5 freq garnard (5) - 1 freq furwur (5) - 1 freq gerard (5) - 2 freq dounwart (5) - 1 freq diregaird (5) - 1 freq |
SoundEx code - D663 durward - 2 freq drewratter - 1 freq |
MetaPhone code - TRWRT durward - 2 freq |
DURWARD |
| Time to execute Levenshtein function - 0.413774 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.799741 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.088749 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.105734 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.001007 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. |