| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appear (0) - 98 freq appeart (1) - 80 freq appeir (1) - 1 freq appeal (1) - 37 freq appear' (1) - 1 freq appar (1) - 2 freq appears (1) - 84 freq aspar (2) - 1 freq papper (2) - 1 freq apeart (2) - 1 freq napper (2) - 36 freq appeals (2) - 4 freq appeert (2) - 2 freq capper (2) - 2 freq appens (2) - 5 freq upper (2) - 55 freq lapper (2) - 1 freq spear (2) - 28 freq 'appears (2) - 1 freq tapper (2) - 1 freq appearin (2) - 23 freq appert (2) - 1 freq appearit (2) - 5 freq reappear (2) - 6 freq appearan (2) - 2 freq |
appear (0) - 98 freq appeir (1) - 1 freq appar (1) - 2 freq upper (2) - 55 freq appeart (2) - 80 freq appeal (2) - 37 freq appears (2) - 84 freq appear' (2) - 1 freq wapper (3) - 2 freq appease (3) - 8 freq pear (3) - 9 freq appeared (3) - 137 freq rapper (3) - 4 freq ppera (3) - 24 freq appen (3) - 25 freq dapper (3) - 4 freq pyper (3) - 4 freq piper (3) - 31 freq papar (3) - 2 freq paeper (3) - 3 freq papier (3) - 1 freq pypar (3) - 1 freq appearan (3) - 2 freq oppor (3) - 1 freq appert (3) - 1 freq |
SoundEx code - A160 afore - 3480 freq appear - 98 freq afore- - 1 freq affair - 36 freq 'afore - 8 freq afaur - 4 freq afar - 10 freq aiverie - 3 freq afure - 2 freq afoar - 15 freq aubrey - 4 freq a'fore - 2 freq affer - 2 freq aboor - 2 freq afor - 25 freq appar - 2 freq appear' - 1 freq aver - 4 freq aaber - 22 freq afiore - 1 freq afore' - 1 freq afoir - 68 freq affair' - 1 freq afro - 2 freq aiver - 3 freq afoare - 1 freq €˜afore - 2 freq affere - 1 freq aviary - 2 freq afroe - 1 freq avery - 2 freq affeir - 1 freq aferr - 1 freq appeir - 1 freq awpr - 11 freq apirie - 1 freq afer - 1 freq avera - 1 freq |
MetaPhone code - APR appear - 98 freq appar - 2 freq appear' - 1 freq appeir - 1 freq awpr - 11 freq apirie - 1 freq |
APPEAR |
| Time to execute Levenshtein function - 0.193594 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.352357 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.027753 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.037624 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.000943 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. |