| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nursery (0) - 29 freq nurses (2) - 35 freq surgery (2) - 29 freq bursary (2) - 1 freq nurse (2) - 169 freq cursory (2) - 5 freq nurse's (2) - 13 freq nursed (2) - 5 freq yursel (3) - 10 freq nurseries (3) - 1 freq burbury (3) - 2 freq rsyry (3) - 1 freq aunser (3) - 2 freq ursel (3) - 2 freq burgers (3) - 11 freq burley (3) - 1 freq oursel (3) - 2 freq pursuers (3) - 1 freq hurry (3) - 147 freq rubbery (3) - 7 freq curseen (3) - 1 freq narrer (3) - 2 freq 'ursel (3) - 1 freq cutlery (3) - 15 freq lurkey (3) - 10 freq |
nursery (0) - 29 freq cursory (3) - 5 freq nursed (3) - 5 freq nurses (3) - 35 freq nurse (3) - 169 freq bursary (3) - 1 freq norse (4) - 53 freq nursan (4) - 3 freq nurture (4) - 5 freq narrer (4) - 2 freq neurer (4) - 1 freq worser (4) - 3 freq nursie (4) - 4 freq unser (4) - 3 freq nursin (4) - 29 freq nurst (4) - 2 freq nirse (4) - 1 freq nurtur (4) - 1 freq nerrer (4) - 2 freq nasser (4) - 1 freq nurseries (4) - 1 freq pursuer (4) - 2 freq nurse's (4) - 13 freq surgery (4) - 29 freq rsyry (4) - 1 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.179829 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.349727 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.029402 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.039145 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.001197 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. |