| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nurses (0) - 35 freq curses (1) - 8 freq purses (1) - 1 freq nurse's (1) - 13 freq nurse (1) - 169 freq nursed (1) - 5 freq urss (2) - 1 freq verses (2) - 59 freq nurst (2) - 2 freq bursen (2) - 6 freq cursen (2) - 1 freq wurse (2) - 16 freq purves (2) - 21 freq oursels (2) - 3 freq nirse (2) - 1 freq norse (2) - 53 freq nursery (2) - 29 freq wursels (2) - 7 freq arses (2) - 7 freq cures (2) - 4 freq nuris (2) - 1 freq uises (2) - 36 freq noses (2) - 20 freq nursit (2) - 1 freq nursie (2) - 4 freq |
nurses (0) - 35 freq curses (2) - 8 freq nursed (2) - 5 freq nurse (2) - 169 freq nurse's (2) - 13 freq purses (2) - 1 freq burss (3) - 1 freq nouriss (3) - 3 freq airses (3) - 3 freq norskes (3) - 1 freq nursie (3) - 4 freq nursan (3) - 3 freq nories (3) - 25 freq noises (3) - 33 freq erses (3) - 23 freq ruises (3) - 1 freq corses (3) - 1 freq ruses (3) - 1 freq nursit (3) - 1 freq nerves (3) - 44 freq courses (3) - 13 freq horses (3) - 113 freq nursin (3) - 29 freq nirse (3) - 1 freq norse (3) - 53 freq |
SoundEx code - N622 narcissus - 4 freq nurses - 35 freq narcissistic - 3 freq narcissism - 1 freq nurse's - 13 freq nuraghes - 1 freq norskies - 1 freq norskes - 1 freq nyaragusu - 1 freq nnmrgais - 1 freq narcissists - 1 freq |
MetaPhone code - NRSS nurses - 35 freq nurse's - 13 freq |
NURSES |
| Time to execute Levenshtein function - 0.188881 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.336964 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.028154 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.037593 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.001036 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. |