| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adjourn (0) - 3 freq adjourns (1) - 2 freq adoun (2) - 2 freq sojourn (2) - 1 freq adorn (2) - 6 freq adjust (3) - 10 freq aroun (3) - 129 freq allourin (3) - 1 freq adorns (3) - 2 freq armour (3) - 10 freq auburn (3) - 4 freq alcorn (3) - 7 freq attour (3) - 5 freq adornt (3) - 1 freq odour (3) - 3 freq adjoinin (3) - 2 freq adore (3) - 12 freq mourn (3) - 14 freq adorin (3) - 1 freq armoury (3) - 2 freq acorn (3) - 2 freq atourt (3) - 1 freq athourt (3) - 5 freq ardour (3) - 1 freq allouin (3) - 14 freq |
adjourn (0) - 3 freq adjourns (2) - 2 freq adorn (3) - 6 freq sojourn (3) - 1 freq adorin (4) - 1 freq droun (4) - 7 freq journo (4) - 1 freq bjorn (4) - 3 freq adjoinin (4) - 2 freq adoun (4) - 2 freq dooron (5) - 5 freq odours (5) - 3 freq aujord (5) - 1 freq darrn (5) - 1 freq sojours (5) - 1 freq daurna (5) - 24 freq dour (5) - 126 freq admirin (5) - 22 freq jour (5) - 2 freq dern (5) - 21 freq dauran (5) - 1 freq journey (5) - 111 freq admiran (5) - 2 freq decern (5) - 2 freq adrian (5) - 4 freq |
SoundEx code - A326 adjourn - 3 freq adjourns - 2 freq autographed - 2 freq aithsworn - 4 freq autocar - 1 freq attackers - 1 freq autographs - 2 freq autograph - 1 freq adwisory - 14 freq autocrat - 4 freq autosort - 1 freq autocorrect - 7 freq autocorrects - 1 freq adcramps - 1 freq aetshirts - 2 freq aetgraphics - 1 freq |
MetaPhone code - ATJRN adjourn - 3 freq |
ADJOURN |
| Time to execute Levenshtein function - 0.205256 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.368692 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.028069 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.037468 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.000863 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. |