Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nursery (0) - 29 freq nurse (2) - 163 freq cursory (2) - 5 freq nurse's (2) - 10 freq nursed (2) - 5 freq bursary (2) - 1 freq nurses (2) - 35 freq surgery (2) - 29 freq uiser (3) - 5 freq curse'd (3) - 2 freq nurture (3) - 5 freq furry (3) - 22 freq numero (3) - 1 freq curses (3) - 8 freq nurse-an (3) - 3 freq nerrer (3) - 2 freq turse (3) - 1 freq fursday (3) - 1 freq quiskery (3) - 1 freq guttery (3) - 3 freq nummer (3) - 336 freq hurley (3) - 2 freq nursit (3) - 1 freq nutter (3) - 5 freq oursel (3) - 1 freq |
nursery (0) - 29 freq nurses (3) - 35 freq nursed (3) - 5 freq bursary (3) - 1 freq cursory (3) - 5 freq nurse (3) - 163 freq nurst (4) - 2 freq nursit (4) - 1 freq nurseries (4) - 1 freq neurer (4) - 1 freq norse (4) - 53 freq naurer (4) - 1 freq nursan (4) - 3 freq nasser (4) - 1 freq nirse (4) - 1 freq worser (4) - 3 freq unser (4) - 3 freq pursuer (4) - 2 freq nursie (4) - 4 freq aunser (4) - 2 freq nurture (4) - 5 freq rsyry (4) - 1 freq nursin (4) - 29 freq nurtur (4) - 1 freq narrer (4) - 2 freq |
SoundEx code - N626 nursery - 29 freq nae-regrettedly - 1 freq nurseries - 1 freq neregretterien - 2 freq nursery-slope - 1 freq norseroots - 1 freq |
MetaPhone code - NRSR nursery - 29 freq |
NURSERY |
Time to execute Levenshtein function - 0.171710 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.345114 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.027819 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.045022 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.000811 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. |