Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arabs (0) - 4 freq crabs (1) - 7 freq arabi (1) - 1 freq arab (1) - 4 freq grabs (1) - 21 freq rebs (2) - 3 freq trais (2) - 1 freq aas (2) - 6 freq rats (2) - 29 freq aroass (2) - 1 freq brass (2) - 31 freq wabs (2) - 10 freq alas (2) - 43 freq ara (2) - 1 freq arms (2) - 67 freq gras (2) - 5 freq rab's (2) - 14 freq crags (2) - 7 freq brags (2) - 4 freq crab (2) - 32 freq aways (2) - 58 freq trans (2) - 5 freq arb (2) - 4 freq acrass (2) - 1 freq cracs (2) - 1 freq |
arabs (0) - 4 freq urbs (2) - 1 freq ribs (2) - 33 freq rbs (2) - 1 freq rebs (2) - 3 freq rubs (2) - 10 freq arabi (2) - 1 freq arab (2) - 4 freq crabs (2) - 7 freq grabs (2) - 21 freq babs (3) - 2 freq abs (3) - 1 freq ars (3) - 2 freq armys (3) - 1 freq arcs (3) - 1 freq saabs (3) - 1 freq ards (3) - 14 freq ares (3) - 3 freq raes (3) - 2 freq arras (3) - 24 freq arable (3) - 8 freq rays (3) - 29 freq rabies (3) - 2 freq argus (3) - 1 freq rans (3) - 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 - ARBS arabs - 4 freq airbase - 1 freq |
ARABS |
Time to execute Levenshtein function - 0.189278 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.340564 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.028327 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.037129 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.000928 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. |