{'fraction_non_alphanumeric': 0.03541076487252125, 'fraction_numerical': 0.007082152974504249, 'mean_word_length': 4.8429752066115705, '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}}
Which States Can Be Changed by Which Events?

We present a method for finding (STATE, EVENT) pairs where EVENT can change STATE. For example, the event “realize” can put an end to the states “be unaware”, “be confused”, and “be happy”; while it can rarely affect “being hungry”. We extract these pairs from a large corpus using a fixed set of syntactic dependency patterns. We then apply a supervised Machine Learning algorithm to clean the results using syntactic and collocational features, achieving a precision of 78% and a recall of 90%. We observe 3 different relations between states and events that change them and present a method for using Mechanical Turk to differentiate between these relations