Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unnerwaffs (0) - 1 freq unnerpass (3) - 2 freq unnerwarld (3) - 4 freq unnerway (3) - 1 freq unnerpins (4) - 2 freq unnercuts (4) - 1 freq unnertaen (4) - 3 freq unnerwent (4) - 1 freq underwater (4) - 3 freq unnertakin (4) - 1 freq unnerwey (4) - 1 freq underpass (4) - 1 freq unnernathe (4) - 1 freq unnerstauns (4) - 4 freq underwaiy (4) - 1 freq unnercless (4) - 2 freq unnermines (4) - 1 freq underway (4) - 1 freq unnerstans (4) - 2 freq unnerwye (4) - 1 freq unnerves (4) - 1 freq underwires (4) - 1 freq unnerlay (4) - 1 freq unnergane (4) - 1 freq unnerwatter (4) - 1 freq |
unnerwaffs (0) - 1 freq unnerpass (6) - 2 freq unnerway (6) - 1 freq unnerwarld (6) - 4 freq underwires (7) - 1 freq unnerwatter (7) - 1 freq unnerves (7) - 1 freq unnerstans (7) - 2 freq underwear's (7) - 1 freq unnerwye (7) - 1 freq innerdaeks (7) - 1 freq unnerdugs (7) - 1 freq unnerworld (7) - 1 freq unnermines (7) - 1 freq unnerwear (7) - 1 freq unner-fed (7) - 1 freq unnerfit (7) - 5 freq unnerwent (7) - 1 freq unnercuts (7) - 1 freq unnerpins (7) - 2 freq unnerwey (7) - 1 freq unnerstauns (7) - 4 freq unnercless (7) - 2 freq nyaffs (8) - 6 freq gnyaffs (8) - 1 freq |
SoundEx code - U561 unraivel - 3 freq unnerfelt - 1 freq unripened - 1 freq unnerfit - 5 freq unrepentant - 1 freq unnerved - 2 freq unraivels - 1 freq unwrappit - 2 freq unwrap - 2 freq unreffel - 3 freq unravel - 1 freq unravelled - 1 freq unwrapped - 3 freq unraveller - 1 freq unnerves - 1 freq unnerpinnin - 3 freq unnerpinned - 4 freq unnerpin - 1 freq unnerpins - 2 freq unraivelled - 1 freq unraivelt - 2 freq unwrappt - 1 freq unroofed - 1 freq unravellin - 1 freq unner-pairts - 1 freq unnerfundin - 1 freq unnerfundit - 1 freq unnerfuit - 1 freq unnerwaffs - 1 freq unnerpass - 2 freq unnerpeyed - 1 freq unner-fed - 1 freq unner-appreciatit - 1 freq unnervin - 1 freq unrepresentative - 1 freq unnerrepresentit - 2 freq |
MetaPhone code - UNRWFS unnerwaffs - 1 freq |
UNNERWAFFS |
Time to execute Levenshtein function - 0.216737 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.421552 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.028182 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.049124 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.000961 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. |