| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nixt-dorr (0) - 1 freq nixtdoor (2) - 1 freq next-door (2) - 2 freq neist-door (3) - 1 freq pit-doun (4) - 1 freq nicht-work (4) - 1 freq nixt-tim (4) - 1 freq sit-doun (4) - 1 freq nitre (5) - 1 freq histore (5) - 8 freq kildour (5) - 2 freq outdoor (5) - 7 freq history (5) - 481 freq dirtydoag (5) - 1 freq nithir (5) - 1 freq sixty-fower (5) - 4 freq pit-doons (5) - 2 freq nitemerrs (5) - 1 freq indoor (5) - 6 freq nithert (5) - 2 freq fit-dunt (5) - 1 freq nivermore (5) - 1 freq nott-book (5) - 1 freq di-does (5) - 1 freq nit-wit (5) - 1 freq |
nixt-dorr (0) - 1 freq next-door (3) - 2 freq nixtdoor (4) - 1 freq neist-door (5) - 1 freq nixt-tim (7) - 1 freq neestdoor (8) - 1 freq hert-sorry (8) - 2 freq nit-trie (8) - 2 freq naist-door's (8) - 1 freq sixty-fower (8) - 4 freq nuxtarn (8) - 1 freq nicht-work (8) - 1 freq pit-doun (8) - 1 freq nit-broun (8) - 1 freq sit-doun (8) - 1 freq ntahrr (8) - 1 freq ninety-odd (9) - 1 freq stetudor (9) - 1 freq fixted (9) - 1 freq non-dairy (9) - 1 freq extenders (9) - 1 freq pixtur (9) - 1 freq nifter (9) - 2 freq new-born (9) - 3 freq pitt-mirk (9) - 1 freq |
SoundEx code - N236 nocturne's - 1 freq nostrils - 20 freq nicht-air - 5 freq nosethirles - 1 freq nocturnal - 3 freq next-door - 2 freq nectar - 9 freq nostradamus - 2 freq neestdoor - 1 freq nastier - 1 freq nocturne - 2 freq nixtdoor - 1 freq nixt-dorr - 1 freq nasturtiums - 2 freq neesteran - 1 freq nightdress - 1 freq naist-door's - 1 freq negator - 6 freq nictheárlaich - 1 freq neist-door - 1 freq nicht-work - 1 freq nostre - 1 freq nostril - 1 freq nostril-flarin - 1 freq nicktroyftof - 2 freq nuxtarn - 1 freq nqtdrtgeqz - 1 freq |
MetaPhone code - NKSTTR next-door - 2 freq nixtdoor - 1 freq nixt-dorr - 1 freq |
NIXT-DORR |
| Time to execute Levenshtein function - 0.207326 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.396744 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.034120 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.041903 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.004658 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. |