| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itsdaibhi (0) - 1 freq isaiah (4) - 20 freq heresdaibhi (4) - 19 freq saich (5) - 1 freq straicht (5) - 129 freq iseabail (5) - 2 freq tashi (5) - 8 freq stgaight (5) - 1 freq unskaithd (5) - 1 freq insight (5) - 5 freq iabi (5) - 1 freq isabel (5) - 40 freq inscribed (5) - 4 freq staight (5) - 1 freq itida (5) - 1 freq skaithit (5) - 2 freq straight (5) - 236 freq csihi (5) - 1 freq taible (5) - 2 freq isaiah's (5) - 1 freq daith' (5) - 2 freq skaith (5) - 50 freq itricht (5) - 1 freq daichie (5) - 1 freq idaias (5) - 6 freq |
itsdaibhi (0) - 1 freq heresdaibhi (6) - 19 freq taobh (7) - 1 freq tarbh (7) - 1 freq sibh (7) - 2 freq tashi (7) - 8 freq svbhi (7) - 1 freq isaiah (7) - 20 freq itsa (8) - 1 freq itsael (8) - 1 freq gordaidh (8) - 3 freq disdainin (8) - 1 freq disdainit (8) - 1 freq isaboy (8) - 1 freq teddyb (8) - 1 freq it-maybae (8) - 1 freq taich (8) - 6 freq staibil (8) - 3 freq tysday (8) - 8 freq tascabili (8) - 1 freq disdain (8) - 10 freq tsb (8) - 1 freq tradable (8) - 1 freq dubh (8) - 4 freq tbh (8) - 35 freq |
SoundEx code - I323 idjeets - 1 freq itchit - 1 freq i'toast - 2 freq i'dustbin - 1 freq i'thocht - 1 freq id's-id's - 1 freq itched - 1 freq iahidsdwd - 1 freq itsdaibhi - 1 freq itstoohottosleep - 1 freq |
MetaPhone code - ITSTBH itsdaibhi - 1 freq |
ITSDAIBHI |
| Time to execute Levenshtein function - 0.204115 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.384820 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.028328 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.037495 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.000917 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. |