| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wachman (0) - 1 freq watchman (1) - 1 freq wachmen (1) - 1 freq jackman (2) - 2 freq wamman (2) - 1 freq pac-man (2) - 1 freq wachlin (2) - 2 freq achan (2) - 2 freq winchman (2) - 1 freq coachman (2) - 3 freq richman (2) - 1 freq walkman (2) - 3 freq washan (2) - 3 freq packman (2) - 3 freq warman (2) - 2 freq watchan (2) - 20 freq wachtin (2) - 1 freq lachlan (2) - 1 freq wan-man (2) - 1 freq watchmen (2) - 1 freq sacan (3) - 1 freq wachty (3) - 1 freq clachan (3) - 101 freq fatman (3) - 1 freq weman (3) - 1 freq |
wachman (0) - 1 freq wachmen (1) - 1 freq watchman (2) - 1 freq coachman (3) - 3 freq watchmen (3) - 1 freq wachtin (3) - 1 freq richman (3) - 1 freq winchman (3) - 1 freq wachlin (3) - 2 freq wauchlin (4) - 1 freq lachlan (4) - 1 freq wechtin (4) - 13 freq waachin (4) - 1 freq waichtin (4) - 2 freq waachlin (4) - 1 freq scheman (4) - 1 freq wan-man (4) - 1 freq achan (4) - 2 freq watchan (4) - 20 freq packman (4) - 3 freq washan (4) - 3 freq pac-man (4) - 1 freq wamman (4) - 1 freq walkman (4) - 3 freq warman (4) - 2 freq |
SoundEx code - W255 wiseman's - 1 freq waukenin - 7 freq wakenin - 2 freq weakenin - 2 freq wakkenin - 2 freq wiseman - 1 freq wesminster - 1 freq waakenin - 2 freq weak-minded - 1 freq wakening - 2 freq wisemans - 2 freq wachman - 1 freq wachmen - 1 freq waakenan - 1 freq waik-mindit - 1 freq wycement - 1 freq wauknin - 1 freq wisening - 1 freq wycewummin - 2 freq wycewumman - 3 freq |
MetaPhone code - WXMN wachman - 1 freq wachmen - 1 freq watchman - 1 freq watchmen - 1 freq watchman-- - 1 freq |
WACHMAN |
| Time to execute Levenshtein function - 0.221288 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.406566 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.027738 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.037484 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.000864 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. |