Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mensefu (0) - 39 freq pensefu (1) - 11 freq mense-fu (1) - 1 freq menseful (1) - 1 freq mensefou (1) - 2 freq mesefu (1) - 1 freq menses (2) - 1 freq eesefu (2) - 3 freq mensely (2) - 1 freq mense (2) - 60 freq minefu (2) - 1 freq vengefu (2) - 1 freq mensefae (2) - 1 freq meaninfu (3) - 3 freq meneer (3) - 1 freq mercifu (3) - 5 freq messed (3) - 8 freq minfu (3) - 1 freq menners (3) - 2 freq menner (3) - 4 freq neivefu (3) - 1 freq peacefu (3) - 12 freq sensed (3) - 18 freq meesery (3) - 5 freq tenshu (3) - 1 freq |
mensefu (0) - 39 freq mensefou (1) - 2 freq mesefu (2) - 1 freq mensefae (2) - 1 freq menseful (2) - 1 freq pensefu (2) - 11 freq mense-fu (2) - 1 freq minefu (3) - 1 freq mense (3) - 60 freq menses (3) - 1 freq mensely (3) - 1 freq manse (4) - 18 freq mens (4) - 2 freq mindfu (4) - 6 freq mensa (4) - 1 freq myndfu (4) - 1 freq manseyful (4) - 1 freq mensie (4) - 1 freq mensk (4) - 4 freq menes (4) - 6 freq meaninfu (4) - 3 freq minfu (4) - 1 freq vengefu (4) - 1 freq eesefu (4) - 3 freq mens' (4) - 2 freq |
SoundEx code - M521 mensefu - 39 freq mensefou - 2 freq monkfeish - 1 freq munageable - 1 freq minesweeper - 1 freq moonscape - 1 freq mancouver - 1 freq municipal - 2 freq monkfish - 2 freq mensefae - 1 freq mansfield - 5 freq mensefuness - 1 freq mense-free - 1 freq mensefulness - 1 freq mince-pies - 1 freq mensefu-like - 1 freq manageable - 1 freq menseful - 1 freq mensfu-like - 1 freq mense-fu - 1 freq mansefield - 1 freq munkibhoy - 1 freq munchbunch - 1 freq moneysavingexp - 1 freq mienewspaper - 1 freq mansplainin - 1 freq memsefciqk - 1 freq mannzabj - 1 freq monkeyflower - 1 freq manseyful - 1 freq |
MetaPhone code - MNSF mensefu - 39 freq mensefou - 2 freq mensefae - 1 freq mense-fu - 1 freq |
MENSEFU |
Time to execute Levenshtein function - 0.203888 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.423037 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.041264 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.051748 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.001144 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. |