ACL-OCL / Base_JSON /prefixL /json /lilt /2014.lilt-11.3.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "2014",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:00:13.460687Z"
},
"title": "Kolmogorov complexity of morphs and constructions in English",
"authors": [
{
"first": "Katharina",
"middle": [],
"last": "Ehret",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Freiburg",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This chapter demonstrates how compression algorithms can be used to address morphological and syntactic complexity in detail by analysing the contribution of specific linguistic features to English texts. The point of departure is the ongoing complexity debate and quest for complexity metrics. After decades of adhering to the equal complexity axiom, recent research seeks to define and measure linguistic complexity (Dahl 2004; Kortmann and Szmrecsanyi 2012; Miestamo et al. 2008). Against this backdrop, I present a new flavour of the Juola-style compression technique (Juola 1998), targeted manipulation. Essentially, compression algorithms are used to measure linguistic complexity via the relative informativeness in text samples. Thus, I assess the contribution of morphs such as-ing or-ed, and functional constructions such as progressive (be + verb-ing) or perfect (have + verb past participle) to the syntactic and morphological complexity in a mixedgenre corpus of Alice's Adventures in Wonderland, the Gospel of Mark and newspaper texts. I find that a higher number of marker types leads to higher amounts of morphological complexity in the corpus. Syntactic complexity is reduced because the presence of morphological markers enhances the algorithmic prediction of linguistic patterns. To conclude, I show that information-theoretic methods yield linguistically meaningful results and can be used to measure the complexity of specific linguistic features in naturalistic copora.",
"pdf_parse": {
"paper_id": "2014",
"_pdf_hash": "",
"abstract": [
{
"text": "This chapter demonstrates how compression algorithms can be used to address morphological and syntactic complexity in detail by analysing the contribution of specific linguistic features to English texts. The point of departure is the ongoing complexity debate and quest for complexity metrics. After decades of adhering to the equal complexity axiom, recent research seeks to define and measure linguistic complexity (Dahl 2004; Kortmann and Szmrecsanyi 2012; Miestamo et al. 2008). Against this backdrop, I present a new flavour of the Juola-style compression technique (Juola 1998), targeted manipulation. Essentially, compression algorithms are used to measure linguistic complexity via the relative informativeness in text samples. Thus, I assess the contribution of morphs such as-ing or-ed, and functional constructions such as progressive (be + verb-ing) or perfect (have + verb past participle) to the syntactic and morphological complexity in a mixedgenre corpus of Alice's Adventures in Wonderland, the Gospel of Mark and newspaper texts. I find that a higher number of marker types leads to higher amounts of morphological complexity in the corpus. Syntactic complexity is reduced because the presence of morphological markers enhances the algorithmic prediction of linguistic patterns. To conclude, I show that information-theoretic methods yield linguistically meaningful results and can be used to measure the complexity of specific linguistic features in naturalistic copora.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Linguistic complexity has been in the limelight of typological research for some time and is still one of the most hotly debated notions in linguistics in general (Dahl 2004; Kortmann and Szmrecsanyi 2012; Miestamo et al. 2008; Sampson 2009) . At the core of the linguistic complexity debate stands the question whether all languages are, overall, equally complex-or not. For much of the twentieth century it was generally assumed that all languages are of equal complexity (Bickerton 1995; Crystal 1987; Hockett 1958; O'Grady et al. 1997) . This alleged truism has recently been challenged and evidence was produced that indeed some languages seem to be less complex than others (Kusters 2003; McWhorter 2001b) . The major topics of the current complexity debate are how exactly linguistic complexity can be defined and, then, how this complexity can be measured and quantified.",
"cite_spans": [
{
"start": 163,
"end": 174,
"text": "(Dahl 2004;",
"ref_id": "BIBREF8"
},
{
"start": 175,
"end": 205,
"text": "Kortmann and Szmrecsanyi 2012;",
"ref_id": null
},
{
"start": 206,
"end": 227,
"text": "Miestamo et al. 2008;",
"ref_id": "BIBREF28"
},
{
"start": 228,
"end": 241,
"text": "Sampson 2009)",
"ref_id": "BIBREF35"
},
{
"start": 474,
"end": 490,
"text": "(Bickerton 1995;",
"ref_id": "BIBREF5"
},
{
"start": 491,
"end": 504,
"text": "Crystal 1987;",
"ref_id": "BIBREF7"
},
{
"start": 505,
"end": 518,
"text": "Hockett 1958;",
"ref_id": "BIBREF13"
},
{
"start": 519,
"end": 539,
"text": "O'Grady et al. 1997)",
"ref_id": "BIBREF31"
},
{
"start": 680,
"end": 694,
"text": "(Kusters 2003;",
"ref_id": "BIBREF19"
},
{
"start": 695,
"end": 711,
"text": "McWhorter 2001b)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Despite vastly differing terminology and definitions of complexity in the literature, a distinction between absolute and relative complexity is generally made (Miestamo 2006; Miestamo et al. 2008; Miestamo 2009) . Absolute complexity is a theory-oriented notion of complexity and refers to the amount of complexity inherent in a linguistic system. As such it is independent of and unrelated to a language user. Examples of absolute metrics are quantitative complexity and irregularitybased complexity. Quantitative complexity is interested in the number of grammatical contrasts, markers or rules in a linguistic system, where more constrasts / markers / rules equate to greater complexity. (Dahl 2004; McWhorter 2001a; Shosted 2006) . According to the irregularitybased metric, irregular grammatical markers are more complex than regular markers. For instance, irregular past tense forms (brought, went) are regarded as more complex than regular forms (walked, used ). Therefore, the more irregular markers a linguistic system exhibits, the more complex it is (Kusters 2003; McWhorter 2001a; Trudgill 2004) . Relative complexity notions, on the other hand, define complexity in relation to a language user, in terms of cost, processing or acquisition difficulty (Miestamo 2006; Miestamo et al. 2008) . Relative complexity is often equated to second language acquisition difficulty which is, in fact, the most popular notion of relative complexity. Linguistic features which are difficult to process or acquire for adult language learners are considered complex (Kusters 2003; Szmrecsanyi and Kortmann 2009; Trudgill 2001) .",
"cite_spans": [
{
"start": 159,
"end": 174,
"text": "(Miestamo 2006;",
"ref_id": "BIBREF26"
},
{
"start": 175,
"end": 196,
"text": "Miestamo et al. 2008;",
"ref_id": "BIBREF28"
},
{
"start": 197,
"end": 211,
"text": "Miestamo 2009)",
"ref_id": "BIBREF27"
},
{
"start": 691,
"end": 702,
"text": "(Dahl 2004;",
"ref_id": "BIBREF8"
},
{
"start": 703,
"end": 719,
"text": "McWhorter 2001a;",
"ref_id": "BIBREF23"
},
{
"start": 720,
"end": 733,
"text": "Shosted 2006)",
"ref_id": "BIBREF37"
},
{
"start": 1061,
"end": 1075,
"text": "(Kusters 2003;",
"ref_id": "BIBREF19"
},
{
"start": 1076,
"end": 1092,
"text": "McWhorter 2001a;",
"ref_id": "BIBREF23"
},
{
"start": 1093,
"end": 1107,
"text": "Trudgill 2004)",
"ref_id": "BIBREF42"
},
{
"start": 1263,
"end": 1278,
"text": "(Miestamo 2006;",
"ref_id": "BIBREF26"
},
{
"start": 1279,
"end": 1300,
"text": "Miestamo et al. 2008)",
"ref_id": "BIBREF28"
},
{
"start": 1562,
"end": 1576,
"text": "(Kusters 2003;",
"ref_id": "BIBREF19"
},
{
"start": 1577,
"end": 1607,
"text": "Szmrecsanyi and Kortmann 2009;",
"ref_id": "BIBREF39"
},
{
"start": 1608,
"end": 1622,
"text": "Trudgill 2001)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper takes an absolute approach to complexity and builds on proposals to use an unsupervised, algorithmic, information-theoretic measure (Bane 2008; Ehret and Szmrecsanyi to appear; Juola 1998 Juola , 2008 Moscoso del Prado Martin et al. 2004; Sadeniemi et al. 2008) to assess linguistic complexity in texts. Essentially, this measure boils down to the notion of Kolmogorov complexity, which can be conveniently approximated by using ready-to-go file compression pro-grammes. Kolmogorov complexity measures the information content of a (text) string by the length of the algorithm which is required to (re)construct the exact string (Juola 2008: 92 ; see also Sadeniemi et al. 2008; Li et al. 2004) . Linguistically speaking, Kolmogorov complexity is a quantitative, (ir)regularity-based type of complexity and does not encompass agent-related, subjective complexity (Kusters 2003 (Kusters , 2008 Szmrecsanyi and Kortmann 2009; Trudgill 2001) .",
"cite_spans": [
{
"start": 143,
"end": 154,
"text": "(Bane 2008;",
"ref_id": "BIBREF4"
},
{
"start": 155,
"end": 187,
"text": "Ehret and Szmrecsanyi to appear;",
"ref_id": null
},
{
"start": 188,
"end": 198,
"text": "Juola 1998",
"ref_id": "BIBREF14"
},
{
"start": 199,
"end": 211,
"text": "Juola , 2008",
"ref_id": "BIBREF15"
},
{
"start": 212,
"end": 249,
"text": "Moscoso del Prado Martin et al. 2004;",
"ref_id": "BIBREF29"
},
{
"start": 250,
"end": 272,
"text": "Sadeniemi et al. 2008)",
"ref_id": "BIBREF33"
},
{
"start": 639,
"end": 654,
"text": "(Juola 2008: 92",
"ref_id": null
},
{
"start": 666,
"end": 688,
"text": "Sadeniemi et al. 2008;",
"ref_id": "BIBREF33"
},
{
"start": 689,
"end": 704,
"text": "Li et al. 2004)",
"ref_id": "BIBREF21"
},
{
"start": 873,
"end": 886,
"text": "(Kusters 2003",
"ref_id": "BIBREF19"
},
{
"start": 887,
"end": 902,
"text": "(Kusters , 2008",
"ref_id": "BIBREF20"
},
{
"start": 903,
"end": 933,
"text": "Szmrecsanyi and Kortmann 2009;",
"ref_id": "BIBREF39"
},
{
"start": 934,
"end": 948,
"text": "Trudgill 2001)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this spirit, I set out to measure the contribution of morphs and constructions to the syntactic and morphological complexity in English texts. In order to explore the possibilities of targeted file manipulation with compression algorithms, I draw up a set of N = 10 features comprising (i) morphs: -ing, -ed, genitive 's, plural -s and third person singular -s;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(ii) and a handful of functional constructions: progressive aspect be + verb-ing, perfect aspect have + verb past participle, passive voice be + verb past participle and the future markers will and going to.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The database is a corpus which comprises three genres of written English-literary writing, religious writing and newspaper texts-and samples texts from Carroll's Alice's Adventures in Wonderland, the Gospel of Mark in the English Standard Version, and a custom-made newspaper corpus. The newspaper corpus consists of articles on the \"Euro-Crisis\" and the political situation in Congo which were retrieved between December 2011 and February 2012. Each subcorpus counts roughtly the same number of words so that each genre is equally represented. Table 1 shows the composition of the mixed-genre corpus. Foregrounding methodological aspects, this paper seeks to demonstrate that Kolmogorov complexity measurements yield linguistically meaningful results and can be used to assess the contribution of specific linguistic features to the syntactic and morphological complexity of a text. Moreover, I show how the complexity of these features in a given text can be inferred from their complexity contribution to the text.",
"cite_spans": [],
"ref_spans": [
{
"start": 545,
"end": 552,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper is structured as follows. Section 2 provides some background on information theory. In Sections 3 and 4 the methodology will be outlined. Sections 5 and 6 analyse the complexity contribution of morphs and constructions, respectively. I conclude with a brief summary sketching the advantages and drawbacks of the methodology.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Information theory is \"the science which deals with the concept 'information', its measurement and its applications\"' (van der Lubbe 1997: 1). In this context, the term 'information' refers to the unpredictability or unexpectedness of a proposition, an event or, in terms of communication, a message (Shannon 1948) . In his landmark paper \"A Mathematical Theory of Communication\", Claude Shannon derives the first ever quantitative measure of information, Shannon entropy, thereby laying the cornerstone for modern information theory. Shannon entropy measures the information content of a message by quantifying the amount of uncertainty or choice which is involved in the selection of a message from a possible set of messages. As such, Shannon entropy is always measured in relation to a set of possible messages and their probabilities (Li and Vitanyi 1997: 65) . This implies that Shannon entropy is not suitable for measuring the information content of an individual message or, say, a linguistic object independently of the probabilities in the set. In order to measure the information content of an individual object, an absolute measure of information is needed which refers to the information inherent in the object alone (Li and Vitanyi 1997: 93) .",
"cite_spans": [
{
"start": 300,
"end": 314,
"text": "(Shannon 1948)",
"ref_id": "BIBREF36"
},
{
"start": 839,
"end": 864,
"text": "(Li and Vitanyi 1997: 65)",
"ref_id": null
},
{
"start": 1231,
"end": 1256,
"text": "(Li and Vitanyi 1997: 93)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information-theoretic background",
"sec_num": "2"
},
{
"text": "Kolmogorov complexity is closely related to Shannon entropy but, in constrast, refers to the information content of an individual object or string, not a set of messages (Li and Vitanyi 1997: 521-525) . It measures the information content or complexity of a string by the length of the binary programme which is required to (re)construct the exact string (Juola 2008: 92; Sadeniemi et al. 2008: 191; Li et al. 2004) . In plain English, Kolmogorov complexity measures the complexity of a string of symbols as the length of the shortest possible description of this string. For illustration, let us assume the two strings of symbols in Example (1) are the objects whose complexity we want to measure. Both strings count ten symbols, yet the length of the shortest possible description of string (1-a) is 5\u00d7ab counting four symbols whereas the length of the shortest possible description of (1-b) is the string itself. Measuring the complexity of the two example strings in terms of the length of their shortest possible description necessary to reconstruct them, string (1-b) is more complex than string (1-a).",
"cite_spans": [
{
"start": 170,
"end": 200,
"text": "(Li and Vitanyi 1997: 521-525)",
"ref_id": null
},
{
"start": 355,
"end": 371,
"text": "(Juola 2008: 92;",
"ref_id": null
},
{
"start": 372,
"end": 399,
"text": "Sadeniemi et al. 2008: 191;",
"ref_id": null
},
{
"start": 400,
"end": 415,
"text": "Li et al. 2004)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information-theoretic background",
"sec_num": "2"
},
{
"text": "(1) a. ababababab (10 symbols) \u00a9 5\u00d7ab (4 symbols) b. ab?x58gjy9 (10 symbols) \u00a9 ab?x58gjy9 (10 symbols)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information-theoretic background",
"sec_num": "2"
},
{
"text": "For mathematically non-trivial reasons, Kolmogorov complexity is not computable (Kolmogorov 1965; Li and Vitanyi 1997 ). Yet, adaptive entropy estimation methods can be used to calculate and approximate its upper bounds. In fact, file compression programmes of the Lempel-Ziv family such as gzip use a variant of adaptive entropy estimation that approximates Kolmogorov complexity (Li et al. 2004; Ziv and Lempel 1977) . These programmes largely work on the assumption that text strings contain-more or less-structural regularities and redundancies which can be reduced. Compression algorithms like gzip compress new text strings on the basis of previously encountered and \"memorised\" strings taking advantage of the structural redundancy in the text (Juola 2008: 93; Ziv and Lempel 1977: 337) . Technically speaking, in a first step compression is achieved by back-referencing redundant (sub)strings with the length of the copied sequence and the distance in the buffer to the previous identical sequence (Ziv and Lempel 1977: 337) . In a second step, these length-distance pairs as well as literal unmatched strings are further reduced using Huffman coding, a statistical compression method (Salomon 2007: 320-332) . In simplified terms, the algorithm \"loads\" a certain amount of text and \"stores\" it in a temporary lexicon. While \"looking\" at further text segments, the programme can \"recognise\" newly encountered text (sub)strings on the basis of the strings in the lexicon and compress them by eliminating redundancy. Thus, the amount of information measured in a given text string is essentially a measure of the structural surface redundancy in this string. The idea is to measure complexity via the information content in naturalistic text samples. A higher amount of information can be equated with a higher amount of complexity-all other things being equal-in a given text sample. Better compression rates of a given text sample indicate lower information content and thus lower Kolmogorov complexity (Juola 1998 (Juola , 2008 .",
"cite_spans": [
{
"start": 80,
"end": 97,
"text": "(Kolmogorov 1965;",
"ref_id": "BIBREF16"
},
{
"start": 98,
"end": 117,
"text": "Li and Vitanyi 1997",
"ref_id": "BIBREF22"
},
{
"start": 381,
"end": 397,
"text": "(Li et al. 2004;",
"ref_id": "BIBREF21"
},
{
"start": 398,
"end": 418,
"text": "Ziv and Lempel 1977)",
"ref_id": "BIBREF44"
},
{
"start": 751,
"end": 767,
"text": "(Juola 2008: 93;",
"ref_id": null
},
{
"start": 768,
"end": 793,
"text": "Ziv and Lempel 1977: 337)",
"ref_id": null
},
{
"start": 1006,
"end": 1032,
"text": "(Ziv and Lempel 1977: 337)",
"ref_id": null
},
{
"start": 1193,
"end": 1216,
"text": "(Salomon 2007: 320-332)",
"ref_id": null
},
{
"start": 2011,
"end": 2022,
"text": "(Juola 1998",
"ref_id": "BIBREF14"
},
{
"start": 2023,
"end": 2036,
"text": "(Juola , 2008",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information-theoretic background",
"sec_num": "2"
},
{
"text": "In linguistic terms, Kolmogorov complexity is a measure of structural surface redundancy. This is another way of saying that, even though the algorithm to some extent picks up on recurrent linguistic structures, it is absolutely agnostic about their communicative necessity and functions or about form-meaning relationships. In a nutshell, algorithmically measured linguistic complexity is based on the form of structures, not on their function and meaning. It is a quantitative, irregularitybased and text-based metric of absolute linguistic complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information-theoretic background",
"sec_num": "2"
},
{
"text": "On a methodological plane, I use gzip 2 , an open source compression programme of the Lempel-Ziv family, to approximate Kolmogorov complexity and thus measure linguistic complexity on the syntactic and morphological plane. Morphological and syntactic complexity are addressed by distorting the respective information in text samples prior to compression (Juola 2008: 98) .",
"cite_spans": [
{
"start": 354,
"end": 370,
"text": "(Juola 2008: 98)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "Largely following Juola (2008) , morphological distortion is achieved by randomly deleting 10% of the orthographic characters in a text sample. Through this procedure new word forms are created while at the same time the morphological regularity of surface structures is compromised. In other words, the morphological information and hence the complexity is increased. Morphologically complex languages which exhibit overall a large number of word forms anyway, should not be greatly affected. Therefore, morphological distortion should not hurt them as badly as morphologically simple languages, in which distortion creates comparatively more random noise, i.e. complexity. Subsequently, the distorted samples are compressed in order to determine how well or badly the compression programme deals with the distortion. Comparatively worse compression ratios thus signify low morphological complexity.",
"cite_spans": [
{
"start": 18,
"end": 30,
"text": "Juola (2008)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "Distortion at the syntactic level is accomplished by randomly deleting 10% of all orthographically transcribed word tokens in a sample. This procedure is assumed to have little impact on languages with simple syntax-which is essentially defined here as maximum flexibility, i.e. free word order (see Bakker (1998))-as they lack betweenword interdependencies. Syntactically complex languages, on the other hand, should be greatly affected as word order regularities and interdependencies are compromised. In short, comparatively bad compression ratios after syntactic distortion indicate high syntactic complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "On a more technical note, I take two measures for each text file: the compressed file size in bytes of the distorted file and the compressed file size in bytes of the original undistorted file. Based on these measures I calculate the morphological complexity score defined as \u2212 m c , where m is the compressed file size after morphological distortion and c the original compressed file size 3 ; and the syntactic complexity score s c , where s is the compressed file size after syntactic distortion and c the file size before distortion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "In order to obtain a statistically robust measure, each text file is multiply distorted and compressed with N = 1000 iterations. 4 Consider example (2), which illustrates random syntactic distortion. Sentence (2-a) is the original undistorted sentence. In (2-b) and (2-c) three words each were randomly deleted. While (2-b) is still syntactically intact after the distortion, (2-c) is badly compromised as word-interdependencies have been destroyed. Thus, neither the compression of (2-b) nor of (2-c) in isolation would adequately reflect the sentence's syntactic complexity. This issue is easily solved by applying multiple distortion and compression.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "(2) For every iteration of the distortion and compression script, the file size of the compressed original and the compressed distorted sample are returned and the morphological and syntactic complexity scores calculated. The average morphological complexity score and average syntactic complexity score are subsequently obtained by taking the mean of the total number of measuring points (N = 1, 000), respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Measuring Kolmogorov complexity",
"sec_num": "3"
},
{
"text": "In this section a special flavour of the compression technique, targeted manipulation, will be presented and used to measure the contribution of morphs and functional constructions to the morphological and syntactic complexity in the mixed-genre corpus thereby demonstrating how compression algorithms can measure detailed morphological and syn-tactic complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "Targeted manipulation is, essentially, the systematic removal of specific target structures from a text. The idea is to measure the contribution of specific linguistic structures to the morphological and syntactic complexity in text samples by comparing the complexity of manipulated texts and unmanipulated texts. To this end, I combine targeted manipulation, i.e. systematic removal, with the Juola-style compression technique, i.e. random distortion and subsequent compression. Specifically, one feature at a time is removed from the mixed-genre corpus to obtain a set of feature-manipulated text samples. These manipulated texts and the original, intact version of the corpus are then subjected to random distortion and compression. For each text sample I thus obtain an average morphological and an average syntactic complexity score as described above. On the basis of these scores, the morphological and syntactic complexity of the feature-manipulated texts-the texts without the respective feature-and the complexity of the original text can be compared. The difference in complexity between the manipulated texts and the original text is taken as indicator for the amount of morphological / syntactic complexity that an individual feature contributes to the text. 5 On an interpretational plane, the morphological and syntactic complexity of each feature is inferred from the amount of complexity it contributes to the text. This complexity-being to some extent text-dependent-is dubbed textual complexity. Generally, a feature that increases the complexity of the original text should be complex, while a feature that decreases the complexity of the original text should be less complex (simple).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "Methodologically, each feature is identified and manipulated in a way which damages the texts as little as possible. Systematic manipulation was implemented as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "(i) morphs 6 . -ing . -ed . genitive 's . plural -s . third person singular -s (ii) constructions",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": ". progressive aspect be + verb-ing . perfect aspect have + verb past participle . passive voice be + verb past participle . future marker will . future marker going to",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "The mixed-genre corpus was annotated with part-of-speech tags using the Stanford Core NLP tagger and lemmatizer (Toutanova et al. 2003) to permit the automatic manipulation of the morphs and facilitate the manual coding of the functional constructions. The NLP tool was furthermore used to lemmatize the corpus for morph manipulation. Thus, a python 7 script identified the morphs on the basis of their part-of-speech tags, e.g. -ing is identified by the tag VBG, and replaced the inflected verbs and nouns with their lemma (see examples (3)-(7)).",
"cite_spans": [
{
"start": 112,
"end": 135,
"text": "(Toutanova et al. 2003)",
"ref_id": "BIBREF40"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "(3) The manipulation of functional constructions had to be conducted manually as, for example, not every present participle ending in -ing and annotated as VBG is part of a progressive construction. The functional constructions progressive, passive and perfect were therefore manually identified and manipulated by deleting the auxiliary be/have and replacing the main verb with its lemma (see examples (8)-(10)). Manipulation is implemented as lemma-substitution because it alters the texts as little as possible and does not introduce new irregularity, for instance, by replacing verbal constructions (was beginning) with irregular past tense forms (began). Each occurrence of the future markers going to and will -including its variants 'll and won't-was deleted as illustrated in examples 11 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "a. And, as you might like to try the thing yourself, some winter day, I",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "[will] will tell you how the Dodo managed it. b. And, as you might like to try the thing yourself, some winter day, I \u00d8 tell you how the Dodo managed it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "[Alice]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "a. And he did not want anyone to know for he was teaching his disciples, saying to them, the son of man [is going to] going to be delivered into the hands of men and they kill him. b. And he did not want anyone to know for he was teaching his disciples, saying to them, the son of man \u00d8 be delivered into the hands of men and they kill him.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "[Mark]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "If negative contractions occurred in any of the constructions, for example, won't, hasn't or isn't, the construction was replaced / deleted while n't was replaced with the negative particle not (13).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "a. Oh! [won't] will negative contraction she be savage if I've kept her waiting! b. Oh! not she be savage if I've kept her waiting!",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "[Alice]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "Finally, all annotation was removed before treating the featuremanipulated texts and the original text with the compression technique described in the previous section. Each text is multiply distorted and compressed with N = 1000 iterations and the average morphological and average syntactic complexity score is calculated for each text sample.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "Intra-sample variation, i.e. the variation between the different iterations, is accounted for by calculating the standard deviation, a measure of dispersion. Table 2 and Table 3 list the standard deviation in the morph and construction manipulated data respectively. In both cases the standard deviation is low. Statistically, this means that the average syntactic complexity score and the average morphological complexity score reflect the actual complexity of the text samples well. On a more statistical note, the measurements presented in the following sections are based on compressed file sizes in bytes. Due to the nature of compression, differences between compressed file sizes are very small to start with. As a consequence, differences in the values of the average morphological and syntactic complexity scores between different texts, and especially between manipulated texts and their orig- inals, often seem insignificant. This is not the case. Tukey's honestly significant difference test (Tukey's HSD) is calculated for all pairs of the morphological and syntactic complexity scores to establish whether differences between the means of each pair are statistically significant (Baayen 2008: 106-107) . The tables with the full statistics are presented in Appendix A. Suffice it to say, all differences between the morph-manipulated texts and the original corpus are statistically significant. The differences between the average morphological complexity scores across all pairs of the morph-manipulated texts are also statistically significant, yet, the average syntactic complexity scores of the morph-manipulated texts fail to achieve statistical significance. This means that the morphmanipulated texts statistically significantly vary in their morphological complexity but that they are roughly of the same syntactic complexity (for a discussion of morph-complexity see Section 5). In case of the construction-manipulated texts, most differences between the syntactic complexity scores and morphological complexity scores across all pairs are statistically significant. An exception are the texts with the future markers, whose complexity is virtually identical to the complexity of the original corpus, and the constructions passive and perfect, which are of roughly the same morphological and syntactic complexity (for a discussion of construction complexity see Section 6).",
"cite_spans": [
{
"start": 1193,
"end": 1215,
"text": "(Baayen 2008: 106-107)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 158,
"end": 177,
"text": "Table 2 and Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Targeted manipulation",
"sec_num": "4"
},
{
"text": "This section surveys the contribution of morphs to the morphological and syntactic complexity in the mixed-genre corpus, and establishes a ranking of the textual complexity of the morphs on the morphological and syntactic level. Furthermore, I show that the findings obtained through compression are in line with previously established complexity metrics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "FIGURE 1 Morphological by syntactic complexity of morph-manipulated texts and original text. Abscissa indexes increased syntactic complexity, ordinate indexes increased morphological complexity. Figure 1 shows the results of the morph analysis. The original text is located in the top left quadrant of the plot and is the morphologically most complex but syntactically most simple text. The morphmanipulated texts, scattered across the right middle to lower part of the plot, all exhibit less morphological but more syntactic complexity than the original. This is another way of saying that the morphs analysed in this section all increase the morphological complexity but at the same time decrease the syntactic complexity of the original text. The former finding is congruent with the assumption of a well-established quantitative metric which holds that \"more is more complex\" (Arends 2001: 180) , i.e. more morphological markers / distinctions generate more morphological complexity (see, for instance, Arends 2001; McWhorter 2001a McWhorter , 2012 Shosted 2006) . While the latter might seem surprising at first, one needs to keep in mind that morphs often form part of morphosyntactic patterns. The morph -ing, for instance, often occurs in progressive constructions and is therefore likely to be preceded by a form of the verb be. Simply put, one could say that the ing-morph facilitates the algorithmic prediction of the progressive pattern be + verb-ing.",
"cite_spans": [
{
"start": 880,
"end": 898,
"text": "(Arends 2001: 180)",
"ref_id": null
},
{
"start": 1007,
"end": 1019,
"text": "Arends 2001;",
"ref_id": "BIBREF0"
},
{
"start": 1020,
"end": 1035,
"text": "McWhorter 2001a",
"ref_id": "BIBREF23"
},
{
"start": 1036,
"end": 1052,
"text": "McWhorter , 2012",
"ref_id": "BIBREF25"
},
{
"start": 1053,
"end": 1066,
"text": "Shosted 2006)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 195,
"end": 203,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "Let us turn to morphological complexity first. In general, all morphs increase morphological complexity, yet, their precise contribution to the morphological complexity in the corpus varies. The degree of variation is assessed by taking the difference between the average morphological complexity scores of the original, unaltered text and each morph-manipulated text. Based on this difference, the textual complexity of each morph at the morphological level is inferred. In this context, morphs which contribute more morphological complexity to the original text are considered information-theoretically more complex than morphs which contribute less morphological complexity to the original text. In this spirit, a ranking of the morphs according to their textual complexity on the morphological level is established (Figure 2 ). The ranking is in decreasing order of morphological complexity: third person singular -s, plural -s, genitive -s, -ed and -ing. The endings in -s, particularly third person singular -s, add comparatively more morphological complexity to the original text than the morphs -ed and -ing and are therefore more complex.",
"cite_spans": [],
"ref_spans": [
{
"start": 819,
"end": 828,
"text": "(Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "It is a well-known fact that the English s-morph expresses three distinct grammatical meanings, namely third person singular, genitive and plural. For this reason, the s-morphs are highly irregular and do not facilitate the algorithmic prediction of patterns, i.e. they are difficult to compress and therefore complex. The -ed and -ing morphs, on the other hand, are comparatively more regular and encode one grammatical form only, i.e. present and past participle respectively. Thus, the compression technique corroborates the assumption that nontransparency resulting from allomorphy and irregularity of inflectional endings increase morphological complexity (Kusters 2008 (Kusters , 2003 Szmrecsanyi and Kortmann 2009) .",
"cite_spans": [
{
"start": 661,
"end": 674,
"text": "(Kusters 2008",
"ref_id": "BIBREF20"
},
{
"start": 675,
"end": 690,
"text": "(Kusters , 2003",
"ref_id": "BIBREF19"
},
{
"start": 691,
"end": 721,
"text": "Szmrecsanyi and Kortmann 2009)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "Furthermore, the morphological complexity ranking of the five morphs largely coincides with the acquisitional order of morphemes reported in first and second language acquisition studies (e.g. Brown 1973; de Villiers and de Villiers 1973; Bailey et al. 1974; Krashen et al. 1976; Rosansky 1976 ). Brown (1973) analyses the morpheme acquisition order in a longitudinal study of three children acquiring English as first language, setting the benchmark for future research of morpheme acquisition. The fourteen grammatical morphemes he studies include, among others, progressive -ing, regular past -ed, possessive s, plural -s and third person singular -s, which are listed in Table 4 together with the five morphs in the mixed-genre corpus (a full list and ranking of Brown's morphemes is provided in Appendix B). Brown finds that the semantic and grammatical complexity of the morphemes greatly influence their order of acquisition but that input frequency does have little impact (Brown 1973: 379) . In fact, the order of (second language) morpheme acquisition seems to be determined by a cocktail of six factors: perceptual salience, semantic complexity, morpho-phonological regularity, syntactic category and input frequency (Goldschneider and DeKeyser 2005: 47-55) . The concept of semantic complexity, i.e. basically the one-form-one-meaning principle, is reflected in the measurements of the compression technique. In essence, the algorithmically measured complexity of the morphs approximates the acquisitional complexity of grammatical morphemes experienced by (second) language learners. (Brown 1973 in Goldschneider and DeKeyser 2005: 72) and morphological complexity ranking of the five morphs in the mixed-genre corpus.",
"cite_spans": [
{
"start": 193,
"end": 204,
"text": "Brown 1973;",
"ref_id": "BIBREF6"
},
{
"start": 205,
"end": 238,
"text": "de Villiers and de Villiers 1973;",
"ref_id": "BIBREF9"
},
{
"start": 239,
"end": 258,
"text": "Bailey et al. 1974;",
"ref_id": "BIBREF2"
},
{
"start": 259,
"end": 279,
"text": "Krashen et al. 1976;",
"ref_id": "BIBREF18"
},
{
"start": 280,
"end": 293,
"text": "Rosansky 1976",
"ref_id": "BIBREF32"
},
{
"start": 297,
"end": 309,
"text": "Brown (1973)",
"ref_id": "BIBREF6"
},
{
"start": 981,
"end": 998,
"text": "(Brown 1973: 379)",
"ref_id": null
},
{
"start": 1228,
"end": 1268,
"text": "(Goldschneider and DeKeyser 2005: 47-55)",
"ref_id": null
},
{
"start": 1597,
"end": 1629,
"text": "(Brown 1973 in Goldschneider and",
"ref_id": null
},
{
"start": 1630,
"end": 1648,
"text": "DeKeyser 2005: 72)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 675,
"end": 682,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "On the syntactic level, all morphs decrease the complexity of the original corpus to roughly the same degree. Calculating the difference between the average syntactic complexity score of the original text and each morph-manipulated text, the textual morph complexity at the syntactic level is obtained for each morph. In syntactic terms, this is the amount of complexity a given morph reduces in the original text. The syntactic complexity ranking (Figure 3 ) of the morphs is in decreasing order of complexity: third person singular -s, -ed, -ing, genitive -s and last plural -s.",
"cite_spans": [],
"ref_spans": [
{
"start": 448,
"end": 457,
"text": "(Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "Finally, a two-sided Pearson's correlation test is calculated to test whether textual morph complexity on the morphological and syntactic level is sensitive to frequency effects. In other words, does the token frequency of the morphs in the corpus influence their morphological and syntactic complexity contribution to the corpus? Pearson's correlation coefficient for morphological complexity and token frequency is very low ( r = 0.36, p = 0.55), while the coefficient for syntactic complexity and token frequency is almost zero (r = \u22120.04, p = 0.95). This indicates that the complexity contribution of a given morph type to the morphological and syntactic complexity in the corpus does not significantly depend on its token frequency.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "FIGURE 3 Syntactic ranking of morphs according to textual morph complexity in the mixed-genre corpus. Abscissa indexes increased syntactic complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Morphs",
"sec_num": "5"
},
{
"text": "In this section the functional constructions progressive, passive, perfect and the two future markers going to and will are analysed, and their quantitative contribution to the morphological and syntactic complexity in the mixed-genre corpus is assessed. Moreover, a ranking of their textual complexity on the syntactic and morphological level is established. Figure 4 plots the constructions by syntactic and morphological complexity. The original text, situated in the top right quadrant of the plot, is morphologically and syntactically almost the most complex text. The two texts without the future markers are positioned in the top right quadrant in close vicinity to the original text: while going to is virtually identical to the original and its presence or absence does not affect the complexity of the original corpus, the future marker will is the only construction which decreases morphological complexity in the original corpus. The texts without the progressive, perfect and passive constructions, clustering in the bottom left quadrant, are morphologically and syntactically less complex than the original. In other words, their presence increases morphological and syntactic complexity in the text. This finding dovetails with intuitions as the functional constructions should all-apart from the future markers-affect both word order and word form cutting across morphology and syntax. Let me illustrate this point; the passive construction, for example, consists of two discrete components, a form of the auxiliary verb be and a verb marked as past participle. It can thus be said that the sequence 'auxiliary be + past participle' signals passive. The construction were arrest-ed thus cuts across syntax and morphology.",
"cite_spans": [],
"ref_spans": [
{
"start": 360,
"end": 368,
"text": "Figure 4",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "FIGURE 5 Morphological ranking of constructions according to textual construction complexity in the mixed-genre corpus. Abscissa indexes increased morphological complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "Although, the constructions passive, perfect and progressive, all increase morphological complexity, the degree of complexity they contribute to the original text varies. The differences between the morphological complexity scores of the construction manipulated texts and the original text are calculated and visualised in Figure 5 . The textual complexity of the constructions on the morphological level is inferred from this contribution to the morphological complexity in the corpus. Constructions which contribute more morphological complexity are regarded as comparatively more complex. Passive and perfect are the most morphologically complex constructions and are equally morphologically complex (cf. Section 3). Progressive is slightly less complex. This is probably due to the fact that the -ing participle is more regular than the past participles, which can take different forms (e.g. walked, gone, eat-en) and, according to the literature (see e.g. McWhorter 2001b (see e.g. McWhorter , 2012 , irregularity increases complexity.",
"cite_spans": [
{
"start": 952,
"end": 977,
"text": "(see e.g. McWhorter 2001b",
"ref_id": null
},
{
"start": 978,
"end": 1004,
"text": "(see e.g. McWhorter , 2012",
"ref_id": null
}
],
"ref_spans": [
{
"start": 324,
"end": 332,
"text": "Figure 5",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "In contrast, the two future markers affect the complexity of the original text to a much lesser extent than the other constructions-even without the markers the morphological structures of the text remain more or less intact. In fact, the future markers, particularly will, decrease morphological complexity. This suggests that analytical, invariant markers are less complex than inflectional markers due to their regularity and transparency (Szmrecsanyi 2009; Szmrecsanyi and Kortmann 2009; Nichols 2009; Trudgill 2004) . Despite the fact that frequency is not a factor influencing construction complexity in general (see below), it seems plausible that the complexity of going to which occurs only thirteen times in total, might be related to its frequency.",
"cite_spans": [
{
"start": 442,
"end": 460,
"text": "(Szmrecsanyi 2009;",
"ref_id": "BIBREF38"
},
{
"start": 461,
"end": 491,
"text": "Szmrecsanyi and Kortmann 2009;",
"ref_id": "BIBREF39"
},
{
"start": 492,
"end": 505,
"text": "Nichols 2009;",
"ref_id": "BIBREF30"
},
{
"start": 506,
"end": 520,
"text": "Trudgill 2004)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "Syntactically, all constructions increase the complexity in the original corpus, thus their textual complexity on the syntactic level is an indicator for the amount of complexity a given construction adds to the original. Figure 6 displays the ranking of the constructions according to their syntactic complexity contributions, i.e. the difference in syntactic complexity between each construction-manipulated text and the original. Perfect and passive are roughly of equal complexity and the most complex constructions, i.e. they add most syntactic complexity to the original text. Progressive also adds a substantial amount of complexity and closely follows perfect and passive in the ranking. The two future markers hardly change the syntactic complexity of the original text as syntactic structures remain largely intact even without the markers.",
"cite_spans": [],
"ref_spans": [
{
"start": 222,
"end": 230,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "A two-sided Pearson's correlation test establishes that the complexity a given construction contributes to the syntactic and morphological complexity in the corpus does, generally, not depend on its token frequency in the corpus (syntactic complexity: r = \u22120.75, p = 0.14, morphological complexity: r = \u22120.67, p = 0.21). However, the quasi \"zero effect\" of the future marker going to on the syntactic and morphological complexity in the corpus suggests that in this particular case, frequency might play a role.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "FIGURE 6 Syntactic ranking of constructions according to textual construction complexity in the mixed-genre corpus. Abscissa indexes increased syntactic complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Constructions",
"sec_num": "6"
},
{
"text": "This chapter ventured into methodologically unexplored territory by experimenting with a new flavour of the Juola-style compression technique, targeted manipulation. Previous studies using compression algorithms have only addressed morphological and syntactic complexity from a bird's eye perspective (e.g. Ehret and Szmrecsanyi to appear; Juola 1998 Juola , 2008 Sadeniemi et al. 2008) . In filling this gap, I have demonstrated how compression algorithms can be used to address morphology and syntax in detail by measuring the contribution of specific linguistic features to the morphological and syntactic complexity in a mixed-genre corpus. In more general terms, this paper shows that Kolmogorov measurements yield linguistically meaningful results and provides evidence for the validity of the compression technique. First, targeted manipulation established that a larger amount of morphological marker types leads to a larger amount of morphological complexity in the corpus. More specifically, more irregular and non-transparent morphs were found to be more complex than regular morphs. On the other hand, the presence of more marker types increases syntactic simplicity by faciliting the prediction of patterns in the text. The functional constructions analysed, with the exception of the future markes will and going to, increase both morphological and syntactic complexity in the corpus. This finding suggests that analytical, invariant markers are considerably less complex than inflected morphosyntactic patterns. While these results in themselves are nothing to write home about, they underline the effectiveness of targeted manipulation because they are in line with well-established, quantitative complexity metrics (McWhorter 2001b (McWhorter , 2012 Szmrecsanyi 2009; Szmrecsanyi and Kortmann 2009; Trudgill 2004) and connect with findings on morpheme acquisition order (Brown 1973; de Villiers and de Villiers 1973 : see also Goldschneider and DeKeyser (2005) ).",
"cite_spans": [
{
"start": 307,
"end": 339,
"text": "Ehret and Szmrecsanyi to appear;",
"ref_id": null
},
{
"start": 340,
"end": 350,
"text": "Juola 1998",
"ref_id": "BIBREF14"
},
{
"start": 351,
"end": 363,
"text": "Juola , 2008",
"ref_id": "BIBREF15"
},
{
"start": 364,
"end": 386,
"text": "Sadeniemi et al. 2008)",
"ref_id": "BIBREF33"
},
{
"start": 1732,
"end": 1748,
"text": "(McWhorter 2001b",
"ref_id": "BIBREF24"
},
{
"start": 1749,
"end": 1766,
"text": "(McWhorter , 2012",
"ref_id": "BIBREF25"
},
{
"start": 1767,
"end": 1784,
"text": "Szmrecsanyi 2009;",
"ref_id": "BIBREF38"
},
{
"start": 1785,
"end": 1815,
"text": "Szmrecsanyi and Kortmann 2009;",
"ref_id": "BIBREF39"
},
{
"start": 1816,
"end": 1830,
"text": "Trudgill 2004)",
"ref_id": "BIBREF42"
},
{
"start": 1887,
"end": 1899,
"text": "(Brown 1973;",
"ref_id": "BIBREF6"
},
{
"start": 1900,
"end": 1932,
"text": "de Villiers and de Villiers 1973",
"ref_id": "BIBREF9"
},
{
"start": 1944,
"end": 1977,
"text": "Goldschneider and DeKeyser (2005)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Concluding remarks",
"sec_num": "7"
},
{
"text": "Second, the textual complexity of the features analysed is generally independent of their token frequency in the corpus. However, the case of the future marker going to, which is the feature with the lowest token frequency in the corpus and occurs only 13 times in total, implies that targeted manipulation is not suitable for measuring low-frequency phenomena. Establishing the minimum token frequency which is required for targeted manipulation should therefore be put on the agenda of future research on compression and complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Concluding remarks",
"sec_num": "7"
},
{
"text": "It goes without saying that the compression technique, and thus targeted manipulation, is not without flaws. Compression algorithms are totally agnostic about language intrinsic knowledge such as formmeaning relationships. This ofttimes mentioned blemish is, however, also one of the major assets of the compression technique: it is radically objective. Furthermore, the technique works on and is restricted to written text databases. This is another way of saying that the technique depends to some degree on orthographic conventions and transcription protocols.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Concluding remarks",
"sec_num": "7"
},
{
"text": "In spite of these drawbacks, this chapter provides a hitherto missing part in algorihtmic complexity research by establishing that compression algorithms are sensitive to and capable of capturing the (ir)regularity of specific linguistic patterns. However, much work is still needed to explore the full potential of information-theoretic methods in complexity research. An analysis of intertextual variation, the exact nature of algorithmically measured complexity and the linguistic meaning of compressed strings is outside the scope of this paper but is currently being explored by the author (Ehret in Tukey's HSD for average syntactic and morphological complexity scores of construction-manipulated texts and original in the mixed-genre corpus. The statistics include the difference between the means and the adjusted p-value per pair.",
"cite_spans": [
{
"start": 595,
"end": 604,
"text": "(Ehret in",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Concluding remarks",
"sec_num": "7"
},
{
"text": "December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Gzip Version 1.2.4. Published under the GNU General Public License. Written by Jean-Loup Gailly and Mark Adler. URL http://www.gzip.org/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The morphological complexity score is defined as negative so that higher scores indicate higher complexity.4 Unless otherwise indicated, all statistics are implemented in R Version 3.2. R: A language and environment for statistical computing. Developing Core Team 2008. R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0, URL http://www.R-project.org 50 / LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Targeted manipulation is a text-based method. Therefore, the exact quantity of a feature's contribution to the morphological and syntactic complexity of a given text may vary according to the morphological and syntactic complexity of the original text, respectively.6 No distinction is made between inflectional and non-inflectional occurrences of the morphs (he is singing vs. he hates singing).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Python Software Foundation. Python Language Reference, Version 3. URL http://www.python.org.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "/ LiLT volume 11, issue 2 December 2014",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "I am grateful to the audience of the 2013 ICLE workshop on \"Theoretical and Computational Morphology: New Trends and Synergies\" for constructive feedback, and to Benedikt Szmrecsanyi and Christoph Wolk for methodical advice. In addition, Kimmo Kettunen and two anonymous referees provided me with helpful comments. I would also like to thank Jens Stimpfle for practical support with python programming. The usual disclaimers apply.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
},
{
"text": "Brown's acquisition order of fourteen grammatical morphemes. The mean order across the three children is reported here according to Goldschneider and DeKeyser (2005: 72) .1. progressive -ing 2. preposition in 3. preposition on 4. plural -s 5. past irregular (e.g. went, brought 6. genitive -s 7. uncontractible copula 8. articles a, the 9. past regular -ed 10. 3rd ps sg regular (e.g. sing-s) 11. 3rd ps sg irregular (e.g. does, has) 12. uncontractible auxiliary 13. contractible copula 14. uncontractible copula",
"cite_spans": [
{
"start": 132,
"end": 169,
"text": "Goldschneider and DeKeyser (2005: 72)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Appendix A Appendix B",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Simple grammars, complex languages",
"authors": [
{
"first": "Jacques",
"middle": [],
"last": "Arends",
"suffix": ""
}
],
"year": 2001,
"venue": "Linguistic Typology",
"volume": "5",
"issue": "2/3",
"pages": "180--182",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Arends, Jacques. 2001. Simple grammars, complex languages. Linguistic Typology 5(2/3):180-182.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Analyzing Linguistic Data: A Practical Introduction to",
"authors": [
{
"first": "R",
"middle": [],
"last": "Baayen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Harald",
"suffix": ""
}
],
"year": 2008,
"venue": "Statistics Using R",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Baayen, R. Harald. 2008. Analyzing Linguistic Data: A Practical Introduction to Statistics Using R. Cambridge: Cambridge University Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Is there a \"natural sequence\" in adult second language learning?",
"authors": [
{
"first": "Nathalie",
"middle": [],
"last": "Bailey",
"suffix": ""
},
{
"first": "Carolyn",
"middle": [],
"last": "Madden",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"D"
],
"last": "Krashen",
"suffix": ""
}
],
"year": 1974,
"venue": "Language Learning",
"volume": "24",
"issue": "2",
"pages": "235--243",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bailey, Nathalie, Carolyn Madden, and Stephen D. Krashen. 1974. Is there a \"natural sequence\" in adult second language learning? Language Learning 24(2):235-243.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Flexibility and consistency in word order patterns in the languages of europe",
"authors": [
{
"first": "Dik",
"middle": [],
"last": "Bakker",
"suffix": ""
}
],
"year": 1998,
"venue": "Constituent order in the languages of Europe",
"volume": "",
"issue": "",
"pages": "384--419",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bakker, Dik. 1998. Flexibility and consistency in word order patterns in the languages of europe. In A. Siewierska, ed., Constituent order in the languages of Europe, pages 384-419. Berlin: Mouton de Gruyter.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Quantifying and measuring morphological complexity",
"authors": [
{
"first": "Max",
"middle": [],
"last": "Bane",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 26th West Coast Conference on Formal Linguistics",
"volume": "",
"issue": "",
"pages": "69--76",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bane, Max. 2008. Quantifying and measuring morphological complexity. In Charles B. Chang and Hannah J. Haynie, eds., Proceedings of the 26th West Coast Conference on Formal Linguistics, pages 69-76. Somerville, MA: Cascadilla Proceedings Project.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Language and Human Behaviour",
"authors": [
{
"first": "Derek",
"middle": [],
"last": "Bickerton",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bickerton, Derek. 1995. Language and Human Behaviour . Seattle: University of Washington Press.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A First Language. The Early Stages",
"authors": [
{
"first": "Roger",
"middle": [],
"last": "Brown",
"suffix": ""
}
],
"year": 1973,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Brown, Roger. 1973. A First Language. The Early Stages. Cambridge, Mass.: Harvard University Press.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The Cambridge Encyclopedia of Language",
"authors": [
{
"first": "David",
"middle": [],
"last": "Crystal",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Crystal, David. 1987. The Cambridge Encyclopedia of Language. Cambridge: Cambridge University Press.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The growth and maintenance of linguistic complexity",
"authors": [
{
"first": "\u00d6sten",
"middle": [],
"last": "Dahl",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dahl,\u00d6sten. 2004. The growth and maintenance of linguistic complexity. Amsterdam, Philadelphia: John Benjamins.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A cross-sectional study of the acquisition of grammatical morphemes in child speech",
"authors": [
{
"first": "Jill",
"middle": [],
"last": "De Villiers",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "De",
"suffix": ""
},
{
"first": "Villiers",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1973,
"venue": "Journal of Psycholinguistic Research",
"volume": "2",
"issue": "3",
"pages": "267--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "de Villiers, Jill and Peter de Villiers. 1973. A cross-sectional study of the acquisition of grammatical morphemes in child speech. Journal of Psy- cholinguistic Research 2(3):267-278.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Exploring information-theoretic methods to assess linguistic complexity in English",
"authors": [
{
"first": "Katharina",
"middle": [],
"last": "Ehret",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ehret, Katharina. in preparation. Exploring information-theoretic methods to assess linguistic complexity in English. Ph.D. thesis, Freiburg.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "An informationtheoretic approach to assess linguistic complexity",
"authors": [
{
"first": "Katharina",
"middle": [],
"last": "Ehret",
"suffix": ""
},
{
"first": "Benedikt",
"middle": [],
"last": "Szmrecsanyi",
"suffix": ""
}
],
"year": null,
"venue": "Complexity and Isolation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ehret, Katharina and Benedikt Szmrecsanyi. to appear. An information- theoretic approach to assess linguistic complexity. In R. Baechler and G. Seiler, eds., Complexity and Isolation. Berlin: de Gruyter.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Explaining the \"natural order of l2 morpheme acquisition\" in english: A meta-analysis of multiple determinants",
"authors": [
{
"first": "Jennifer",
"middle": [],
"last": "Goldschneider",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"M"
],
"last": "Dekeyser",
"suffix": ""
}
],
"year": 2005,
"venue": "Language Learning",
"volume": "55",
"issue": "S1",
"pages": "27--77",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Goldschneider, Jennifer and Robert M. DeKeyser. 2005. Explaining the \"nat- ural order of l2 morpheme acquisition\" in english: A meta-analysis of mul- tiple determinants. Language Learning 55(S1):27-77.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A course in modern linguistics",
"authors": [
{
"first": "Charles",
"middle": [],
"last": "Hockett",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Francis",
"suffix": ""
}
],
"year": 1958,
"venue": "Macmillan. 58005007 illus",
"volume": "22",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hockett, Charles Francis. 1958. A course in modern linguistics. New York: Macmillan. 58005007 illus. 22 cm.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Measuring linguistic complexity: the morphological tier",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Juola",
"suffix": ""
}
],
"year": 1998,
"venue": "Journal of Quantitative Linguistics",
"volume": "5",
"issue": "3",
"pages": "206--213",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Juola, Patrick. 1998. Measuring linguistic complexity: the morphological tier. Journal of Quantitative Linguistics 5(3):206-213.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Assessing linguistic complexity",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Juola",
"suffix": ""
}
],
"year": 2008,
"venue": "Language Complexity: Typology, Contact, Change",
"volume": "",
"issue": "",
"pages": "89--107",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Juola, Patrick. 2008. Assessing linguistic complexity. In M. Miestamo, K. Sin- nem\u00e4ki, and F. Karlsson, eds., Language Complexity: Typology, Contact, Change, pages 89-107. Amsterdam, Philadelphia: Benjamins.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Three approaches to the quantitative definition of information",
"authors": [
{
"first": "Andrej",
"middle": [
"N"
],
"last": "Kolmogorov",
"suffix": ""
}
],
"year": 1965,
"venue": "Problemy Peredachi Informatsii",
"volume": "1",
"issue": "1",
"pages": "3--11",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kolmogorov, Andrej N. 1965. Three approaches to the quantitative definition of information. Problemy Peredachi Informatsii 1(1):3-11.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Linguistic Complexity: Second Language Acquisition, Indigenization, Contact. Lingua & Litterae",
"authors": [],
"year": 2012,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kortmann, Bernd and Benedikt Szmrecsanyi, eds. 2012. Linguistic Com- plexity: Second Language Acquisition, Indigenization, Contact. Lingua & Litterae. Berlin/Boston: Walter de Gruyter.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Adult performance on the SLOPE test: More evidence for a natural sequence in adult second language acquisition",
"authors": [
{
"first": "Stephen",
"middle": [
"D"
],
"last": "Krashen",
"suffix": ""
},
{
"first": "Victoria",
"middle": [],
"last": "Sferlazza",
"suffix": ""
},
{
"first": "Lorna",
"middle": [],
"last": "Feldman",
"suffix": ""
},
{
"first": "Ann",
"middle": [],
"last": "Fathman",
"suffix": ""
}
],
"year": 1976,
"venue": "Language Learning",
"volume": "26",
"issue": "1",
"pages": "145--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Krashen, Stephen D., Victoria Sferlazza, Lorna Feldman, and Ann Fathman. 1976. Adult performance on the SLOPE test: More evidence for a nat- ural sequence in adult second language acquisition. Language Learning 26(1):145-151.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Linguistic Complexity: The Influence of Social Change on Verbal Inflection",
"authors": [
{
"first": "Wouter",
"middle": [],
"last": "Kusters",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kusters, Wouter. 2003. Linguistic Complexity: The Influence of Social Change on Verbal Inflection. Utrecht: LOT.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Complexity in linguistic theory, language learning and language change",
"authors": [
{
"first": "Wouter",
"middle": [],
"last": "Kusters",
"suffix": ""
}
],
"year": 2008,
"venue": "Language Complexity: Typology, Contact, Change",
"volume": "",
"issue": "",
"pages": "3--21",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kusters, Wouter. 2008. Complexity in linguistic theory, language learning and language change. In M. Miestamo, K. Sinnem\u00e4ki, and F. Karlsson, eds., Language Complexity: Typology, Contact, Change, pages 3-21. Ams- terdam, Philadelphia: Benjamins.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "The similarity metric",
"authors": [
{
"first": "Ming",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Bin",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Paul",
"middle": [
"M"
],
"last": "Vit\u00e1nyi",
"suffix": ""
}
],
"year": 2004,
"venue": "IEEE Transactions on Information Theory",
"volume": "50",
"issue": "12",
"pages": "3250--3264",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li, Ming, Xin Chen, Xin Li, Bin Ma, and Paul M. B Vit\u00e1nyi. 2004. The similarity metric. IEEE Transactions on Information Theory 50(12):3250- 3264.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "An introduction to Kolmogorov complexity and its applications",
"authors": [
{
"first": "Ming",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Paul",
"middle": [
"M"
],
"last": "Vitanyi",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li, Ming and Paul M. B Vitanyi. 1997. An introduction to Kolmogorov com- plexity and its applications. New York: Springer. 96042357 Ming Li, Paul Vit\u00e1nyi. ill. ; 25 cm. Graduate texts in computer science Includes biblio- graphical references (p. [591]-617) and index.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "What people ask david gil and why: Rejoinder to the replies",
"authors": [
{
"first": "John",
"middle": [],
"last": "Mcwhorter",
"suffix": ""
}
],
"year": 2001,
"venue": "Linguistic Typology",
"volume": "5",
"issue": "2/3",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McWhorter, John. 2001a. What people ask david gil and why: Rejoinder to the replies. Linguistic Typology 5(2/3).",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "The world's simplest grammars are creole grammars",
"authors": [
{
"first": "John",
"middle": [],
"last": "Mcwhorter",
"suffix": ""
}
],
"year": 2001,
"venue": "Linguistic Typology",
"volume": "6",
"issue": "",
"pages": "125--166",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McWhorter, John. 2001b. The world's simplest grammars are creole gram- mars. Linguistic Typology 6:125-166.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Complexity hotspot",
"authors": [
{
"first": "John",
"middle": [],
"last": "Mcwhorter",
"suffix": ""
}
],
"year": 2012,
"venue": "Linguistic Complexity: Second Language Acquisition, Indigenization, Contact, Linguae & Litterae",
"volume": "",
"issue": "",
"pages": "243--246",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McWhorter, John. 2012. Complexity hotspot. In B. Kortmann and B. Szm- recsanyi, eds., Linguistic Complexity: Second Language Acquisition, Indi- genization, Contact, Linguae & Litterae, pages 243-246. Berlin/Boston: Walter de Gruyter.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "On the feasibility of complexity metrics",
"authors": [
{
"first": "Matti",
"middle": [],
"last": "Miestamo",
"suffix": ""
}
],
"year": 2006,
"venue": "Finest Linguistics. Proceedings of the Annual Finnish and Estonian Conference of Linguistics",
"volume": "",
"issue": "",
"pages": "11--26",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Miestamo, Matti. 2006. On the feasibility of complexity metrics. In K. Kerge and M.-M. Sepper, eds., Finest Linguistics. Proceedings of the Annual Finnish and Estonian Conference of Linguistics [Publications of the De- partment of Estonian of Tallinn University 8] , pages 11-26. Tallinn: Tallinna\u00dclikooli Kirjastus.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Implicational hierarchies and grammatical complexity",
"authors": [
{
"first": "Matti",
"middle": [],
"last": "Miestamo",
"suffix": ""
}
],
"year": 2009,
"venue": "Language Complexity as an Evolving Variable",
"volume": "",
"issue": "",
"pages": "80--97",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Miestamo, Matti. 2009. Implicational hierarchies and grammatical complex- ity. In G. Sampson, D. Gil, and P. Trudgill, eds., Language Complexity as an Evolving Variable, pages 80-97. Oxford: Oxford University Press.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Language complexity: typology, contact, change",
"authors": [
{
"first": "Matti",
"middle": [],
"last": "Miestamo",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Miestamo, Matti, Kaius Sinnemki, and Fred Karlsson, eds. 2008. Language complexity: typology, contact, change. Amsterdam, Philadelphia: Ben- jamins.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Putting the bits together: an information theoretical perspective on morphological processing",
"authors": [
{
"first": "Moscoso",
"middle": [],
"last": "Del Prado Martin",
"suffix": ""
},
{
"first": "Fermin",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Aleksandar",
"middle": [],
"last": "Kostic",
"suffix": ""
},
{
"first": "R",
"middle": [
"Harald"
],
"last": "Baayen",
"suffix": ""
}
],
"year": 2004,
"venue": "Cognition",
"volume": "94",
"issue": "1",
"pages": "1--18",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Moscoso del Prado Martin, Fermin, Aleksandar Kostic, and R. Harald Baayen. 2004. Putting the bits together: an information theoretical per- spective on morphological processing. Cognition 94(1):1-18.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Linguistic complexity: a comprehensive definition and survey",
"authors": [
{
"first": "Johanna",
"middle": [],
"last": "Nichols",
"suffix": ""
}
],
"year": 2009,
"venue": "Language Complexity as an Evolving Variable",
"volume": "",
"issue": "",
"pages": "64--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nichols, Johanna. 2009. Linguistic complexity: a comprehensive definition and survey. In G. Sampson, D. Gil, and P. Trudgill, eds., Language Com- plexity as an Evolving Variable, pages 64-79. Oxford: Oxford University Press.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Contemporary Linguistics: An Introduction",
"authors": [
{
"first": "William",
"middle": [],
"last": "O'grady",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Dobrovolsky",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Aronoff",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "O'Grady, William, Michael Dobrovolsky, and Mark Aronoff. 1997. Contem- porary Linguistics: An Introduction. New York: St. Martin's Press, 3rd edn.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Methods and morphemes in second language acquisition research",
"authors": [
{
"first": "Ellen",
"middle": [],
"last": "Rosansky",
"suffix": ""
}
],
"year": 1976,
"venue": "Language Learning",
"volume": "26",
"issue": "2",
"pages": "409--425",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rosansky, Ellen. 1976. Methods and morphemes in second language acquisi- tion research. Language Learning 26(2):409-425.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Complexity of european union languages: A comparative approach",
"authors": [
{
"first": "Markus",
"middle": [],
"last": "Sadeniemi",
"suffix": ""
},
{
"first": "Kimmo",
"middle": [],
"last": "Kettunen",
"suffix": ""
},
{
"first": "Tiina",
"middle": [],
"last": "Lindh-Knuutila",
"suffix": ""
},
{
"first": "Timo",
"middle": [],
"last": "Honkela",
"suffix": ""
}
],
"year": 2008,
"venue": "Journal of Quantitative Linguistics",
"volume": "15",
"issue": "2",
"pages": "185--211",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sadeniemi, Markus, Kimmo Kettunen, Tiina Lindh-Knuutila, and Timo Honkela. 2008. Complexity of european union languages: A comparative approach. Journal of Quantitative Linguistics 15(2):185-211.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Data Compression. The complete Reference",
"authors": [
{
"first": "David",
"middle": [],
"last": "Salomon",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Salomon, David. 2007. Data Compression. The complete Reference.. London: Springer Verlag, 4th edn.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "A linguistic axiom challenged",
"authors": [
{
"first": "Geoffrey",
"middle": [],
"last": "Sampson",
"suffix": ""
}
],
"year": 2009,
"venue": "Language Complexity as an Evolving Variable",
"volume": "",
"issue": "",
"pages": "1--18",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sampson, Geoffrey. 2009. A linguistic axiom challenged. In G. Sampson, D. Gil, and P. Trudgill, eds., Language Complexity as an Evolving Variable, pages 1-18. Oxford: Oxford University Press.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "A mathematical theory of communication",
"authors": [
{
"first": "Claude",
"middle": [
"E"
],
"last": "Shannon",
"suffix": ""
}
],
"year": 1948,
"venue": "Bell System Technical Journal",
"volume": "27",
"issue": "",
"pages": "379--423",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shannon, Claude E. 1948. A mathematical theory of communication. Bell System Technical Journal 27:379-423.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Correlating complexity: A typological approach",
"authors": [
{
"first": "Ryan",
"middle": [
"K"
],
"last": "Shosted",
"suffix": ""
}
],
"year": 2006,
"venue": "Journal of Linguistic Typology",
"volume": "10",
"issue": "",
"pages": "1--40",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shosted, Ryan K. 2006. Correlating complexity: A typological approach. Journal of Linguistic Typology 10:1-40.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Typological parameters of intralingual variability: Grammatical analyticity versus syntheticity in varieties of english",
"authors": [
{
"first": "Benedikt",
"middle": [],
"last": "Szmrecsanyi",
"suffix": ""
}
],
"year": 2009,
"venue": "Language Variation and Change",
"volume": "21",
"issue": "3",
"pages": "319--353",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Szmrecsanyi, Benedikt. 2009. Typological parameters of intralingual vari- ability: Grammatical analyticity versus syntheticity in varieties of english. Language Variation and Change 21(3):319-353.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Between simplification and complexification: non-standard varieties of english around the world",
"authors": [
{
"first": "Benedikt",
"middle": [],
"last": "Szmrecsanyi",
"suffix": ""
},
{
"first": "Bernd",
"middle": [],
"last": "Kortmann",
"suffix": ""
}
],
"year": 2009,
"venue": "Language Complexity as an Evolving Variable",
"volume": "",
"issue": "",
"pages": "64--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Szmrecsanyi, Benedikt and Bernd Kortmann. 2009. Between simplification and complexification: non-standard varieties of english around the world. In G. Sampson, D. Gil, and P. Trudgill, eds., Language Complexity as an Evolving Variable, pages 64-79. Oxford: Oxford University Press.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Feature-rich part-of-speech tagging with a cyclic dependency network",
"authors": [
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Chirstopher",
"middle": [],
"last": "Manning",
"suffix": ""
},
{
"first": "Yoram",
"middle": [],
"last": "Singer",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "252--259",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Toutanova, Kristina, Dan Klein, Chirstopher Manning, and Yoram Singer. 2003. Feature-rich part-of-speech tagging with a cyclic dependency net- work. Proceedings of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies pages 252-259.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Contact and simplification: Historical baggage and directionality in linguistic change",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Trudgill",
"suffix": ""
}
],
"year": 2001,
"venue": "Linguistic Typology",
"volume": "5",
"issue": "2/3",
"pages": "371--374",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Trudgill, Peter. 2001. Contact and simplification: Historical baggage and directionality in linguistic change. Linguistic Typology 5(2/3):371-374.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Linguistic and social typology: The austronesian migrations and phoneme inventories",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Trudgill",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Trudgill, Peter. 2004. Linguistic and social typology: The austronesian mi- grations and phoneme inventories. Linguistic Typology 8:305-320. van der Lubbe, J. C. A. 1997. Information theory. Cambridge [England] ;",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "by Hendrik Jan Hoeve and Steve Gee. ill. ; 24 cm. Includes bibliographical references",
"authors": [
{
"first": "J",
"middle": [
"C A"
],
"last": "Van Der Lubbe",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "345--346",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "New York: Cambridge University Press. 96009421 J.C.A. van der Lubbe ; translated by Hendrik Jan Hoeve and Steve Gee. ill. ; 24 cm. Includes bibliographical references (p. 345-346) and index.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "A universal algorithm for sequential data compression",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Ziv",
"suffix": ""
},
{
"first": "Abraham",
"middle": [],
"last": "Lempel",
"suffix": ""
}
],
"year": 1977,
"venue": "IEEE Transactions on Information Theory IT",
"volume": "23",
"issue": "3",
"pages": "337--343",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ziv, Jacob and Abraham Lempel. 1977. A universal algorithm for sequen- tial data compression. IEEE Transactions on Information Theory IT- 23(3):337-343.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Morphological ranking of morphs according to textual morph complexity in the mixed-genre corpus. Abscissa indexes increased morphological complexity."
},
"FIGREF1": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Morphological by syntactic complexity of construction-manipulated texts and original text. Abscissa indexes increased syntactic complexity, ordinate indexes increased morphological complexity."
},
"FIGREF2": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Tukey's HSD for average syntactic and morphological complexity scores of morph-manipulated texts and original in the mixed-genre corpus. The statistics include the difference between the means and the adjusted p-value per pair. Legend: orig = original, pos = genitive -s, vbd = -ed, vbz = third person singular s, nns = plural -s, vbg = ing."
},
"TABREF1": {
"html": null,
"content": "<table/>",
"num": null,
"type_str": "table",
"text": "Number of words per corpus component of the mixed-genre corpus."
},
"TABREF3": {
"html": null,
"content": "<table><tr><td>[Alice]</td></tr><tr><td>(4)</td></tr><tr><td>[Mark]</td></tr><tr><td>(5)</td></tr><tr><td>[Alice]</td></tr><tr><td>(6)</td></tr><tr><td>[Euro-Congo]</td></tr><tr><td>(7)</td></tr></table>",
"num": null,
"type_str": "table",
"text": "Alice was [beginning] ing to get very tired of [sitting] ing by her sister on the bank and of having nothing to do: [. . . ]. b. Alice was begin to get very tired of sit by her sister on the bank and of having nothing to do: [. . . ]. . [. . . ] John [appeared] ed baptizing in the wilderness and proclaiming a baptism of repentance for the forgiveness of sins. b. [. . . ] John appear baptizing in the wilderness and proclaiming a baptism of repentance for the forgiveness of sins. . [. . . ] and was surprised to see that she had put on one of the [Rabbit's] genitive s little white kid gloves while she was talking. b. [. . . ] and was surprised to see that she had put on one of the Rabbit little white kid gloves while she was talking. . [. . . ] which sparked clash between angry demonstrator and police, according to witnesses. If the Lisbon treaty is reopened, Cameron has to tread carefully between Tory backbenchers [. . . ] and most of the rest of the EU, who are wary of getting bogged down in a row about what Britain [wants] 3rd person s . b. If the Lisbon treaty is reopened, Cameron has to tread carefully between Tory backbenchers [. . . ] and most of the rest of the EU, who are wary of getting bogged down in a row about what Britain want."
},
"TABREF4": {
"html": null,
"content": "<table><tr><td>-(12).</td></tr><tr><td>(8)</td></tr><tr><td>[Alice]</td></tr><tr><td>(9)</td></tr><tr><td>Euro-Congo]</td></tr><tr><td>(10)</td></tr></table>",
"num": null,
"type_str": "table",
"text": "Alice [was beginning] progressive to get very tired of sitting by her sister on the bank and of having nothing to do: [. . . ]. b. Alice begin to get very tired of sit by her sister on the bank and of having nothing to do: [. . . ]."
},
"TABREF6": {
"html": null,
"content": "<table><tr><td>Construction</td><td>Standard deviation</td><td/></tr><tr><td/><td colspan=\"2\">Morphological complexity Syntactic complexity</td></tr><tr><td>original</td><td>0.00123</td><td>0.00133</td></tr><tr><td>going to</td><td>0.00124</td><td>0.00125</td></tr><tr><td>passive</td><td>0.00125</td><td>0.00132</td></tr><tr><td>perfect</td><td>0.00125</td><td>0.00128</td></tr><tr><td>progressive</td><td>0.00123</td><td>0.00153</td></tr><tr><td>will</td><td>0.00121</td><td>0.00133</td></tr></table>",
"num": null,
"type_str": "table",
"text": "Dispersion across individual measuring points of morphological and syntactic complexity scores in the mixed-genre corpus by construction."
}
}
}
}