{'fraction_non_alphanumeric': 0.00974025974025974, 'fraction_numerical': 0.0, 'mean_word_length': 5.295918367346939, '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}}
Generating Anaphora for Simplifying Text

We present an algorithm for generating referring expressions in open domains. Existing algorithms assume a classification of adjectives which is possible only for restricted domains. Our alternative relies on WordNet synonym and antonym sets and gives equivalent results on the examples cited in the literature and improved results in other cases that prior approaches cannot handle. We believe that it is also the first algorithm that allows for the incremental incorporation of relations. We perform an evaluation on a text-simplification task on Wall Street Journal data.