| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnermine (0) - 3 freq undermine (1) - 1 freq unnerline (1) - 2 freq unnermines (1) - 1 freq undermined (2) - 1 freq unnerminin (2) - 1 freq underline (2) - 3 freq unnerlined (2) - 2 freq unnerpins (2) - 2 freq unnerside (2) - 1 freq unnertone (2) - 2 freq unnerin (2) - 1 freq unnervin (2) - 1 freq unnerpin (2) - 1 freq unnergane (2) - 1 freq unnerlie (2) - 1 freq unner-sie (3) - 2 freq unnerlyin (3) - 6 freq unnerfit (3) - 5 freq uterine (3) - 1 freq unnerpinned (3) - 4 freq undertone (3) - 1 freq wunnering (3) - 2 freq underlines (3) - 1 freq unnerwent (3) - 1 freq |
unnermine (0) - 3 freq unnerline (2) - 2 freq unnermines (2) - 1 freq undermine (2) - 1 freq unnerin (3) - 1 freq unnervin (3) - 1 freq unnerpin (3) - 1 freq unnertone (3) - 2 freq unnergane (3) - 1 freq unnerminin (3) - 1 freq undermined (4) - 1 freq unnerside (4) - 1 freq unnerlyin (4) - 6 freq unnerlie (4) - 1 freq underline (4) - 3 freq unnerpins (4) - 2 freq unnerlined (4) - 2 freq wunnerin (5) - 83 freq unnerlinin (5) - 2 freq unnerwye (5) - 1 freq dunnerin (5) - 8 freq unnersung (5) - 1 freq underpin (5) - 1 freq unhairmin (5) - 1 freq informin (5) - 4 freq |
SoundEx code - U565 unerrinly - 1 freq unnerneath - 25 freq unreined - 1 freq unoorament - 1 freq unarmed - 5 freq unourament - 1 freq unnermine - 3 freq unairmed - 1 freq unromantic - 2 freq unhermed - 4 freq 'unhermed - 1 freq unhairmin - 1 freq unrimed - 1 freq unrantered - 1 freq unrunklin - 1 freq unrounded - 9 freq unroonded - 1 freq unremarkable - 2 freq unrung - 1 freq unnerin - 1 freq unharnessed - 1 freq unnerwent - 1 freq unnermines - 1 freq unremittin - 1 freq unrenewable - 2 freq unnerminin - 1 freq unhairmed - 1 freq unnernathe - 1 freq |
MetaPhone code - UNRMN unnermine - 3 freq |
UNNERMINE |
| Time to execute Levenshtein function - 0.245214 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.404839 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.029142 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.039040 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.000922 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. |