{'fraction_non_alphanumeric': 0.030828516377649325, 'fraction_numerical': 0.0038535645472061657, 'mean_word_length': 4.977011494252873, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On Fuzzy Matching of Strings

Fuzzy matching is a widely used technique in computer-assisted translation and some other fields (it is implemented in most database engines and is used in autocompleting of data, for example). In this paper, fuzzy matching in the aspects of approximate string matching is investigated. Basic algorithms like Soundex, Bitap, Boyer-Moore [1, 2] are covered. Using the results about those algorithms, several database engines are compared and a new way of handling fuzzy matching is offered.