| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wormhole (0) - 11 freq wormholes (1) - 4 freq wormholed (1) - 1 freq €˜wormhole (2) - 1 freq wormhole's (2) - 1 freq porthole (2) - 1 freq bumhole (3) - 1 freq pothole (3) - 5 freq worthwile (3) - 1 freq gloryhole (3) - 2 freq workable (3) - 3 freq dormoose (3) - 116 freq hormone (3) - 4 freq whole (3) - 191 freq coalhole (3) - 1 freq shrrhole (3) - 1 freq norhope (3) - 5 freq worthelie (3) - 1 freq worthie (3) - 5 freq tod-hole (3) - 3 freq worth (4) - 251 freq torfle (4) - 1 freq womanly (4) - 2 freq worzel (4) - 1 freq roondhole (4) - 1 freq |
wormhole (0) - 11 freq wormholed (2) - 1 freq wormholes (2) - 4 freq worthelie (4) - 1 freq porthole (4) - 1 freq wormhole's (4) - 1 freq €˜wormhole (4) - 1 freq worthie (5) - 5 freq warmly (5) - 4 freq warmlie (5) - 3 freq wershly (5) - 1 freq whole (5) - 191 freq worthwile (5) - 1 freq workable (5) - 3 freq bumhole (5) - 1 freq warkable (6) - 1 freq warkhoose (6) - 2 freq wechle (6) - 1 freq warsle (6) - 24 freq worthy (6) - 21 freq arsehole (6) - 20 freq while (6) - 1458 freq wermyon (6) - 1 freq wirtwhile (6) - 1 freq ormal (6) - 1 freq |
SoundEx code - W654 warmlie - 3 freq wirm-like - 1 freq warmly - 4 freq wormholes - 4 freq wormhole - 11 freq wormhole's - 1 freq warm-like - 1 freq €˜wormhole - 1 freq wormholed - 1 freq weareonholiday - 1 freq |
MetaPhone code - WRMHL wormhole - 11 freq €˜wormhole - 1 freq |
WORMHOLE |
| Time to execute Levenshtein function - 0.486359 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.926405 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.079047 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.088385 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.001267 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. |