{'fraction_non_alphanumeric': 0.031275720164609055, 'fraction_numerical': 0.0, 'mean_word_length': 5.4, '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}}
WORD ORDER VARIATION AND TREE‐ADJOINING GRAMMAR

In many head‐final languages such as German, Hindi, Japanese, and Korean, but also in some other languages such as Russian, arguments of a verb can occur in any order. Furthermore, arguments can occur outside of their clause (“long‐distance scrambling”). Long‐distance scrambling presents a challenge both to linguistic theory and to formal frameworks for linguistic description because it is very unconstrained: in a given sentence, there is no bound on the number of elements that can be scrambled nor on the distance over which each element can scramble. We discuss two formal frameworks related to tree‐adjoining grammar. First, we show how scrambling facts from Korean can be handled by nonlocal multicomponent TAG (MC‐TAG). Then, we argue that overt vWt‐movement in German makes this analysis unattractive, and suggest a new version of MC‐TAG, called V‐TAG, which can handle both Korean and German word order variation. Interestingly, this new version has more attractive computational properties than nonlocal MC‐TAG. We conclude that this formalism is an attractive basis for the development of psycholinguistic processing models and practical parsers alike.