| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arrive (0) - 52 freq argive (1) - 1 freq arrige (1) - 1 freq arrives (1) - 16 freq arrivd (1) - 1 freq arrived (1) - 140 freq barrie (2) - 15 freq reive (2) - 5 freq scrive (2) - 1 freq harrie (2) - 2 freq narrie (2) - 1 freq arrival (2) - 24 freq larrie (2) - 2 freq ahrite (2) - 3 freq archive (2) - 26 freq pruive (2) - 22 freq derive (2) - 2 freq orive (2) - 1 freq carrie (2) - 11 freq arise (2) - 10 freq trive (2) - 1 freq alive (2) - 160 freq aurrie (2) - 1 freq drive (2) - 170 freq aarite (2) - 1 freq |
arrive (0) - 52 freq argive (2) - 1 freq arrivd (2) - 1 freq arrived (2) - 140 freq arrige (2) - 1 freq arrives (2) - 16 freq aurrie (3) - 1 freq trive (3) - 1 freq orive (3) - 1 freq drive (3) - 170 freq dreive (3) - 4 freq arrivin (3) - 8 freq arvie (3) - 1 freq preive (3) - 1 freq arrit (3) - 1 freq derive (3) - 2 freq pruive (3) - 22 freq arrival (3) - 24 freq orrie (3) - 3 freq reive (3) - 5 freq arrivit (3) - 7 freq rive (3) - 18 freq arrae (3) - 1 freq cruive (3) - 1 freq arridy (3) - 1 freq |
SoundEx code - A610 arrive - 52 freq awrfie - 2 freq arabia - 3 freq arab - 4 freq arabia' - 1 freq arabi - 1 freq arp - 1 freq ahrb - 1 freq arvie - 1 freq arb - 4 freq arfu - 1 freq |
MetaPhone code - ARF arrive - 52 freq awrfie - 2 freq 'aaargh - 1 freq 'aargh - 1 freq arghhh - 1 freq aaaargh - 1 freq argh - 4 freq €˜aaaargh - 1 freq €œaargh - 2 freq arvie - 1 freq aaaaaargh - 1 freq arfu - 1 freq |
ARRIVE |
| Time to execute Levenshtein function - 0.201609 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.393499 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.027543 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.036963 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.000870 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. |