<commit_before>levenshtein-distance
====================

This tiny project is just meant to demonstrate the calculation of the Levenshtein Distance, which is one of the ways to define an *edit distance* between two strings. Here we define the edit distance to be the minimum number of operations (deletion, insertion, substitution).

More precisely, each operation is weighted, and the minimum of the sum of these weighted operations determined the optimum path.

For more information on what the Levenshtein Distance is, check out [the wikipedia article](http://en.wikipedia.org/wiki/Levenshtein_distance).

Note: We use a dynamic programming implementation, not recursion.

Install it: `npm install` `bower install`

Run It: `grunt serve`<commit_msg>change readme<commit_after>string-comparison
====================

Demonstration of string comparison with normalization.

Install it: `npm install` `bower install`

Run It: `grunt serve`
{'fraction_non_alphanumeric': 0.09893617021276596, 'fraction_numerical': 0.0, 'mean_word_length': 5.7214285714285715, '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': '389825', 'n_tokens_mistral': 250, 'n_tokens_neox': 227, 'n_words': 115}