| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| justalces (0) - 1 freq justices (2) - 1 freq stances (3) - 4 freq distances (3) - 10 freq justice (3) - 68 freq justifies (3) - 2 freq substances (3) - 6 freq instances (3) - 28 freq o'stanes (4) - 1 freq sustained (4) - 9 freq states (4) - 79 freq quittances (4) - 1 freq bustage (4) - 1 freq surfaces (4) - 6 freq justified (4) - 9 freq sales (4) - 32 freq justihed (4) - 1 freq justness (4) - 1 freq turtles (4) - 14 freq installed (4) - 2 freq stalked (4) - 2 freq hustled (4) - 1 freq juggles (4) - 1 freq €œtales (4) - 1 freq justis (4) - 2 freq |
justalces (0) - 1 freq justices (3) - 1 freq justifies (5) - 2 freq instances (5) - 28 freq justice (5) - 68 freq distances (5) - 10 freq stances (5) - 4 freq justness (6) - 1 freq castles (6) - 26 freq juistice (6) - 11 freq justis (6) - 2 freq jostled (6) - 3 freq jostle (6) - 2 freq justly (6) - 3 freq instancies (6) - 1 freq styles (6) - 14 freq stalks (6) - 6 freq substances (6) - 6 freq pastilles (6) - 1 freq stalls (6) - 10 freq justine's (6) - 3 freq injustices (6) - 1 freq stacey (7) - 2 freq stills (7) - 5 freq distance (7) - 173 freq |
SoundEx code - J234 jostled - 3 freq jostlin - 3 freq jockadile - 1 freq jockteleg - 1 freq justly - 3 freq jaicketless - 1 freq justalces - 1 freq jostle - 2 freq jokteleg - 1 freq jocteleg - 1 freq jackwhitehall - 8 freq joshtaylorboxer - 1 freq |
MetaPhone code - JSTLSS justalces - 1 freq |
JUSTALCES |
| Time to execute Levenshtein function - 0.261035 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.460448 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.035513 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.039349 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.000981 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. |