| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerneath (0) - 25 freq underneath (1) - 22 freq underneat (2) - 2 freq undurneath (2) - 1 freq unnernathe (2) - 1 freq unnerwear (3) - 1 freq unnerwent (3) - 1 freq unnerfelt (3) - 1 freq underearth (3) - 1 freq unnerratit (4) - 2 freq unnerfit (4) - 4 freq unnerthe (4) - 1 freq unnerway (4) - 1 freq unnertak (4) - 4 freq unnerthreat (4) - 1 freq unnerpeyed (4) - 1 freq wunnerment (4) - 2 freq unnerstans (4) - 2 freq unnercuts (4) - 1 freq hunneryear (4) - 1 freq internet (4) - 71 freq unnerved (4) - 2 freq unnergane (4) - 1 freq unnerlay (4) - 1 freq understate (4) - 1 freq |
unnerneath (0) - 25 freq underneath (2) - 22 freq unnernathe (2) - 1 freq undurneath (3) - 1 freq underneat (4) - 2 freq unnerthe (5) - 1 freq underearth (5) - 1 freq unnerwent (5) - 1 freq nineteenth (6) - 13 freq unnerteuk (6) - 1 freq internet (6) - 71 freq internett (6) - 1 freq unnerstaun (6) - 206 freq innerness (6) - 1 freq unnerstaan (6) - 15 freq unnerfuit (6) - 1 freq unnercuts (6) - 1 freq unnerstan (6) - 49 freq unnertaen (6) - 3 freq unnerfit (6) - 4 freq unnertak (6) - 4 freq unnerratit (6) - 2 freq unnerfelt (6) - 1 freq unnerwear (6) - 1 freq unnertone (7) - 2 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 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 unromantic - 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 - UNRN0 unnerneath - 25 freq unnernathe - 1 freq |
UNNERNEATH |
| Time to execute Levenshtein function - 0.318401 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.573046 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.027771 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.037585 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.000829 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. |