Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
airchers (0) - 7 freq archers (1) - 1 freq mairchers (1) - 4 freq aircher (1) - 1 freq airches (1) - 12 freq mairchers' (2) - 1 freq sairches (2) - 1 freq airched (2) - 5 freq airchie's (2) - 18 freq pinchers (2) - 2 freq birthers (2) - 1 freq taichers (2) - 2 freq lurchers (2) - 1 freq archer (2) - 9 freq aithers (2) - 7 freq faichers (2) - 1 freq airchee (2) - 1 freq arches (2) - 17 freq airchis (2) - 1 freq mairches (2) - 32 freq daiches (3) - 2 freq sicher (3) - 1 freq gairters (3) - 1 freq airses (3) - 3 freq airer (3) - 1 freq |
airchers (0) - 7 freq archers (1) - 1 freq aircher (2) - 1 freq airches (2) - 12 freq mairchers (2) - 4 freq lurchers (3) - 1 freq faichers (3) - 1 freq airchis (3) - 1 freq taichers (3) - 2 freq arches (3) - 17 freq archer (3) - 9 freq airchie's (3) - 18 freq archrose (4) - 1 freq airmchairs (4) - 1 freq teachers (4) - 227 freq vouchers (4) - 1 freq poachers (4) - 4 freq richer (4) - 15 freq riches (4) - 23 freq iurches (4) - 1 freq richert (4) - 2 freq techers (4) - 1 freq erches (4) - 1 freq anchors (4) - 1 freq archie's (4) - 14 freq |
SoundEx code - A626 ayrshire - 96 freq ayrshire's - 2 freq airchers - 7 freq arecord - 1 freq aircraft - 9 freq archer - 9 freq ayrshires - 1 freq ayreshires - 1 freq argyre - 1 freq 'awrighr - 1 freq ayrshire'll - 1 freq ayreshire - 2 freq €œaircraiftsman - 1 freq ayrshireman - 2 freq aircher - 1 freq arrochar - 1 freq air-source - 1 freq archers - 1 freq ayrshir - 1 freq arwgrkole - 1 freq archrose - 1 freq archerfield - 1 freq |
MetaPhone code - ARXRS ayrshire's - 2 freq airchers - 7 freq ayrshires - 1 freq ayreshires - 1 freq archers - 1 freq archrose - 1 freq |
AIRCHERS |
Time to execute Levenshtein function - 0.568525 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.936170 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.156332 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.037015 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.000895 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. |