| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-answers (0) - 1 freq unanswert (4) - 1 freq answers (4) - 72 freq nor-easters (4) - 2 freq non-members (4) - 1 freq doncaster (5) - 4 freq non-scots (5) - 3 freq snashers (5) - 1 freq condenser (5) - 1 freq poetasters (5) - 1 freq longbangers (5) - 1 freq nonsense' (5) - 1 freq wonners (5) - 1 freq noo-a-deys (5) - 3 freq coasters (5) - 4 freq non-spikkers (5) - 2 freq answer- (5) - 1 freq dugs-'answers (5) - 1 freq nonsense- (5) - 2 freq onyane's (5) - 1 freq monsters (5) - 15 freq answer's (5) - 3 freq financiers (5) - 1 freq ans'ers (5) - 1 freq transfers (5) - 2 freq |
non-answers (0) - 1 freq nor-easters (7) - 2 freq non-members (7) - 1 freq answers (7) - 72 freq unanswert (7) - 1 freq unanswered (8) - 3 freq unnsers (8) - 1 freq non-speakers (8) - 3 freq unswers (8) - 1 freq non-work (8) - 1 freq non-scots (8) - 3 freq non-runner (9) - 1 freq answer (9) - 438 freq nashers (9) - 2 freq mannysters (9) - 1 freq bannisters (9) - 3 freq toonsers (9) - 6 freq nonsinse (9) - 1 freq snashers (9) - 1 freq contenders (9) - 1 freq answert (9) - 158 freq non-smoker (9) - 1 freq organisers (9) - 9 freq nor-wasterd (9) - 1 freq nonsense (9) - 77 freq |
SoundEx code - N552 ninian's - 3 freq newman's - 6 freq non-answers - 1 freq nae-nonsense - 1 freq nine-inch - 1 freq non-english - 5 freq ninians - 3 freq non-inclusion - 1 freq nae-man's-laund - 1 freq naming - 2 freq newmains - 1 freq nominees - 2 freq |
MetaPhone code - NNNSWRS non-answers - 1 freq |
NON-ANSWERS |
| Time to execute Levenshtein function - 0.243443 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.427952 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.027851 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.038206 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.000849 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. |