| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nipscarts (0) - 1 freq nipscart (1) - 1 freq scarts (3) - 9 freq discards (3) - 1 freq nissart (3) - 3 freq hipsters (4) - 1 freq nipsiccar (4) - 1 freq dysarts (4) - 1 freq scarfs (4) - 4 freq siccart (4) - 1 freq scants (4) - 1 freq innarts (4) - 1 freq oscars (4) - 1 freq bastarts (4) - 24 freq smarts (4) - 1 freq scatts (4) - 1 freq nippers (4) - 2 freq scars (4) - 12 freq mitsyarty (4) - 1 freq upstart (4) - 1 freq heidscarfs (4) - 1 freq soarts (4) - 12 freq carts (4) - 2 freq scairts (4) - 1 freq scarns (4) - 1 freq |
nipscarts (0) - 1 freq nipscart (2) - 1 freq scarts (5) - 9 freq scairts (6) - 1 freq inserts (6) - 1 freq escorts (6) - 1 freq discards (6) - 1 freq nissart (6) - 3 freq descartes (6) - 3 freq exparts (7) - 1 freq parts (7) - 24 freq upwarts (7) - 2 freq ipsyzras (7) - 1 freq starts (7) - 181 freq nichts (7) - 159 freq nirts (7) - 2 freq scares (7) - 5 freq sarts (7) - 1 freq hippycrits (7) - 3 freq an'spoarts (7) - 1 freq insects (7) - 5 freq pasports (7) - 1 freq insichts (7) - 8 freq imparts (7) - 1 freq departs (7) - 2 freq |
SoundEx code - N126 nipscart - 1 freq novgorodian - 1 freq nipscarts - 1 freq nphegarty - 1 freq |
MetaPhone code - NPSKRTS nipscarts - 1 freq |
NIPSCARTS |
| Time to execute Levenshtein function - 0.295130 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.484837 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.030547 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.037815 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.000955 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. |