| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nihil (0) - 4 freq nikhil (1) - 1 freq nihin (1) - 5 freq nobil (2) - 1 freq ahil (2) - 1 freq nisi (2) - 5 freq niall (2) - 5 freq novil (2) - 3 freq ochil (2) - 4 freq neidil (2) - 1 freq enihin (2) - 1 freq nuhin (2) - 48 freq shil (2) - 1 freq niki (2) - 1 freq i'il (2) - 2 freq ihis (2) - 6 freq thil (2) - 2 freq nicol (2) - 19 freq nigel (2) - 49 freq civil (2) - 38 freq nivir (2) - 180 freq nohin (2) - 1 freq nithir (2) - 1 freq niel (2) - 1 freq nkhl (2) - 1 freq |
nihil (0) - 4 freq nihin (2) - 5 freq nikhil (2) - 1 freq nohin (3) - 1 freq niel (3) - 1 freq nigel (3) - 49 freq nicol (3) - 19 freq nkhl (3) - 1 freq neil (3) - 87 freq nail (3) - 46 freq nirl (3) - 1 freq nial (3) - 4 freq phil (3) - 29 freq nih (3) - 1 freq nichol (3) - 25 freq nil (3) - 7 freq thil (3) - 2 freq novil (3) - 3 freq ochil (3) - 4 freq niall (3) - 5 freq ahil (3) - 1 freq nobil (3) - 1 freq enihin (3) - 1 freq neidil (3) - 1 freq nuhin (3) - 48 freq |
SoundEx code - N400 neill - 17 freq nile - 14 freq newly - 27 freq nil - 7 freq nalll - 1 freq nail - 46 freq niall - 5 freq nial - 4 freq nell - 13 freq nae-weel - 6 freq nellie - 42 freq nelly - 8 freq newall - 1 freq niel - 1 freq nool - 1 freq nael - 2 freq newlee - 1 freq naywuly - 1 freq neil - 87 freq no-he'll - 1 freq nilly - 1 freq neilly - 12 freq nila - 1 freq nol - 1 freq nihil - 4 freq no-weill - 3 freq no-weel - 1 freq neal - 1 freq naeweel - 1 freq noel - 1 freq newlie - 1 freq nellie- - 1 freq €™nal - 1 freq €™neill - 1 freq nal - 1 freq nnywlo - 1 freq n'all - 2 freq nueuul - 1 freq nl - 6 freq niyowal - 1 freq nle - 1 freq neale - 1 freq nll - 1 freq null - 2 freq |
MetaPhone code - NHL no-he'll - 1 freq nihil - 4 freq |
NIHIL |
| Time to execute Levenshtein function - 0.341116 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.599200 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.068679 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.093986 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.000941 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. |