| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unannounced (0) - 1 freq un-announced (1) - 1 freq announced (2) - 33 freq announce (3) - 7 freq announces (3) - 12 freq announcer (3) - 1 freq annunced (3) - 2 freq annoonced (3) - 9 freq announcin (4) - 4 freq unbounce (4) - 1 freq annooncet (4) - 1 freq denounced (4) - 2 freq unnoticed (4) - 3 freq unfounded (4) - 1 freq unrounded (4) - 9 freq annoonce (4) - 4 freq unboonced (4) - 1 freq pronounced (4) - 29 freq renounced (4) - 1 freq annoonces (4) - 1 freq announcers (4) - 1 freq anoonced (4) - 2 freq unconvinced (4) - 1 freq annuncee (4) - 1 freq runaround (5) - 1 freq |
unannounced (0) - 1 freq un-announced (2) - 1 freq announced (3) - 33 freq annunced (4) - 2 freq annoonced (4) - 9 freq announce (5) - 7 freq announces (5) - 12 freq announcer (5) - 1 freq pronounced (6) - 29 freq unboonced (6) - 1 freq renounced (6) - 1 freq annuncee (6) - 1 freq annoonce (6) - 4 freq unconvinced (6) - 1 freq annoonces (6) - 1 freq anoonced (6) - 2 freq annooncet (6) - 1 freq announcin (6) - 4 freq denounced (6) - 2 freq unnoticed (6) - 3 freq unbalanced (7) - 1 freq anninted (7) - 2 freq pronunced (7) - 3 freq annoyance (7) - 12 freq annooncin (7) - 3 freq |
SoundEx code - U555 un-announced - 1 freq unannounced - 1 freq unanimous - 2 freq unmeanan - 1 freq unenin - 1 freq unanimously - 3 freq |
MetaPhone code - UNNNST un-announced - 1 freq unannounced - 1 freq |
UNANNOUNCED |
| Time to execute Levenshtein function - 0.202979 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.395780 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.027739 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.038927 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.001064 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. |