| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adjustit (0) - 7 freq adjustin (1) - 6 freq adjust (2) - 10 freq adjusts (2) - 1 freq 'adjustit' (2) - 1 freq adjusted (2) - 5 freq dustit (2) - 5 freq accostit (3) - 4 freq accusit (3) - 1 freq admittit (3) - 10 freq adjustment (3) - 1 freq arrestit (3) - 7 freq jestit (3) - 1 freq addictit (3) - 1 freq attestit (3) - 6 freq twustit (3) - 1 freq aduneit (3) - 1 freq adjutant (3) - 1 freq justin (3) - 6 freq dystit (3) - 1 freq adjustmints (3) - 1 freq rustit (3) - 3 freq assistit (3) - 1 freq ambushit (3) - 1 freq trustit (3) - 16 freq |
adjustit (0) - 7 freq adjustin (2) - 6 freq dustit (3) - 5 freq adjusted (3) - 5 freq adjusts (3) - 1 freq adjust (3) - 10 freq dystit (4) - 1 freq adjusteed (4) - 1 freq dvstit (4) - 1 freq jestit (4) - 1 freq adjuisted (4) - 1 freq 'adjustit' (4) - 1 freq duntit (5) - 26 freq brustit (5) - 2 freq bustit (5) - 2 freq ajust (5) - 2 freq dousit (5) - 1 freq foustit (5) - 1 freq roustit (5) - 5 freq dauntit (5) - 3 freq arrestit (5) - 7 freq detestit (5) - 1 freq dejectit (5) - 1 freq accostit (5) - 4 freq doutit (5) - 4 freq |
SoundEx code - A322 adjacent - 6 freq adjusted - 5 freq adjuisted - 1 freq audacious - 5 freq adjusteed - 1 freq adjustin - 6 freq adjustit - 7 freq 'adjustit' - 1 freq adjustment - 1 freq adjustmints - 1 freq adjust - 10 freq aitchison - 1 freq adjectives - 17 freq adjective - 13 freq adjustments - 1 freq aedges - 3 freq adjusts - 1 freq ah'djist - 1 freq aitcake - 5 freq aitcakes - 3 freq attaches - 1 freq adjectival - 1 freq adjecf - 1 freq |
MetaPhone code - ATJSTT adjusted - 5 freq adjuisted - 1 freq adjusteed - 1 freq adjustit - 7 freq 'adjustit' - 1 freq |
ADJUSTIT |
| Time to execute Levenshtein function - 0.435938 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.798728 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.085079 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.098301 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.000889 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. |