| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-partisan (0) - 2 freq non-nation (4) - 1 freq partisan (4) - 3 freq pairtisan (5) - 1 freq non-herdin (5) - 1 freq artisan (5) - 3 freq non-votin (5) - 1 freq non-pairty (5) - 1 freq non-shaetlan (5) - 1 freq nonpareil (5) - 1 freq non-native (5) - 2 freq non-paid (5) - 1 freq non-fiction (5) - 4 freq comparison (5) - 17 freq impartial (6) - 1 freq consarnin (6) - 1 freq noo-hatit (6) - 1 freq non-english (6) - 5 freq nonagenarian (6) - 1 freq non-dramein (6) - 1 freq ex-partick (6) - 1 freq on-birthday (6) - 3 freq soartsae (6) - 1 freq notican (6) - 1 freq non-lethal (6) - 1 freq |
non-partisan (0) - 2 freq partisan (7) - 3 freq non-pairty (7) - 1 freq non-nation (7) - 1 freq pairtisan (8) - 1 freq non-fiction (8) - 4 freq non-shaetlan (8) - 1 freq in-person (8) - 1 freq non-herdin (8) - 1 freq non-votin (8) - 1 freq unsportin (9) - 1 freq non-scots (9) - 3 freq non-dramein (9) - 1 freq bandparts (9) - 1 freq fun-raisin (9) - 1 freq in-pittin (9) - 1 freq non-paid (9) - 1 freq nonpareil (9) - 1 freq comparison (9) - 17 freq artisan (9) - 3 freq non-native (9) - 2 freq contortin (10) - 1 freq partin (10) - 5 freq pairtisay (10) - 1 freq partan (10) - 17 freq |
SoundEx code - N516 number - 174 freq numbers - 65 freq nine-bars - 1 freq numbered - 6 freq non-partisan - 2 freq number-plates - 1 freq non-pairty - 1 freq nambarrie - 1 freq number'll - 1 freq nonpareil - 1 freq nanbreid - 1 freq nonpairlament - 1 freq €œnumber - 1 freq nhmbr - 1 freq |
MetaPhone code - NNPRTSN non-partisan - 2 freq |
NON-PARTISAN |
| Time to execute Levenshtein function - 0.207768 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.383768 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.027712 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.038321 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.000903 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. |