| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerpins (0) - 2 freq unnerpin (1) - 1 freq unnermine (2) - 3 freq unnerpass (2) - 2 freq unnermines (2) - 1 freq unnerline (2) - 2 freq underpin (2) - 1 freq unnerin (2) - 1 freq unnervin (2) - 1 freq underpass (3) - 1 freq underlines (3) - 1 freq wunnerin (3) - 83 freq unnersung (3) - 1 freq unnerstans (3) - 2 freq sneerins (3) - 1 freq unnerpinned (3) - 4 freq unnerdugs (3) - 1 freq unnergane (3) - 1 freq unnercuts (3) - 1 freq unnerlined (3) - 2 freq dunnerin (3) - 8 freq wannerins (3) - 3 freq unnerlinin (3) - 2 freq unnerlyin (3) - 6 freq unnerwent (3) - 1 freq |
unnerpins (0) - 2 freq unnerpin (2) - 1 freq unnermines (3) - 1 freq unnerpass (3) - 2 freq unnerin (4) - 1 freq underpin (4) - 1 freq unnervin (4) - 1 freq unnerline (4) - 2 freq unnermine (4) - 3 freq unnerlined (5) - 2 freq unnerlinin (5) - 2 freq wannerins (5) - 3 freq unnerlyin (5) - 6 freq unnerves (5) - 1 freq unnercuts (5) - 1 freq unnerpinnin (5) - 3 freq unnerminin (5) - 1 freq unnerwent (5) - 1 freq unnertone (5) - 2 freq underlines (5) - 1 freq underpass (5) - 1 freq unnersung (5) - 1 freq unnerstans (5) - 2 freq sneerins (5) - 1 freq unnerdugs (5) - 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 - UNRPNS unnerpins - 2 freq |
UNNERPINS |
| Time to execute Levenshtein function - 0.242603 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.400985 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.027357 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.041301 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.000944 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. |