{'fraction_non_alphanumeric': 0.023952095808383235, 'fraction_numerical': 0.017964071856287425, 'mean_word_length': 5.371428571428571, '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}}
Complex predicates via restriction

This paper continues the discussion of the RESTRICTION OPERATOR (Kaplan and Wedekind, 1993) and whether it can provide a linguistically adequate solution to the problem posed by syntactic complex predicate formation. The solution introduced here has been implemented as part of an on-going project aimed at the development of a computational grammar for Urdu and can be shown to model the linguistic facts of syntactic complex predicate formation as described by (Alsina, 1996) and (Butt, 1995). This also allows for a straightfoward extension to related phenomena in other languages such as German, Japanese, Norwegian, and French.