<commit_before>LevenshteinDistance
===================

A java 7 implementation of the Levenshtein distance, see Wikipedia for more information: http://en.wikipedia.org/wiki/Levenshtein_distance<commit_msg>Updating Documentation<commit_after>LevenshteinDistance
===================

A java 7 implementation of the Levenshtein distance, see Wikipedia for more information: http://en.wikipedia.org/wiki/Levenshtein_distance

Compares two text files of strings, must be equal word count and returns a CSV output of words and their edit distances.
Uses the recurssive levenshtein distance calculation.
{'fraction_non_alphanumeric': 0.10887772194304858, 'fraction_numerical': 0.0033500837520938024, 'mean_word_length': 6.766233766233766, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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}}
{'dir': 'git-commits-cleaned', 'id': '5225659', 'n_tokens_mistral': 164, 'n_tokens_neox': 146, 'n_words': 58}