| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nedspeak (0) - 5 freq bespeak (2) - 1 freq €œnedspeak (2) - 1 freq €˜speak (3) - 1 freq €œspeak (3) - 2 freq weanspeak (3) - 1 freq letsspeak (3) - 1 freq respek (3) - 2 freq 'speak (3) - 8 freq speak (3) - 551 freq bedspread (3) - 4 freq bespak (3) - 1 freq respeck (3) - 77 freq soeak (4) - 1 freq neddies (4) - 2 freq reappear (4) - 6 freq elspeth (4) - 50 freq necessear (4) - 1 freq feldspar (4) - 1 freq nemsake (4) - 1 freq nede (4) - 3 freq bedsheet (4) - 2 freq prospeck (4) - 6 freq nemea (4) - 9 freq neiper (4) - 6 freq |
nedspeak (0) - 5 freq €œnedspeak (4) - 1 freq bespeak (4) - 1 freq 'speak (5) - 8 freq bespak (5) - 1 freq respek (5) - 2 freq speak (5) - 551 freq €˜speak (5) - 1 freq weanspeak (5) - 1 freq €œspeak (5) - 2 freq neds (6) - 32 freq spak (6) - 307 freq neesik (6) - 2 freq spoak (6) - 1 freq nemsake (6) - 1 freq neesick (6) - 1 freq inspeck (6) - 2 freq suspek (6) - 2 freq spek (6) - 1 freq respeck (6) - 77 freq bedspread (6) - 4 freq letsspeak (6) - 1 freq nedes (6) - 2 freq speik (6) - 52 freq needsna (6) - 2 freq |
SoundEx code - N321 noticeable - 2 freq nutjobs - 2 freq noticable - 1 freq notice-board - 1 freq nedspeak - 5 freq noticeably - 1 freq needs-foondit - 1 freq €œnedspeak - 1 freq ntcvq - 1 freq natgeophotos - 1 freq |
MetaPhone code - NTSPK nedspeak - 5 freq €œnedspeak - 1 freq |
NEDSPEAK |
| Time to execute Levenshtein function - 0.190223 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.354169 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.028876 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.038782 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.000848 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. |