| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nichtfaw (0) - 2 freq nichtfa (1) - 2 freq nichtfaa (1) - 2 freq richtfa (2) - 3 freq nicht-faa (2) - 1 freq richtfae (2) - 2 freq 'nichtfa' (2) - 1 freq michtna (3) - 22 freq nicht-it (3) - 1 freq nichtmare (3) - 14 freq nightcap (3) - 3 freq michtnae (3) - 2 freq nichtÂ’s (3) - 1 freq nicht's (3) - 38 freq nicht' (3) - 2 freq nicht (3) - 2275 freq nichtly (3) - 4 freq fichtan (3) - 1 freq nightah (3) - 1 freq nichts (3) - 159 freq nechtan (3) - 1 freq richtfou (3) - 2 freq richtfoo (3) - 1 freq lichtfu (3) - 5 freq nichty (3) - 3 freq |
nichtfaw (0) - 2 freq nichtfaa (2) - 2 freq nichtfa (2) - 2 freq 'nichtfa' (4) - 1 freq richtfae (4) - 2 freq richtfa (4) - 3 freq nicht-faa (4) - 1 freq lichtfu (5) - 5 freq richtfoo (5) - 1 freq nechtan (5) - 1 freq nichty (5) - 3 freq richtfou (5) - 2 freq michtfu (5) - 1 freq nichts (5) - 159 freq richtfu (5) - 15 freq nicht-air (5) - 5 freq richtfu' (5) - 1 freq nichts' (5) - 3 freq nichtie (5) - 6 freq nicht-it (5) - 1 freq nichtmare (5) - 14 freq nicht' (5) - 2 freq nicht's (5) - 38 freq nichtly (5) - 4 freq nicht (5) - 2275 freq |
SoundEx code - N231 nichtfaw - 2 freq nosedive - 1 freq negatively - 2 freq negativity - 7 freq nest-feitherin - 1 freq nest-featherin - 1 freq negative - 41 freq nocht-fiction - 3 freq nochtfiction - 1 freq nicht-flittins - 1 freq nichtfa - 2 freq nicht-faa - 1 freq 'nichtfa' - 1 freq €˜negative - 1 freq nichtbour - 2 freq nest-biggin - 1 freq negatives - 3 freq negitively - 1 freq nichtfaa - 2 freq neuk-o-the-back - 1 freq negativitiy's - 1 freq nickstoppani - 9 freq nsyutdyp - 1 freq nhsthebrave - 1 freq nctpehgy - 1 freq nyqtf - 1 freq |
MetaPhone code - NXTF nichtfaw - 2 freq nichtfa - 2 freq nicht-faa - 1 freq 'nichtfa' - 1 freq nichtfaa - 2 freq |
NICHTFAW |
| Time to execute Levenshtein function - 0.193038 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.374529 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.028851 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.046720 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.001180 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. |