| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arp (0) - 1 freq aap (1) - 26 freq alp (1) - 1 freq arb (1) - 4 freq aip (1) - 10 freq ark (1) - 12 freq nrp (1) - 1 freq aro (1) - 1 freq ard (1) - 4 freq mrp (1) - 1 freq arc (1) - 7 freq are (1) - 5053 freq ars (1) - 2 freq ara (1) - 1 freq carp (1) - 1 freq agp (1) - 1 freq irp (1) - 2 freq arm (1) - 50 freq ar (1) - 208 freq ari (1) - 3 freq ap (1) - 94 freq warp (1) - 9 freq tarp (1) - 1 freq qrp (1) - 1 freq amp (1) - 10 freq |
arp (0) - 1 freq irp (1) - 2 freq rp (1) - 8 freq art (2) - 88 freq hrp (2) - 1 freq arb (2) - 4 freq ar' (2) - 1 freq aup (2) - 1 freq arz (2) - 1 freq amp (2) - 10 freq app (2) - 47 freq harp (2) - 9 freq aqp (2) - 1 freq aap (2) - 26 freq rep (2) - 3 freq rop (2) - 6 freq raep (2) - 2 freq yirp (2) - 1 freq raip (2) - 32 freq rap (2) - 20 freq irip (2) - 1 freq rip (2) - 55 freq qrp (2) - 1 freq atp (2) - 1 freq mrp (2) - 1 freq |
SoundEx code - A610 arrive - 51 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 - ARP arp - 1 freq |
ARP |
| Time to execute Levenshtein function - 0.213674 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.333726 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.027390 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.037013 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.000917 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. |