| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unraivels (0) - 1 freq unraivelt (1) - 2 freq onraivels (1) - 1 freq unraivel (1) - 3 freq unravel (2) - 1 freq traivels (2) - 18 freq navels (3) - 1 freq graivel's (3) - 1 freq raivens (3) - 1 freq traivel (3) - 66 freq graivelt (3) - 1 freq traivels' (3) - 1 freq unraivelled (3) - 1 freq raivel (3) - 3 freq raivelt (3) - 20 freq traivils (3) - 1 freq travels (3) - 10 freq unrael (3) - 1 freq graivel (3) - 5 freq traivelt (3) - 22 freq untaigelt (3) - 3 freq unfriens (4) - 2 freq untimely (4) - 5 freq crivens (4) - 8 freq raiders (4) - 5 freq |
unraivels (0) - 1 freq onraivels (1) - 1 freq unraivel (2) - 3 freq unraivelt (2) - 2 freq traivels (3) - 18 freq unravel (3) - 1 freq traivils (4) - 1 freq travels (4) - 10 freq navels (4) - 1 freq mairvels (5) - 1 freq trevels (5) - 4 freq nuvels (5) - 1 freq mervels (5) - 1 freq marvels (5) - 1 freq novels (5) - 29 freq traivelt (5) - 22 freq arrivals (5) - 3 freq rivals (5) - 3 freq unveils (5) - 1 freq graivel (5) - 5 freq graivelt (5) - 1 freq traivels' (5) - 1 freq traivel (5) - 66 freq raivens (5) - 1 freq graivel's (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 - UNRFLS unraivels - 1 freq |
UNRAIVELS |
| Time to execute Levenshtein function - 0.257887 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.396698 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.028535 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.038138 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.000983 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. |