| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wirkers (0) - 20 freq wurkers (1) - 6 freq wirkers' (1) - 2 freq wirker (1) - 5 freq wickers (1) - 1 freq winkers (1) - 1 freq workers (1) - 34 freq wiskers (1) - 1 freq wikkers (1) - 1 freq warkers (1) - 43 freq winners (2) - 30 freq markers (2) - 7 freq whiskers (2) - 22 freq mirker (2) - 1 freq wirkeens (2) - 1 freq werker (2) - 2 freq 'warkers (2) - 1 freq nickers (2) - 1 freq werrers (2) - 1 freq pickers (2) - 1 freq worker (2) - 24 freq birders (2) - 2 freq wirk's (2) - 1 freq wingers (2) - 1 freq chirkers (2) - 2 freq |
wirkers (0) - 20 freq workers (1) - 34 freq wurkers (1) - 6 freq warkers (1) - 43 freq wikkers (2) - 1 freq waarkers (2) - 4 freq wiskers (2) - 1 freq wurkirs (2) - 1 freq winkers (2) - 1 freq wirkers' (2) - 2 freq wickers (2) - 1 freq wirker (2) - 5 freq porkers (3) - 2 freq warker (3) - 7 freq merkers (3) - 1 freq wankers (3) - 5 freq wirkies (3) - 1 freq wurker (3) - 3 freq warkers' (3) - 1 freq waukers (3) - 1 freq yerkers (3) - 2 freq mairkers (3) - 1 freq wirkins (3) - 7 freq werker (3) - 2 freq wirkeens (3) - 1 freq |
SoundEx code - W626 wirkers - 20 freq workers - 34 freq worker - 24 freq wirker - 5 freq werker - 2 freq wurker - 3 freq wurkers - 6 freq warker - 7 freq warkers - 43 freq warkers' - 1 freq wurkhoarse - 1 freq wirk-rochened - 1 freq workers' - 3 freq 'warkers - 1 freq worser - 3 freq wirk-a-wark - 1 freq waarkers - 4 freq warkrooms - 1 freq wurkur - 3 freq wirkers' - 2 freq warkar - 1 freq warwickshire-born - 1 freq wark-oors - 1 freq wurkirs - 1 freq warricker - 1 freq |
MetaPhone code - WRKRS wirkers - 20 freq workers - 34 freq wurkers - 6 freq warkers - 43 freq warkers' - 1 freq workers' - 3 freq 'warkers - 1 freq waarkers - 4 freq wirkers' - 2 freq wark-oors - 1 freq wurkirs - 1 freq |
WIRKERS |
| Time to execute Levenshtein function - 0.164381 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.326490 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.027468 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.037223 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.000934 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. |