{'fraction_non_alphanumeric': 0.014619883040935672, 'fraction_numerical': 0.0, 'mean_word_length': 5.171171171171171, '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}}
Ph . D . Candidacy Proposal ( Third Draft ) Systematic Parameterized Complexity Analysis in Computational Biology and Linguistics

Computational Complexity Theory is the area of computer science which determines whether or not computational problems have “good” algorithms, where algorithmic goodness is phrased in terms of the amounts of resources used by an algorithm to solve its associated problem. A complaint against classical theories of computational complexity like NP -completeness is that the the proofs used to show that a problem is unlikely to have a good algorithm give few clues about how to subsequently go about deriving the best possible algorithm for that problem.