| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arrived (0) - 138 freq arrive (1) - 52 freq arrivd (1) - 1 freq arrives (1) - 16 freq thrived (2) - 7 freq argied (2) - 22 freq carried (2) - 35 freq harried (2) - 6 freq reived (2) - 5 freq arrivin (2) - 8 freq arrival (2) - 24 freq ascrived (2) - 1 freq acrieved (2) - 1 freq arrige (2) - 1 freq derived (2) - 12 freq pruived (2) - 13 freq arrayed (2) - 3 freq married (2) - 30 freq rived (2) - 20 freq scrived (2) - 2 freq preived (2) - 1 freq arrivit (2) - 7 freq graived (2) - 1 freq argive (2) - 1 freq raiven (3) - 1 freq |
arrived (0) - 138 freq arrivd (1) - 1 freq arrives (2) - 16 freq arrive (2) - 52 freq pruived (3) - 13 freq derived (3) - 12 freq rived (3) - 20 freq graived (3) - 1 freq acrieved (3) - 1 freq arrivit (3) - 7 freq preived (3) - 1 freq arrayed (3) - 3 freq reived (3) - 5 freq arrival (3) - 24 freq arrivin (3) - 8 freq carved (4) - 22 freq ryved (4) - 3 freq raired (4) - 39 freq revived (4) - 6 freq graved (4) - 1 freq kerved (4) - 4 freq craved (4) - 3 freq cairved (4) - 15 freq sereived (4) - 1 freq proved (4) - 31 freq |
SoundEx code - A613 arrived - 138 freq arrivit - 7 freq arbitration - 4 freq arbitrary - 4 freq arbiter - 2 freq arbiters - 1 freq arbitraetors - 1 freq arbeit - 1 freq arbitrar - 1 freq arbuthnot - 1 freq airpot - 1 freq arbuthnots - 1 freq arrivd - 1 freq arbehd - 1 freq |
MetaPhone code - ARFT arrived - 138 freq awright - 158 freq 'awright - 4 freq 'awright' - 1 freq aaright - 3 freq aright - 7 freq arrivit - 7 freq awright' - 1 freq €˜awright - 8 freq arrivd - 1 freq aÂ’right - 1 freq |
ARRIVED |
| Time to execute Levenshtein function - 0.200766 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.344777 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.029106 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.037668 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.000877 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. |