| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arrives (0) - 16 freq arrive (1) - 52 freq arrived (1) - 140 freq armies (2) - 4 freq yarries (2) - 1 freq derives (2) - 10 freq barries (2) - 1 freq larries (2) - 8 freq drives (2) - 27 freq cruives (2) - 1 freq arrivals (2) - 3 freq arraes (2) - 1 freq arrivin (2) - 8 freq arrivit (2) - 7 freq argive (2) - 1 freq arrige (2) - 1 freq argies (2) - 9 freq rives (2) - 4 freq arrivd (2) - 1 freq thrives (2) - 3 freq preives (2) - 1 freq ruives (2) - 2 freq arises (2) - 5 freq carries (2) - 10 freq reives (2) - 2 freq |
arrives (0) - 16 freq arrive (2) - 52 freq arrived (2) - 140 freq arrivd (3) - 1 freq rives (3) - 4 freq preives (3) - 1 freq arrivit (3) - 7 freq arrival (3) - 24 freq pruives (3) - 2 freq arrivin (3) - 8 freq reives (3) - 2 freq ruives (3) - 2 freq drives (3) - 27 freq arraes (3) - 1 freq yarries (3) - 1 freq cruives (3) - 1 freq derives (3) - 10 freq arrivals (3) - 3 freq braves (4) - 3 freq raves (4) - 5 freq curves (4) - 10 freq craves (4) - 2 freq arrows (4) - 4 freq turves (4) - 1 freq arraws (4) - 1 freq |
SoundEx code - A612 arrives - 16 freq arabs - 4 freq airwaves - 4 freq arphaxad - 2 freq airbugs - 1 freq arpachshad - 1 freq airwaves' - 1 freq airbase - 1 freq air-biggit - 1 freq arabic - 7 freq arpeggios - 1 freq arbuckle - 9 freq arbuckles - 1 freq arabstar - 3 freq airfix - 1 freq arabcarol - 2 freq arabshedboy - 2 freq aerobics - 3 freq arabzone - 2 freq arbikie - 1 freq arabest - 3 freq awrabest - 4 freq |
MetaPhone code - ARFS arrives - 16 freq |
ARRIVES |
| Time to execute Levenshtein function - 0.228521 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.367898 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.027784 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.037730 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.000926 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. |