{'fraction_non_alphanumeric': 0.02099737532808399, 'fraction_numerical': 0.005249343832020997, 'mean_word_length': 5.6347826086956525, '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}}
Underspecified parallelism constraint

We propose a modification of the Constraint Language for Lambda Structures (CLLS): an underspecified parallelism constraint. The original parallelism constraint offers a descriptive formalisation of simple VP ellipses by indicating two parallel segments of an underspecified tree representation. However, these segments still have to be extracted by hand or to be captured by explicit syntactic constraints (Egg and Erk, 2001) for every given example. The underspecified parallelism constraint overcomes this shortcoming by leaving open the exact size of the parallel segments. Moreover, our extension of CLLS accounts for more data, covering ambiguities that arise from gapping, as in Peter gave Mary a book and John, too.