| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irishartists (0) - 1 freq airtists (5) - 20 freq shortlists (5) - 1 freq reservists (5) - 1 freq irishness (5) - 1 freq dishertit (5) - 1 freq artists (5) - 24 freq daihatsus (6) - 1 freq visualises (6) - 1 freq ridbreist (6) - 1 freq absolutists (6) - 1 freq shargit (6) - 2 freq districts (6) - 5 freq mishanters (6) - 14 freq brightniss (6) - 1 freq dramatist (6) - 2 freq shortest (6) - 1 freq brieists (6) - 1 freq prismatic (6) - 1 freq mishapit (6) - 1 freq brightest (6) - 3 freq girseruits (6) - 1 freq sarpints (6) - 1 freq spartilt (6) - 1 freq smartie's (6) - 1 freq |
irishartists (0) - 1 freq shortlists (7) - 1 freq reservists (7) - 1 freq shortest (8) - 1 freq separatists (8) - 1 freq airtists (8) - 20 freq dishertit (8) - 1 freq artists (8) - 24 freq irishness (8) - 1 freq thrists (9) - 2 freq restraints (9) - 1 freq artistes (9) - 2 freq shettirts (9) - 1 freq shortlist (9) - 1 freq dishertent (9) - 2 freq absolutists (9) - 1 freq scientists (9) - 15 freq ahrtist (9) - 1 freq arsonists (9) - 2 freq reservist (9) - 3 freq smartest (9) - 4 freq airtist (10) - 15 freq richard's (10) - 2 freq richtit (10) - 2 freq rainforests (10) - 1 freq |
SoundEx code - I626 ireacherie - 1 freq irishrugby - 1 freq irishartists - 1 freq |
MetaPhone code - IRXRTSTS irishartists - 1 freq |
IRISHARTISTS |
| Time to execute Levenshtein function - 0.240554 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.404130 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.027994 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.037022 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.000907 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. |