Base_JSON/prefixB/json/bea/2020.bea-1.1.json

{
    "paper_id": "2020",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T01:10:02.993460Z"
    },
    "title": "Linguistic Features for Readability Assessment",
    "authors": [
        {
            "first": "Tovly",
            "middle": [],
            "last": "Deutsch",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Harvard University",
                "location": {}
            },
            "email": "tdeutsch@college.harvard.edu"
        },
        {
            "first": "Masoud",
            "middle": [],
            "last": "Jasbi",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Harvard University",
                "location": {}
            },
            "email": "jasbi@fas.harvard.edu"
        },
        {
            "first": "Stuart",
            "middle": [],
            "last": "Shieber",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Harvard University",
                "location": {}
            },
            "email": "shieber@seas.harvard.edu"
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "Readability assessment aims to automatically classify text by the level appropriate for learning readers. Traditional approaches to this task utilize a variety of linguistically motivated features paired with simple machine learning models. More recent methods have improved performance by discarding these features and utilizing deep learning models. However, it is unknown whether augmenting deep learning models with linguistically motivated features would improve performance further. This paper combines these two approaches with the goal of improving overall model performance and addressing this question. Evaluating on two large readability corpora, we find that, given sufficient training data, augmenting deep learning models with linguistically motivated features does not improve state-of-the-art performance. Our results provide preliminary evidence for the hypothesis that the state-of-theart deep learning models represent linguistic features of the text related to readability. Future research on the nature of representations formed in these models can shed light on the learned features and their relations to linguistically motivated ones hypothesized in traditional approaches.",
    "pdf_parse": {
        "paper_id": "2020",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "Readability assessment aims to automatically classify text by the level appropriate for learning readers. Traditional approaches to this task utilize a variety of linguistically motivated features paired with simple machine learning models. More recent methods have improved performance by discarding these features and utilizing deep learning models. However, it is unknown whether augmenting deep learning models with linguistically motivated features would improve performance further. This paper combines these two approaches with the goal of improving overall model performance and addressing this question. Evaluating on two large readability corpora, we find that, given sufficient training data, augmenting deep learning models with linguistically motivated features does not improve state-of-the-art performance. Our results provide preliminary evidence for the hypothesis that the state-of-theart deep learning models represent linguistic features of the text related to readability. Future research on the nature of representations formed in these models can shed light on the learned features and their relations to linguistically motivated ones hypothesized in traditional approaches.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "Readability assessment poses the task of identifying the appropriate reading level for text. Such labeling is useful for a variety of groups including learning readers and second language learners. Readability assessment systems generally involve analyzing a corpus of documents labeled by editors and authors for reader level. Traditionally, these documents are transformed into a number of linguistic features that are fed into simple models like SVMs and MLPs (Schwarm and Ostendorf, 2005; Vajjala and Meurers, 2012) .",
                "cite_spans": [
                    {
                        "start": 463,
                        "end": 492,
                        "text": "(Schwarm and Ostendorf, 2005;",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 493,
                        "end": 519,
                        "text": "Vajjala and Meurers, 2012)",
                        "ref_id": "BIBREF18"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "More recently, readability assessment models utilize deep neural networks and attention mechanisms (Martinc et al., 2019) . While such models achieve state-of-the-art performance on readability assessment corpora, they struggle to generalize across corpora and fail to achieve perfect classification. Often, model performance is improved by gathering additional data. However, readability annotations are time-consuming and expensive given lengthy documents and the need for qualified annotators. A different approach to improving model performance involves fusing the traditional and modern paradigms of linguistic features and deep learning. By incorporating the inductive bias provided by linguistic features into deep learning models, we may be able to reduce the limitations posed by the small size of readability datasets. In this paper, we evaluate the joint use of linguistic features and deep learning models. We achieve this fusion by simply taking the output of deep learning models as features themselves. Then, these outputs are joined with linguistic features to be further fed into some other model like an SVM. We select linguistic features based on a broad psycholinguistically-motivated composition by Vajjala Balakrishna (2015) . Transformers and Hierarchical attention networks were selected as the deep learning models because of their state-ofart performance in readability assessment. Models were evaluated on two of the largest available corpora for readability assessment: WeeBit and Newsela. We also evaluate with different sized training sets to investigate the use of linguistic features in data-poor contexts. Our results find that, given sufficient training data, the linguistic features do not provide a substantial benefit over deep learning methods.",
                "cite_spans": [
                    {
                        "start": 99,
                        "end": 121,
                        "text": "(Martinc et al., 2019)",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 1220,
                        "end": 1246,
                        "text": "Vajjala Balakrishna (2015)",
                        "ref_id": "BIBREF19"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The rest of this paper is organized as follows. Related research is described in section 2. Section 3 details our preprocessing, features, and model construction. Section 4 presents model evaluations on two corpora. Section 5 discusses the implications of our results.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "We provide a publicly available version of the code used for our experiments. 1",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Work on readability assessment has involved progress on three core components: corpora, features, and models. While early work utilized small corpora, limited feature sets, and simple models, modern research has experimented with a broad set of features and deep learning techniques.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Labeled corpora can be difficult to assemble given the time and qualifications needed to assign a text a readability level. The size of readability corpora expanded significantly with the introduction of the WeeklyReader corpus by Schwarm and Ostendorf (2005) . Composed of articles from an educational magazine, the WeeklyReader corpus contains roughly 2,400 articles. The WeeklyReader corpus was then built upon by Vajjala and Meurers (2012) by adding data from the BBC Bitesize website to form the WeeBit corpus. This WeeBit corpus is larger, containing roughly 6,000 documents, while also spanning a greater range of readability levels. Within these corpora, topic and readability are highly correlated. Thus, Xia et al. (2016) constructed the Newsela corpus in which each article is represented at multiple reading levels thereby diminishing this correlation.",
                "cite_spans": [
                    {
                        "start": 231,
                        "end": 259,
                        "text": "Schwarm and Ostendorf (2005)",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 417,
                        "end": 443,
                        "text": "Vajjala and Meurers (2012)",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 714,
                        "end": 731,
                        "text": "Xia et al. (2016)",
                        "ref_id": "BIBREF23"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Early work on readability assessment, such as that of Flesch (1948) , extracted simple textual features like character count. More recently, Schwarm and Ostendorf (2005) analyzed a broader set of features including out-of-vocabulary scores and syntactic features such as average parse tree height. Vajjala and Meurers (2012) assembled perhaps the broadest class of features. They incorporated measures shown by Lu (2010) to correlate well with second language acquisition measures, as well as psycholinguistically relevant features from the Celex Lexical database and MRC Psycholinguistic Database (Baayen et al., 1995; Wilson, 1988) .",
                "cite_spans": [
                    {
                        "start": 54,
                        "end": 67,
                        "text": "Flesch (1948)",
                        "ref_id": "BIBREF4"
                    },
                    {
                        "start": 141,
                        "end": 169,
                        "text": "Schwarm and Ostendorf (2005)",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 298,
                        "end": 324,
                        "text": "Vajjala and Meurers (2012)",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 411,
                        "end": 420,
                        "text": "Lu (2010)",
                        "ref_id": "BIBREF13"
                    },
                    {
                        "start": 598,
                        "end": 619,
                        "text": "(Baayen et al., 1995;",
                        "ref_id": "BIBREF1"
                    },
                    {
                        "start": 620,
                        "end": 633,
                        "text": "Wilson, 1988)",
                        "ref_id": "BIBREF21"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Traditional feature formulas, like the Flesch formula, relied on linear models. Later work progressed to more complex related models like SVMs (Schwarm and Ostendorf, 2005) . Most recently, state-of-art-performance has been achieved on readability assessment with deep neural network incor-porating attention mechanisms. These approaches ignore linguistic features entirely and instead feed the raw embeddings of input words, relying on the model itself to extract any relevant features. Specifically, Martinc et al. (2019) found that a pretrained transformer model achieved state-of-the-art performance on the WeeBit corpus while a hierarchical attention network (HAN) achieved state-of-the-art performance on the Newsela corpus.",
                "cite_spans": [
                    {
                        "start": 143,
                        "end": 172,
                        "text": "(Schwarm and Ostendorf, 2005)",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 502,
                        "end": 523,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Deep learning approaches generally exclude any specific linguistic features. In general, a \"featureless\" approach is sensible given the hypothesis that, with enough data, training, and model complexity, a model should learn any linguistic features that researchers might attempt to precompute. However, precomputed linguistic features may be useful in data-poor contexts where data acquisition is expensive and error-prone. For this reason, in this paper we attempt to incorporate linguistic features with deep learning methods in order to improve readability assessment.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "The WeeBit corpus was assembled by Vajjala and Meurers (2012) by combining documents from the WeeklyReader educational magazine and the BBC Bitesize educational website. They selected classes to assemble a broad range of readability levels intended for readers aged 7 to 16. To avoid classification bias, they undersampled classes in order to equalize the number of documents in each class to 625. We term this downsampled corpus \"WeeBit downsampled\". Following the methodologies of Xia et al. (2016) and Martinc et al. (2019) , we applied additional preprocessing to the WeeBit corpus in order to remove extraneous material.",
                "cite_spans": [
                    {
                        "start": 35,
                        "end": 61,
                        "text": "Vajjala and Meurers (2012)",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 483,
                        "end": 500,
                        "text": "Xia et al. (2016)",
                        "ref_id": "BIBREF23"
                    },
                    {
                        "start": 505,
                        "end": 526,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "WeeBit",
                "sec_num": "3.1.1"
            },
            {
                "text": "The Newsela corpus (Xia et al., 2016) consists of 1,911 news articles each re-written up to 4 times in simplified manners for readers at different reading levels. This simplification process means that, for any given topic, there exist examples of material on that topic suited for multiple reading levels. This overlap in topic should make the corpus more challenging to label than the WeeBit corpus. In a similar manner to the WeeBit corpus, the Newsela corpus is labeled with grade levels ranging from grade 2 to grade 12. As with WeeBit, these labels can either be treated as classes or transformed into numeric labels for regression.",
                "cite_spans": [
                    {
                        "start": 19,
                        "end": 37,
                        "text": "(Xia et al., 2016)",
                        "ref_id": "BIBREF23"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Newsela",
                "sec_num": "3.1.2"
            },
            {
                "text": "Often, readability classes within a corpus are treated as unrelated. These approaches use raw labels as distinct unordered classes. However, readability labels are ordinal, ranging from lower to higher readability. Some work has addressed this issue such as the readability models of Flor et al. (2013) which predict grade levels via linear regression. To test different approaches to acknowledging this ordinality, we devised three methods for labeling the documents: \"classification\", \"age regression\", and \"ordered class regression\".",
                "cite_spans": [
                    {
                        "start": 284,
                        "end": 302,
                        "text": "Flor et al. (2013)",
                        "ref_id": "BIBREF5"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Labeling Approaches",
                "sec_num": "3.1.3"
            },
            {
                "text": "The classification approach uses the classes originally given. This approach does not suppose any ordinality of the classes. Avoiding such ordinality may be desirable for the sake of simplicity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Labeling Approaches",
                "sec_num": "3.1.3"
            },
            {
                "text": "\"Age regression\" applies the mean of the age ranges given by the constituent datasets. For instance, in this approach Level 2 documents from Weekly Reader would be given the label of 7.5 as they are intended for readers of ages 7-8. The advantage of age regression over standard classification is that it provides more precise information about the magnitude of readability differences.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Labeling Approaches",
                "sec_num": "3.1.3"
            },
            {
                "text": "Finally, \"ordered class regression\" assigns the classes equidistant integers ordered by difficulty. The least difficult class would be labeled \"0\", the second least difficult class would be labeled \"1\" and so on. As with age regression, this labeling results in a regression rather than classification problem. This method retains the advantage of age regression in demonstrating ordinality. However, ordered regression labeling removes information about the relative differences in difficulty between the classes, instead asserting that they are equidistant in difficulty. The motivation behind this loss of information is that such age differences between classes may not directly translate into differences of difficulty. For instance, the readability difference between documents intended for 7 or 8 yearolds may be much greater than between documents intended for 15 or 16 year-olds because reading development is likely accelerated in younger years.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Labeling Approaches",
                "sec_num": "3.1.3"
            },
            {
                "text": "For final model inferences, we used the classification approach for comparison to previous work. For intermediary CNN models, all three approaches were tested. As the different approaches with CNN models produced insubstantial differences, other model types were restricted to the simple classifi-cation approach.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Labeling Approaches",
                "sec_num": "3.1.3"
            },
            {
                "text": "Motivated by the success in using linguistic features for modeling readability, we considered a large range of textual analyses relevant to readability. In addition to utilizing features posed in the existing readability research, we investigated formulating new features with a focus on syntactic ambiguity and syntactic diversity. This challenging aspect of language appeared to be underutilized in existing readability literature.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Features",
                "sec_num": "3.2"
            },
            {
                "text": "To capture a variety of features, we utilized existing linguistic feature computation software 2 developed by Vajjala Balakrishna (2015) based on 86 feature descriptions in existing readability literature. Given the large number of features, in this section we will focus on the categories of features and their psycholinguistic motivations (where available) and properties. The full list of features used can be found in appendix A. Vajjala and Meurers (2012) refer to as \"traditional features\" for their use in long-standing readability formulae. They include characters per word, syllables per word, and traditional formulas based on such features like the Flesch-Kincaid formula (Kincaid et al., 1975) .",
                "cite_spans": [
                    {
                        "start": 434,
                        "end": 460,
                        "text": "Vajjala and Meurers (2012)",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 683,
                        "end": 705,
                        "text": "(Kincaid et al., 1975)",
                        "ref_id": "BIBREF8"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Existing Features",
                "sec_num": "3.2.1"
            },
            {
                "text": "Another set of feature types consists of counts and ratios of part-of-speech tags, extracted using the Stanford parser (Klein and Manning, 2003) . In addition to basic parts of speech like nouns, some features include phrase level constituent counts like noun phrases and verb phrases. All of these counts are normalized by either the number of word tokens or number of sentences to make them comparable across documents of differing lengths. These counts are not provided with any psycholinguistic motivation for their use; however, it is not an unreasonable hypothesis that the relative usage of these constituents varies across reading levels. Empirically, these features were shown to have some predictive power for readability. In addition to parts of speech counts, we also utilized word type counts as a simple baseline feature, that is, counting the number of instances of each possible word in the vocabulary. These counts are also divided by document length to generate proportions.",
                "cite_spans": [
                    {
                        "start": 119,
                        "end": 144,
                        "text": "(Klein and Manning, 2003)",
                        "ref_id": "BIBREF10"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Traditional Features The most basic features involve what",
                "sec_num": null
            },
            {
                "text": "Becoming more abstract than parts of speech, some features count complex syntactic constituent like clauses and subordinated clauses. Specifically, Lu (2010) found ratios involving sentences, clauses, and t-units 3 that correlated with second language learners' abilities to read a document. For many of the multi-word syntactic constituents previously described, such as noun phrases and clauses, features were also constructed of their mean lengths. Finally, properties of the syntactic trees themselves were analyzed such as their mean heights.",
                "cite_spans": [
                    {
                        "start": 148,
                        "end": 157,
                        "text": "Lu (2010)",
                        "ref_id": "BIBREF13"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Traditional Features The most basic features involve what",
                "sec_num": null
            },
            {
                "text": "Moving beyond basic features from syntactic parses, Vajjala Balakrishna (2015) also incorporated \"word characteristic\" features from linguistic databases. A significant source was the Celex Lexical Database Baayen et al. (1995) which \"consists of information on the orthography, phonology, morphology, syntax and frequency for more than 50,000 English lemmas\". The database appears to have a focus on morphological data such as whether a word may be considered a loan word and whether it contains affixes. It also contains syntactic properties that may not be apparent from a syntactic parse, e.g. whether a noun is countable. The MRC Psycholinguistic Database Wilson (1988) was also used with a focus on its age of acquisition ratings for words, an clear indicator of the appropriateness of a document's vocabulary.",
                "cite_spans": [
                    {
                        "start": 207,
                        "end": 227,
                        "text": "Baayen et al. (1995)",
                        "ref_id": "BIBREF1"
                    },
                    {
                        "start": 661,
                        "end": 674,
                        "text": "Wilson (1988)",
                        "ref_id": "BIBREF21"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Traditional Features The most basic features involve what",
                "sec_num": null
            },
            {
                "text": "We investigated additional syntactic features that may be relevant for readability but whose qualities were not targeted by existing features. These features were used in tandem with the existing linguistic features described previously; future work could utilize these novel feature independently to investigate their particular effect on readability information extraction. For generating syntactic parses, we used the PCFG (probabilistic context-free grammar) parser (Klein and Manning, 2003) from the Stanford Parser package.",
                "cite_spans": [
                    {
                        "start": 470,
                        "end": 495,
                        "text": "(Klein and Manning, 2003)",
                        "ref_id": "BIBREF10"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "Syntactic Ambiguity Sentences can have multiple grammatical syntactic parses. Therefore, syntactic parsers produce multiple parses annotated with parse likelihood. It may seem sensible to use the number of parses generated as a measure of ambiguity. However, this measure is extremely sensitive to sentence length as longer sentences tend to have more possible syntactic parses. Instead, if this list of probabilities is viewed as a distribution, the standard deviation of this distribution is likely to correlate with perceptions of syntactic ambiguity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "Definition 3.1. P D x",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "The parse deviation, P D x (s), of sentence s is the standard deviation of the distribution of the x most probable parse log probabilities for s. If s has less than x valid parses, the distribution is taken from all the valid parses.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "For large values of x, P D x (s) can be significantly sensitive to sentence length: longer sentences are likely to have more valid syntactic parses and thus create low probability tails that increase standard deviation. To reduce this sensitivity, an alternative involves measuring the difference between the largest and mean parse probability.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "Definition 3.2. P DM x P DM x (s)",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "is the difference between the largest parse log probability and the mean of the log probabilities of the x most probable parses for a sentence s. If s has less than x valid parses, the mean is taken over all the valid parses.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "As a compromise between parse investigation and the noise of implausible parses, we selected P DM 10 , P D 10 , and P D 2 as features to use in the models of this paper.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Novel Syntactic Features",
                "sec_num": "3.2.2"
            },
            {
                "text": "To capture the grammatical makeup of a sentence or document, we can count the usage of each part of speech (\"POS\"), phrase, or clause. The counts can be collected into a distribution. Then, the standard deviation of this distribution, P OSD dev , measures a sentence's grammatical heterogeneity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Part-of-Speech Divergence",
                "sec_num": null
            },
            {
                "text": "Definition 3.3. P OSD dev P OSD dev (d) is the standard deviation of the distribution of POS counts for document d.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Part-of-Speech Divergence",
                "sec_num": null
            },
            {
                "text": "Similarly, we may want to measure how this grammatical makeup differs from the composition of the document as a whole, a concept that might be termed syntactic uniqueness. To capture this concept, we measure the Kullback-Leibler divergence (Kullback and Leibler, 1951) between the sentence POS count distribution and the document POS count distribution.",
                "cite_spans": [
                    {
                        "start": 240,
                        "end": 268,
                        "text": "(Kullback and Leibler, 1951)",
                        "ref_id": "BIBREF11"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Part-of-Speech Divergence",
                "sec_num": null
            },
            {
                "text": "Definition 3.4. P OS div Let P (s) be the distribution of POS counts for sentence s in document d. Let Q be the distribution of POS counts for document d. Let |d| be the number of sentences in d.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Part-of-Speech Divergence",
                "sec_num": null
            },
            {
                "text": "P OS div (d) = s\u2208d D KL (P (s) Q) |d|",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Part-of-Speech Divergence",
                "sec_num": null
            },
            {
                "text": "A large range of model complexities were evaluated in order to ascertain the performance improvements, or lack thereof, of additional model complexity. In this section we will describe the specific construction and usage of these models for the experiments conducted in this paper, ordered roughly by model complexity.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Models",
                "sec_num": "3.3"
            },
            {
                "text": "We used the Scikit-Learn library (Pedregosa et al., 2011) for constructing SVM models. Hyperparameter optimization was performed using the guidelines suggested by Hsu et al. (2003) . From the Scikit-Learn library, we also utilized the linear support vector classifier (an SVM with a linear kernel) and logistic regression classifier. As simplicity was the aim for these evaluations, no hyperparameter optimization was performed. The logistic regression classifier was trained using the stochastic average gradient descent (\"sag\") optimizer.",
                "cite_spans": [
                    {
                        "start": 33,
                        "end": 57,
                        "text": "(Pedregosa et al., 2011)",
                        "ref_id": "BIBREF16"
                    },
                    {
                        "start": 163,
                        "end": 180,
                        "text": "Hsu et al. (2003)",
                        "ref_id": "BIBREF6"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SVMs, Linear Models, and Logistic Regression",
                "sec_num": null
            },
            {
                "text": "CNN Convolutional neural networks were selected for their demonstrated performance on sentence classification (Kim, 2014 ). The CNN model used in this paper is based on the one described by Kim (2014) and implemented using the Keras (Chollet and others, 2015), Tensorflow (Abadi et al., 2015) , and Magpie libraries.",
                "cite_spans": [
                    {
                        "start": 110,
                        "end": 120,
                        "text": "(Kim, 2014",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 190,
                        "end": 200,
                        "text": "Kim (2014)",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 272,
                        "end": 292,
                        "text": "(Abadi et al., 2015)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SVMs, Linear Models, and Logistic Regression",
                "sec_num": null
            },
            {
                "text": "Transformer The transformer (Vaswani et al., 2017 ) is a neural-network-based model that has achieved state-of-the-art results on a wide array of natural language tasks including readability assessment (Martinc et al., 2019) . Transformers utilize the mechanism of attention which allows the model to attend to specific parts of the input when constructing the output. Although they are formulated as sequence-to-sequence models, they can be modified to complete a variety of NLP tasks by placing an additional linear layer at the end of the network and training that layer to produce the desired output. This approach often achieves state-of-the-art results when combined with pretraining. In this paper, we use the BERT (Devlin et al., 2019 ) transformer-based model that is pretrained on BooksCorpus (800M words) (Zhu et al., 2015) and English Wikipedia. The model is then fine-tuned on a specific readability corpus such as WeeBit. The pretrained BERT model is sourced from the Huggingface transformers library (Wolf et al., 2019) and is composed of 12 hidden layers each of size 768 and 12 self-attention heads. The fine-tuning step utilizes an implementation by Martinc et al. (2019) . Among the pretrained transformers in the Huggingface library, there are transformers that can accept sequences of size 128, 256, and 512. The 128 sized model was chosen based on the finding by Martinc et al. (2019) that it achieved the highest performance on the WeeBit and Newsela corpora. Documents that exceeded the input sequence size were truncated.",
                "cite_spans": [
                    {
                        "start": 28,
                        "end": 49,
                        "text": "(Vaswani et al., 2017",
                        "ref_id": "BIBREF20"
                    },
                    {
                        "start": 202,
                        "end": 224,
                        "text": "(Martinc et al., 2019)",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 722,
                        "end": 742,
                        "text": "(Devlin et al., 2019",
                        "ref_id": "BIBREF3"
                    },
                    {
                        "start": 816,
                        "end": 834,
                        "text": "(Zhu et al., 2015)",
                        "ref_id": "BIBREF25"
                    },
                    {
                        "start": 1015,
                        "end": 1034,
                        "text": "(Wolf et al., 2019)",
                        "ref_id": "BIBREF22"
                    },
                    {
                        "start": 1168,
                        "end": 1189,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 1385,
                        "end": 1406,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SVMs, Linear Models, and Logistic Regression",
                "sec_num": null
            },
            {
                "text": "HAN The Hierarchical attention network involves feeding the input through two bidirectional RNNs each accompanied by a separate attention mechanism. One attention mechanism attends to the different words within each sentence while the second mechanism attends to the sentences within the document. These hierarchical attention mechanisms are thought to better mimic the structure of documents and consequently produce superior classification results. The implementation of the model used in this paper is identical to the original architecture described by Yang et al. (2016) and was provided by the authors of Martinc et al. (2019) based on code by Nguyen (2020).",
                "cite_spans": [
                    {
                        "start": 557,
                        "end": 575,
                        "text": "Yang et al. (2016)",
                        "ref_id": "BIBREF24"
                    },
                    {
                        "start": 611,
                        "end": 632,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SVMs, Linear Models, and Logistic Regression",
                "sec_num": null
            },
            {
                "text": "The neural network models thus far described take either the raw text or word vector embeddings of the text as input. They make no use of linguistic features such as those described in section 3.2. We hypothesized that combining these linguistic features with the deep neural models may improve their performance on readability assessment. Although these models theoretically represent similar features to those prescribed by the linguistic features, we hypothesized that the amount of data and model complexity may be insufficient to capture them. This can be evidenced in certain models failure to generalize across readability corpora. Martinc et al. (2019) found that the BERT model performed well on the WeeBit corpus, achieving a weighted F1 score of 0.8401, but performed poorly on the Newsela corpus only achieving an F1 score of 0.5759. They posit that this disparity occurred \"because BERT is pretrained as a language model, [therefore] it tends to rely more on semantic than structural differences during the classification phase and therefore performs better on problems with distinct semantic differences between readability classes\". Similarly a HAN was able to achieve better performance than BERT on the Newsela but performed substantially worse on the WeeBit corpus. Thus, under some evaluations the models have deficiencies and fail to generalize. Given these deficiencies, we hypothesized that the inductive bias provided by linguistic features may improve generalizability and overall model performance. In order to weave together the linguistic features and neural models, we take the simple approach of using the single numerical output of a neural model as a feature itself, joined with linguistic features, and then fed into one of the simpler non-neural models such as SVMs. SVMs were chosen as the final classification model for their simplicity and frequent use in integrating numerical features. The output of the neural model could be any of the label approaches such as grade classes or age regressions described in section 3.1. While all these labeling approaches were tested for CNNs, insubstantial differences in final inferences led us to restrict intermediary results to simple classification for other model types.",
                "cite_spans": [
                    {
                        "start": 639,
                        "end": 660,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Incorporating Linguistic Features with Neural Models",
                "sec_num": "3.4"
            },
            {
                "text": "All experiments involved 5-fold cross validation. All neural-network-based models were trained with the Adam optimizer (Kingma and Ba, 2015) with learning rates of 10 \u22123 ,10 \u22124 , and 2 \u22125 for the CNN, HAN, and transformer respectively. The HAN and CNN models were trained for 20 and 30 epochs. The transformer models were fine-tuned for 3 epochs.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Training and Evaluation Details",
                "sec_num": "3.5"
            },
            {
                "text": "All results are reported as either a weighted F1 or macro F1 score. To calculate weighted F1, first the F1 score is calculated for each class independently, as if each class was a case of binary classification. Then, these F1 score are combined in a weighted mean in which each class is weighted by the number of samples in that class. Thus, the weighted F1 score treats each sample equally but prioritizes the most common classes. The macro F1 is similar to the weighted F1 score in that F1 scores are first calculated for each class independently. However, for the macro F1 score, the class F1 scores are com- ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Training and Evaluation Details",
                "sec_num": "3.5"
            },
            {
                "text": "In this section we report the experimental results of incorporating linguistic features into readability assessment models. The two corpora, WeeBit and Newsela, are analyzed individually and then compared. Our results demonstrate that, given sufficient data, linguistic features provide little to no benefit compared to independent deep learning models. While the corpus experiment results demonstrate a portion of the approaches tested, the full results are available in appendix B",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Results",
                "sec_num": "4"
            },
            {
                "text": "For the Newsela corpus, while linguistic features were able to improve the performance of some models, the top performers did not utilize linguistic features. The results from the top performing models are presented in table 1. While the HAN performance was not surpassed by models with linguistic features, the transformer models were. This improvement indicates that lin-guistic features capture readability information that transformers cannot capture or have insufficient data to learn. The outsize effect of adding the linguistic features to the transformer models, resulting in a weighted F1 score improvement of 0.22, may reveal what types of information they address. Martinc et al. (2019) hypothesize that a pretrained language model \"tends to rely more on semantic than structural differences\" indicating that these features are especially suited to providing non-semantic information such as syntactic qualities.",
                "cite_spans": [
                    {
                        "start": 676,
                        "end": 697,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Newsela Experiments",
                "sec_num": "4.1"
            },
            {
                "text": "The WeeBit corpus was analyzed in two perspectives: the downsampled dataset and the full dataset. Raw results and model rankings were largely comparable between the two dataset sizes.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "WeeBit Experiments",
                "sec_num": "4.2"
            },
            {
                "text": "As with the Newsela corpus, the downsampled WeeBit corpus demonstrates no gains from being analyzed with linguistic features. The best performing model, a transformer, did not utilize linguistic features. The results for some of the best performing models are shown in table 2.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Downsampled WeeBit Experiments",
                "sec_num": "4.2.1"
            },
            {
                "text": "Differing with the Newsela corpus, the word type models performed near the top results on the WeeBit corpus comparably to the transformer models. Word type models have no access to word order, thus semantic and topic analysis form their core analysis. Therefore, this result supports the hypothesis of Martinc et al. (2019) that the pretrained transformer is especially attentive to semantic content. This result also indicates that the word type features can provide a significant portion of the information needed for successful readability assessment.",
                "cite_spans": [
                    {
                        "start": 302,
                        "end": 323,
                        "text": "Martinc et al. (2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Downsampled WeeBit Experiments",
                "sec_num": "4.2.1"
            },
            {
                "text": "The differing best performing model types between the two corpora are likely due to differing compositions. Unlike the Newsela corpus, the WeeBit corpus shows strong correlation between topic and difficulty. Extracting this topic and semantic content is thought to be a particular strength of the transformer (Martinc et al., 2019) leading to its improved results on this corpus.",
                "cite_spans": [
                    {
                        "start": 309,
                        "end": 331,
                        "text": "(Martinc et al., 2019)",
                        "ref_id": "BIBREF14"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Downsampled WeeBit Experiments",
                "sec_num": "4.2.1"
            },
            {
                "text": "All of the models were also tested on the full imbalanced WeeBit corpus, the top performing results of which are shown in table 3. Most performance figures increased modestly. However, these gains may not be seen if documents do not match the dis- tribution of this imbalanced dataset. Additionally, the ranking of models between the downsampled and standard WeeBit corpora showed little change.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Full WeeBit Experiments",
                "sec_num": "4.2.2"
            },
            {
                "text": "Although the SVM with transformer and linguistic features performed better than the transformer alone, this difference is extremely small (< 0.005) and thus not likely to be statistically significant.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Full WeeBit Experiments",
                "sec_num": "4.2.2"
            },
            {
                "text": "One hypothesis explaining the lack of effect of linguistic features is that models learn to extract those features given enough data. Thus, perhaps in more data-poor environments the linguistic features would prove more useful. To test this hypothesis, we evaluated two CNN-based models, one with linguistic features and one without, with various sized training subsets of the downsampled WeeBit corpus. The macro F1 at these various dataset sizes is shown in figure 1. Across the trials at different training set sizes, the test set is held constant thereby isolating the impact of training set size.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Effects of Training Set Size",
                "sec_num": "4.3"
            },
            {
                "text": "The hypothesis holds true for extremely small subsets of training data, those with fewer than 200 documents. Above this training set size, the addition of linguistic features results in insubstantial changes in performance. Thus, either the patterns exposed by the linguistic features are learnable with very little data or the patterns extracted by deep learning models differ significantly from the linguistic features. The latter appears more likely given that linguistic features are shown to improve performance for certain corpora (Newsela) and model types (transformers).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Effects of Training Set Size",
                "sec_num": "4.3"
            },
            {
                "text": "This result indicates that the use of linguistic features should be considered for small datasets. However, the dataset size at which those features lose utility is extremely small. Therefore, collecting additional data would often be more efficient than investing the time to incorporate linguistic features.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Effects of Training Set Size",
                "sec_num": "4.3"
            },
            {
                "text": "Overall, the failure of linguistic features to improve state-of-the-art deep learning models indicates that, given the available corpora, model complexity, and model structures, they do not add information over and beyond what the state-of-the-art models have already learned. However, in certain data-poor contexts, they can improve the performance of deep learning models. Similarly, with more diverse and more accurately and consistently labeled corpora, the linguistic features could prove more useful. It may be the case that the best performing models already achieve near the maximal possible performance on this corpus. The reason the maximal performance may be below a perfect score (an F1 score of 1) is disagreement and inconsistency in dataset labeling. Presumably the dataset was assessed by multiple labelers who may not have always agreed with one another or even with themselves. Thus, if either a new set of human labelers or the original labelers are tasked with labeling readability in this corpus, they may only achieve performance similar to the best performance seen in these experiments. Performing this human experiment would be a useful analysis of corpus validity and consistency. Similarly, a more diverse corpus (differing in length, topic, writing style, etc.) may prove more difficult for the models to label alone without additional training data; in this case, the linguistic features may prove more helpful in providing inductive bias.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Effects of Linguistic Features",
                "sec_num": "4.4"
            },
            {
                "text": "Additionally, the lack of improvement from adding linguistic features indicates that deep learning models may already be representing those features. Future work could probe the models for different aspects of the linguistic features, thereby investigating what properties are most relevant for readability.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Effects of Linguistic Features",
                "sec_num": "4.4"
            },
            {
                "text": "In this paper we explored the role of linguistic features in deep learning methods for readability assessment, and asked: can incorporating linguistic features improve state-of-the-art models? We constructed linguistic features focused on syntactic properties ignored by existing features. We incorporated these features into a variety of model types, both those commonly used in readability research and more modern deep learning methods. We evaluated these models on two distinct corpora that posed different challenges for readability assess-ment. Additional evaluations were performed with various training set sizes to explore the inductive bias provided by linguistic features. While linguistic features occasionally improved model performance, particularly at small training set sizes, these models did not achieve state-of-the-art performance.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "5"
            },
            {
                "text": "Given that linguistic features did not generally improve deep learning models, these models may be already implicitly capturing the features that are useful for readability assessment. Thus, future work should investigate to what degree the models represent linguistic features, perhaps via probing methods.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "5"
            },
            {
                "text": "Although this work supports disusing linguistic features in readability assessment, this assertion is limited by available corpora. Specifically, ambiguity in the corpora construction methodology limits our ability to measure label consistency and validity. Therefore, the maximal possible performance may already be achieved by state-of-the-art models. Thus, future work should explore constructing and evaluating readability corpora with rigorous consistent methodology; such corpora may be assessed most effectively using linguistic features. For instance, accuracy could be improved by averaging across multiple labelers.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "5"
            },
            {
                "text": "Overall, linguistic features do not appear to be useful for readability assessment. While often used in traditional readability assessment models, these features generally fail to improve the performance of deep learning methods. Thus, this paper provides a starting point to understanding the qualities and abilities of deep learning models in comparison to linguistic features. Through this comparison, we can analyze what types of information these models are well-suited to learning.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "5"
            },
            {
                "text": "For the following definitions, if the a ratio is undefined (i.e. the denominator is zero) the result is treated as zero. Vajjala and Meurers (2012) define complex nominals to be: \"a) nouns plus adjective, possessive, prepositional phrase, relative clause, participle or appositive, b) nominal clauses, c) gerunds and infinitives in subject positions.\" Here polysyllabic means more than two syllables and \"long words\" means a word with seven or more characters. Descriptions of the norms of age of acquisition ratings can be found in Kuperman et al. (2012) .",
                "cite_spans": [
                    {
                        "start": 121,
                        "end": 147,
                        "text": "Vajjala and Meurers (2012)",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 533,
                        "end": 555,
                        "text": "Kuperman et al. (2012)",
                        "ref_id": "BIBREF12"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "A Feature Definitions",
                "sec_num": null
            },
            {
                "text": "P D x (s) The parse deviation, P D x (s), of sentence s is the standard deviation of the distribution of the x most probable parse log probabilities for s. If s has less than x valid parses, the distribution is taken from all the valid parses. P DM x P DM x (s) is the difference between the largest parse log probability and the mean of the log probabilities of the x most probable parses for a sentence s. If s has less than x valid parses, the mean is taken over all the valid parses. P OSD dev P OSD dev (d) is the standard deviation of the distribution of POS counts for document d.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Feature Name Definition",
                "sec_num": null
            },
            {
                "text": "Let P (s) be the distribution of POS counts for sentence s in document d. Let Q be the distribution of POS counts for document d. Let |d| be the number of sentences in d. ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "P OS div",
                "sec_num": null
            },
            {
                "text": "P OS div (d) = s\u2208d D KL (P (s) Q) |d|",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "P OS div",
                "sec_num": null
            },
            {
                "text": "https://github.com/TovlyDeutsch/ Linguistic-Features-for-Readability",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "This code can be found at https://bitbucket. org/nishkalavallabhi/complexity-features.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "Defined byVajjala and Meurers (2012) to be \"one main clause plus any subordinate clause or non-clausal structure that is attached to or embedded in it\".",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "Weighted F1 ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Features",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF1": {
                "ref_id": "b1",
                "title": "The CELEX lexical database",
                "authors": [
                    {
                        "first": "Rolf",
                        "middle": [
                            "Harald"
                        ],
                        "last": "Baayen",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Piepenbrock",
                        "suffix": ""
                    },
                    {
                        "first": "Leon",
                        "middle": [],
                        "last": "Gulikers",
                        "suffix": ""
                    }
                ],
                "year": 1995,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rolf Harald Baayen, Richard Piepenbrock, and Leon Gulikers. 1995. The CELEX lexical database.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "Fran\u00e7ois Chollet and others",
                "authors": [],
                "year": 2015,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fran\u00e7ois Chollet and others. 2015. Keras.",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding",
                "authors": [
                    {
                        "first": "Jacob",
                        "middle": [],
                        "last": "Devlin",
                        "suffix": ""
                    },
                    {
                        "first": "Ming-Wei",
                        "middle": [],
                        "last": "Chang",
                        "suffix": ""
                    },
                    {
                        "first": "Kenton",
                        "middle": [],
                        "last": "Lee",
                        "suffix": ""
                    },
                    {
                        "first": "Kristina",
                        "middle": [],
                        "last": "Toutanova",
                        "suffix": ""
                    }
                ],
                "year": 2019,
                "venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
                "volume": "1",
                "issue": "",
                "pages": "4171--4186",
                "other_ids": {
                    "DOI": [
                        "10.18653/v1/N19-1423"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Un- derstanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Associ- ation for Computational Linguistics.",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "A new readability yardstick",
                "authors": [
                    {
                        "first": "Rudolph",
                        "middle": [],
                        "last": "Flesch",
                        "suffix": ""
                    }
                ],
                "year": 1948,
                "venue": "Journal of Applied Psychology",
                "volume": "32",
                "issue": "3",
                "pages": "221--233",
                "other_ids": {
                    "DOI": [
                        "10.1037/h0057532"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Rudolph Flesch. 1948. A new readability yardstick. Journal of Applied Psychology, 32(3):221-233.",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Lexical tightness and text complexity",
                "authors": [
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Flor",
                        "suffix": ""
                    },
                    {
                        "first": "Beata",
                        "middle": [
                            "Beigman"
                        ],
                        "last": "Klebanov",
                        "suffix": ""
                    },
                    {
                        "first": "Kathleen",
                        "middle": [
                            "M"
                        ],
                        "last": "Sheehan",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Proceedings of the Workshop on Natural Language Processing for Improving Textual Accessibility",
                "volume": "",
                "issue": "",
                "pages": "29--38",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Michael Flor, Beata Beigman Klebanov, and Kath- leen M. Sheehan. 2013. Lexical tightness and text complexity. In Proceedings of the Workshop on Nat- ural Language Processing for Improving Textual Ac- cessibility, pages 29-38, Atlanta, Georgia. Associa- tion for Computational Linguistics.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "A practical guide to support vector classification",
                "authors": [
                    {
                        "first": "Chih-Wei",
                        "middle": [],
                        "last": "Hsu",
                        "suffix": ""
                    },
                    {
                        "first": "Chih-Chung",
                        "middle": [],
                        "last": "Chang",
                        "suffix": ""
                    },
                    {
                        "first": "Chih-Jen",
                        "middle": [],
                        "last": "Lin",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Chih-wei Hsu, Chih-chung Chang, and Chih-Jen Lin. 2003. A practical guide to support vector classifica- tion. Technical report.",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "Convolutional Neural Networks for Sentence Classification",
                "authors": [
                    {
                        "first": "Yoon",
                        "middle": [],
                        "last": "Kim",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
                "volume": "",
                "issue": "",
                "pages": "1746--1751",
                "other_ids": {
                    "DOI": [
                        "10.3115/v1/D14-1181"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Yoon Kim. 2014. Convolutional Neural Networks for Sentence Classification. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1746-1751, Doha, Qatar. Association for Computational Lin- guistics.",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "Derivation of New Readability Formulas (Automated Readability Index, Fog Count and Flesch Reading Ease Formula) for Navy Enlisted Personnel",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "P"
                        ],
                        "last": "Kincaid",
                        "suffix": ""
                    },
                    {
                        "first": "Rogers",
                        "middle": [],
                        "last": "Fishburne",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Robert",
                        "suffix": ""
                    },
                    {
                        "first": "Chissom",
                        "middle": [],
                        "last": "Richard",
                        "suffix": ""
                    },
                    {
                        "first": "L",
                        "middle": [],
                        "last": "",
                        "suffix": ""
                    },
                    {
                        "first": "Brad",
                        "middle": [
                            "S"
                        ],
                        "last": "",
                        "suffix": ""
                    }
                ],
                "year": 1975,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "DOI": [
                        "10.21236/ADA006655"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "J. P. Kincaid, Jr. Fishburne, Rogers Robert P., Chissom Richard L., and Brad S. 1975. Derivation of New Readability Formulas (Automated Readability In- dex, Fog Count and Flesch Reading Ease Formula) for Navy Enlisted Personnel:. Technical report, De- fense Technical Information Center, Fort Belvoir, VA.",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "Adam: A method for stochastic optimization",
                "authors": [
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Diederik",
                        "suffix": ""
                    },
                    {
                        "first": "Jimmy",
                        "middle": [],
                        "last": "Kingma",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Ba",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "3rd International Conference on Learning Representations",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In 3rd Inter- national Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings.",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "title": "Accurate unlexicalized parsing",
                "authors": [
                    {
                        "first": "Dan",
                        "middle": [],
                        "last": "Klein",
                        "suffix": ""
                    },
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Christopher",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Manning",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of the 41st Annual Meeting on Association for Computational Linguistics -ACL '03",
                "volume": "1",
                "issue": "",
                "pages": "423--430",
                "other_ids": {
                    "DOI": [
                        "10.3115/1075096.1075150"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Dan Klein and Christopher D. Manning. 2003. Accu- rate unlexicalized parsing. In Proceedings of the 41st Annual Meeting on Association for Computa- tional Linguistics -ACL '03, volume 1, pages 423- 430, Sapporo, Japan. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "On Information and Sufficiency",
                "authors": [
                    {
                        "first": "Solomon",
                        "middle": [],
                        "last": "Kullback",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [
                            "A"
                        ],
                        "last": "Leibler",
                        "suffix": ""
                    }
                ],
                "year": 1951,
                "venue": "The Annals of Mathematical Statistics",
                "volume": "22",
                "issue": "1",
                "pages": "79--86",
                "other_ids": {
                    "DOI": [
                        "10.1214/aoms/1177729694"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Solomon Kullback and Richard A. Leibler. 1951. On Information and Sufficiency. The Annals of Mathe- matical Statistics, 22(1):79-86.",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "Age-of-acquisition ratings for 30,000 English words",
                "authors": [
                    {
                        "first": "Victor",
                        "middle": [],
                        "last": "Kuperman",
                        "suffix": ""
                    },
                    {
                        "first": "Hans",
                        "middle": [],
                        "last": "Stadthagen-Gonzalez",
                        "suffix": ""
                    },
                    {
                        "first": "Marc",
                        "middle": [],
                        "last": "Brysbaert",
                        "suffix": ""
                    }
                ],
                "year": 2012,
                "venue": "",
                "volume": "44",
                "issue": "",
                "pages": "978--990",
                "other_ids": {
                    "DOI": [
                        "10.3758/s13428-012-0210-4"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Victor Kuperman, Hans Stadthagen-Gonzalez, and Marc Brysbaert. 2012. Age-of-acquisition ratings for 30,000 English words. Behavior Research Meth- ods, 44(4):978-990.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Automatic analysis of syntactic complexity in second language writing",
                "authors": [
                    {
                        "first": "Xiaofei",
                        "middle": [],
                        "last": "Lu",
                        "suffix": ""
                    }
                ],
                "year": 2010,
                "venue": "International Journal of Corpus Linguistics",
                "volume": "15",
                "issue": "4",
                "pages": "474--496",
                "other_ids": {
                    "DOI": [
                        "10.1075/ijcl.15.4.02lu"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Xiaofei Lu. 2010. Automatic analysis of syntactic com- plexity in second language writing. International Journal of Corpus Linguistics, 15(4):474-496.",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Supervised and unsupervised neural approaches to text readability",
                "authors": [
                    {
                        "first": "Matej",
                        "middle": [],
                        "last": "Martinc",
                        "suffix": ""
                    },
                    {
                        "first": "Senja",
                        "middle": [],
                        "last": "Pollak",
                        "suffix": ""
                    },
                    {
                        "first": "Marko",
                        "middle": [],
                        "last": "Robnik-Sikonja",
                        "suffix": ""
                    }
                ],
                "year": 2019,
                "venue": "Computing Research Repository",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "DOI": [
                        "10.18653/v1/N16-1174"
                    ],
                    "arXiv": [
                        "arXiv:1503.06733"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Matej Martinc, Senja Pollak, and Marko Robnik- Sikonja. 2019. Supervised and unsupervised neural approaches to text readability. Computing Research Repository, arXiv:1503.06733. Version 2.",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Hierarchical Attention Networks for Document Classification",
                "authors": [
                    {
                        "first": "Viet",
                        "middle": [],
                        "last": "Nguyen",
                        "suffix": ""
                    }
                ],
                "year": 2020,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Viet Nguyen. 2020. Hierarchical Attention Networks for Document Classification. Original-date: 2019- 01-31T18:56:40Z.",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "Scikit-learn: Machine Learning in Python",
                "authors": [
                    {
                        "first": "Fabian",
                        "middle": [],
                        "last": "Pedregosa",
                        "suffix": ""
                    },
                    {
                        "first": "Ga\u00ebl",
                        "middle": [],
                        "last": "Varoquaux",
                        "suffix": ""
                    },
                    {
                        "first": "Alexandre",
                        "middle": [],
                        "last": "Gramfort",
                        "suffix": ""
                    },
                    {
                        "first": "Vincent",
                        "middle": [],
                        "last": "Michel",
                        "suffix": ""
                    },
                    {
                        "first": "Bertrand",
                        "middle": [],
                        "last": "Thirion",
                        "suffix": ""
                    },
                    {
                        "first": "Olivier",
                        "middle": [],
                        "last": "Grisel",
                        "suffix": ""
                    },
                    {
                        "first": "Mathieu",
                        "middle": [],
                        "last": "Blondel",
                        "suffix": ""
                    },
                    {
                        "first": "Peter",
                        "middle": [],
                        "last": "Prettenhofer",
                        "suffix": ""
                    },
                    {
                        "first": "Ron",
                        "middle": [],
                        "last": "Weiss",
                        "suffix": ""
                    },
                    {
                        "first": "Vincent",
                        "middle": [],
                        "last": "Dubourg",
                        "suffix": ""
                    },
                    {
                        "first": "Jake",
                        "middle": [],
                        "last": "Vanderplas",
                        "suffix": ""
                    },
                    {
                        "first": "Alexandre",
                        "middle": [],
                        "last": "Passos",
                        "suffix": ""
                    },
                    {
                        "first": "David",
                        "middle": [],
                        "last": "Cournapeau",
                        "suffix": ""
                    },
                    {
                        "first": "Matthieu",
                        "middle": [],
                        "last": "Brucher",
                        "suffix": ""
                    },
                    {
                        "first": "Matthieu",
                        "middle": [],
                        "last": "Perrot",
                        "suffix": ""
                    },
                    {
                        "first": "Duchesnay",
                        "middle": [],
                        "last": "And\u00e9douard",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "Journal of Machine Learning Research",
                "volume": "12",
                "issue": "",
                "pages": "2825--2830",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fabian Pedregosa, Ga\u00ebl Varoquaux, Alexandre Gram- fort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexan- dre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, and\u00c9douard Duchesnay. 2011. Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research, 12:2825-2830.",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "Reading Level Assessment Using Support Vector Machines and Statistical Language Models",
                "authors": [
                    {
                        "first": "Sarah",
                        "middle": [
                            "E"
                        ],
                        "last": "Schwarm",
                        "suffix": ""
                    },
                    {
                        "first": "Mari",
                        "middle": [],
                        "last": "Ostendorf",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, ACL '05",
                "volume": "",
                "issue": "",
                "pages": "523--530",
                "other_ids": {
                    "DOI": [
                        "10.3115/1219840.1219905"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Sarah E. Schwarm and Mari Ostendorf. 2005. Reading Level Assessment Using Support Vector Machines and Statistical Language Models. In Proceedings of the 43rd Annual Meeting on Association for Com- putational Linguistics, ACL '05, pages 523-530, Stroudsburg, PA, USA. Association for Computa- tional Linguistics. Event-place: Ann Arbor, Michi- gan.",
                "links": null
            },
            "BIBREF18": {
                "ref_id": "b18",
                "title": "On Improving the Accuracy of Readability Classification using Insights from Second Language Acquisition",
                "authors": [
                    {
                        "first": "Sowmya",
                        "middle": [],
                        "last": "Vajjala",
                        "suffix": ""
                    },
                    {
                        "first": "Detmar",
                        "middle": [],
                        "last": "Meurers",
                        "suffix": ""
                    }
                ],
                "year": 2012,
                "venue": "Proceedings of the Seventh Workshop on Building Educational Applications Using NLP",
                "volume": "",
                "issue": "",
                "pages": "163--173",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Sowmya Vajjala and Detmar Meurers. 2012. On Im- proving the Accuracy of Readability Classification using Insights from Second Language Acquisition. In Proceedings of the Seventh Workshop on Building Educational Applications Using NLP, pages 163- 173, Montr\u00e9al, Canada. Association for Computa- tional Linguistics.",
                "links": null
            },
            "BIBREF19": {
                "ref_id": "b19",
                "title": "Analyzing Text Complexity and Text Simplification: Connecting Linguistics, Processing and Educational Applications. Dissertation",
                "authors": [
                    {
                        "first": "",
                        "middle": [],
                        "last": "Sowmya Vajjala Balakrishna",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "DOI": [
                        "10.15496/publikation-5781"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Sowmya Vajjala Balakrishna. 2015. Analyzing Text Complexity and Text Simplification: Connecting Lin- guistics, Processing and Educational Applications. Dissertation, Universit\u00e4t T\u00fcbingen.",
                "links": null
            },
            "BIBREF20": {
                "ref_id": "b20",
                "title": "Attention is all you need",
                "authors": [
                    {
                        "first": "Ashish",
                        "middle": [],
                        "last": "Vaswani",
                        "suffix": ""
                    },
                    {
                        "first": "Noam",
                        "middle": [],
                        "last": "Shazeer",
                        "suffix": ""
                    },
                    {
                        "first": "Niki",
                        "middle": [],
                        "last": "Parmar",
                        "suffix": ""
                    },
                    {
                        "first": "Jakob",
                        "middle": [],
                        "last": "Uszkoreit",
                        "suffix": ""
                    },
                    {
                        "first": "Llion",
                        "middle": [],
                        "last": "Jones",
                        "suffix": ""
                    },
                    {
                        "first": "Aidan",
                        "middle": [
                            "N"
                        ],
                        "last": "Gomez",
                        "suffix": ""
                    },
                    {
                        "first": "\u0141ukasz",
                        "middle": [],
                        "last": "Kaiser",
                        "suffix": ""
                    },
                    {
                        "first": "Illia",
                        "middle": [],
                        "last": "Polosukhin",
                        "suffix": ""
                    }
                ],
                "year": 2017,
                "venue": "Advances in neural information processing systems 30",
                "volume": "",
                "issue": "",
                "pages": "5998--6008",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information pro- cessing systems 30, pages 5998-6008. Curran Asso- ciates, Inc.",
                "links": null
            },
            "BIBREF21": {
                "ref_id": "b21",
                "title": "MRC psycholinguistic database: Machine-usable dictionary, version 2.00. Behavior Research Methods, Instruments, & Computers",
                "authors": [
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Wilson",
                        "suffix": ""
                    }
                ],
                "year": 1988,
                "venue": "",
                "volume": "20",
                "issue": "",
                "pages": "6--10",
                "other_ids": {
                    "DOI": [
                        "10.3758/BF03202594"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Michael Wilson. 1988. MRC psycholinguistic database: Machine-usable dictionary, version 2.00. Behavior Research Methods, Instruments, & Com- puters, 20(1):6-10.",
                "links": null
            },
            "BIBREF22": {
                "ref_id": "b22",
                "title": "HuggingFace's transformers: state-of-the-art natural language processing",
                "authors": [
                    {
                        "first": "Thomas",
                        "middle": [],
                        "last": "Wolf",
                        "suffix": ""
                    },
                    {
                        "first": "Lysandre",
                        "middle": [],
                        "last": "Debut",
                        "suffix": ""
                    },
                    {
                        "first": "Victor",
                        "middle": [],
                        "last": "Sanh",
                        "suffix": ""
                    },
                    {
                        "first": "Julien",
                        "middle": [],
                        "last": "Chaumond",
                        "suffix": ""
                    },
                    {
                        "first": "Clement",
                        "middle": [],
                        "last": "Delangue",
                        "suffix": ""
                    },
                    {
                        "first": "Anthony",
                        "middle": [],
                        "last": "Moi",
                        "suffix": ""
                    },
                    {
                        "first": "Pierric",
                        "middle": [],
                        "last": "Cistac",
                        "suffix": ""
                    },
                    {
                        "first": "Tim",
                        "middle": [],
                        "last": "Rault",
                        "suffix": ""
                    },
                    {
                        "first": "R'emi",
                        "middle": [],
                        "last": "Louf",
                        "suffix": ""
                    },
                    {
                        "first": "Morgan",
                        "middle": [],
                        "last": "Funtowicz",
                        "suffix": ""
                    },
                    {
                        "first": "Jamie",
                        "middle": [],
                        "last": "Brew",
                        "suffix": ""
                    }
                ],
                "year": 2019,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pier- ric Cistac, Tim Rault, R'emi Louf, Morgan Funtow- icz, and Jamie Brew. 2019. HuggingFace's trans- formers: state-of-the-art natural language process- ing. Technical report.",
                "links": null
            },
            "BIBREF23": {
                "ref_id": "b23",
                "title": "Text Readability Assessment for Second Language Learners",
                "authors": [
                    {
                        "first": "Menglin",
                        "middle": [],
                        "last": "Xia",
                        "suffix": ""
                    },
                    {
                        "first": "Ekaterina",
                        "middle": [],
                        "last": "Kochmar",
                        "suffix": ""
                    },
                    {
                        "first": "Ted",
                        "middle": [],
                        "last": "Briscoe",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the 11th Workshop on Innovative Use of NLP for Building Educational Applications",
                "volume": "",
                "issue": "",
                "pages": "12--22",
                "other_ids": {
                    "DOI": [
                        "10.18653/v1/W16-0502"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Menglin Xia, Ekaterina Kochmar, and Ted Briscoe. 2016. Text Readability Assessment for Second Lan- guage Learners. In Proceedings of the 11th Work- shop on Innovative Use of NLP for Building Edu- cational Applications, pages 12-22, San Diego, CA. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF24": {
                "ref_id": "b24",
                "title": "Hierarchical Attention Networks for Document Classification",
                "authors": [
                    {
                        "first": "Zichao",
                        "middle": [],
                        "last": "Yang",
                        "suffix": ""
                    },
                    {
                        "first": "Diyi",
                        "middle": [],
                        "last": "Yang",
                        "suffix": ""
                    },
                    {
                        "first": "Chris",
                        "middle": [],
                        "last": "Dyer",
                        "suffix": ""
                    },
                    {
                        "first": "Xiaodong",
                        "middle": [],
                        "last": "He",
                        "suffix": ""
                    },
                    {
                        "first": "Alex",
                        "middle": [],
                        "last": "Smola",
                        "suffix": ""
                    },
                    {
                        "first": "Eduard",
                        "middle": [],
                        "last": "Hovy",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
                "volume": "",
                "issue": "",
                "pages": "1480--1489",
                "other_ids": {
                    "DOI": [
                        "10.18653/v1/N16-1174"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Zichao Yang, Diyi Yang, Chris Dyer, Xiaodong He, Alex Smola, and Eduard Hovy. 2016. Hierarchical Attention Networks for Document Classification. In Proceedings of the 2016 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, pages 1480-1489, San Diego, California. Associa- tion for Computational Linguistics.",
                "links": null
            },
            "BIBREF25": {
                "ref_id": "b25",
                "title": "Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Books. Computing Research Repository",
                "authors": [
                    {
                        "first": "Yukun",
                        "middle": [],
                        "last": "Zhu",
                        "suffix": ""
                    },
                    {
                        "first": "Ryan",
                        "middle": [],
                        "last": "Kiros",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Zemel",
                        "suffix": ""
                    },
                    {
                        "first": "Ruslan",
                        "middle": [],
                        "last": "Salakhutdinov",
                        "suffix": ""
                    },
                    {
                        "first": "Raquel",
                        "middle": [],
                        "last": "Urtasun",
                        "suffix": ""
                    },
                    {
                        "first": "Antonio",
                        "middle": [],
                        "last": "Torralba",
                        "suffix": ""
                    },
                    {
                        "first": "Sanja",
                        "middle": [],
                        "last": "Fidler",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "arXiv": [
                        "arXiv:1506.06724"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Yukun Zhu, Ryan Kiros, Richard Zemel, Ruslan Salakhutdinov, Raquel Urtasun, Antonio Torralba, and Sanja Fidler. 2015. Aligning Books and Movies: Towards Story-like Visual Explanations by Watch- ing Movies and Reading Books. Computing Re- search Repository, arXiv:1506.06724.",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "uris": null,
                "type_str": "figure",
                "num": null,
                "text": "Performance differences across different training set sizes on the downsampled WeeBit corpus"
            },
            "TABREF1": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>: Top 10 performing model results, transformer,</td></tr><tr><td>and CNN on the Newsela corpus</td></tr><tr><td>bined in a mean without any weighting. Therefore,</td></tr><tr><td>the macro F1 score treats each class equally but</td></tr><tr><td>does not treat each sample equally, deprioritizing</td></tr><tr><td>samples from large classes and prioritizing samples</td></tr><tr><td>from small classes.</td></tr></table>",
                "text": "",
                "type_str": "table"
            },
            "TABREF3": {
                "html": null,
                "num": null,
                "content": "<table/>",
                "text": "Top 10 performing model results, CNN, and HAN on the downsampled WeeBit corpus",
                "type_str": "table"
            },
            "TABREF5": {
                "html": null,
                "num": null,
                "content": "<table/>",
                "text": "Top 5 performing model results on the WeeBit corpus",
                "type_str": "table"
            },
            "TABREF6": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>Feature Name</td><td>Definition</td></tr><tr><td>mean t-unit lenght</td><td>number of words / number of t-units</td></tr><tr><td colspan=\"2\">mean parse tree height per sentence mean parse tree height / number of sentences</td></tr><tr><td>subtrees per sentence</td><td>number of subtrees / number of sentences</td></tr><tr><td>SBARs per sentence</td><td>number of SBARs / number of sentences</td></tr><tr><td>NPs per sentence</td><td>number of NPs / number of sentences</td></tr><tr><td>VPs per sentence</td><td>number of VPs / number of sentences</td></tr><tr><td>PPs per sentence</td><td>number of PPs / number of sentences</td></tr><tr><td>mean NP size</td><td>number of children of NPs / number of NPs</td></tr><tr><td>mean VP size</td><td>number of children of VPs / number of VPs</td></tr><tr><td>mean PP size</td><td>number of children of PPs / number of PPs</td></tr><tr><td>WHPs per sentence</td><td>number of wh-phrases / number of sentences</td></tr><tr><td>RRCs per sentence</td><td>number of reduced relative clauses / number of sentences</td></tr><tr><td>ConjPs per sentence</td><td>number of conjunction phrases / number of sentences</td></tr><tr><td>clauses per sentence</td><td>number of clauses / number of sentences</td></tr><tr><td>t-units per sentence</td><td>number of t-units / number of sentences</td></tr><tr><td>clauses per t-unit</td><td>number of clauses / number of t-units</td></tr><tr><td>complex t-unit ratio</td><td>number of t-units that contain a dependent clause / number of t-units</td></tr><tr><td>dependent clauses per clause</td><td>number of dependent clauses / number of clauses</td></tr><tr><td>dependent clauses per t-unit</td><td>number of dependent clauses / number of t-units</td></tr><tr><td>coordinate clauses per clause</td><td>number of coordinate clauses / number of clauses</td></tr><tr><td>coordinate clauses per t-unit</td><td>number of coordinate clauses / number of t-units</td></tr><tr><td>complex nominals per clauses</td><td>number of complex nominals / number of clauses</td></tr><tr><td>complex nominals per t-unit</td><td>number of complex nominals / number of t-units</td></tr><tr><td>VPs per t-unit</td><td>number of VP / number of t-units</td></tr><tr><td/><td>12</td></tr></table>",
                "text": "Novel syntactic feature definitions",
                "type_str": "table"
            },
            "TABREF7": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>13</td></tr></table>",
                "text": "Existing syntactic-parse-based feature definitions",
                "type_str": "table"
            },
            "TABREF8": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>Feature Name</td><td>Definition</td></tr><tr><td>AoA Kuperman</td><td>Mean age of acquisition of words (Kuperman database)</td></tr><tr><td>AoA Kuperman lemmas</td><td>Mean age of acquisition of lemmas</td></tr><tr><td>AoA Bird lemmas</td><td>Mean age of acquisition of lemmas, Bird norm</td></tr><tr><td>AoA Bristol lemmas</td><td>Mean age of acquisition of lemmas, Bristol norm</td></tr><tr><td colspan=\"2\">AoA Cortese and Khanna lemmas Mean age of acquisition of lemmas, Cortese and Khanna norm</td></tr><tr><td>MRC familiarity</td><td>Mean word familiarity rating</td></tr><tr><td>MRC concreteness</td><td>Mean word concreteness rating</td></tr><tr><td>MRC Imageability</td><td>Mean word imageability rating</td></tr><tr><td>MRC Colorado Meaningfulness</td><td>mean word Colorado norms meaningfulness rating</td></tr><tr><td>MRC Pavio Meaningfulness</td><td>mean word Pavio norms meaningfulness rating</td></tr><tr><td>MRC AoA</td><td>Mean age of acquisition of words (MRC database)</td></tr></table>",
                "text": "Existing POS-tag-based feature definitions",
                "type_str": "table"
            },
            "TABREF9": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>14</td></tr></table>",
                "text": "Existing psycholinguistic feature definitions * syllables per word + 0.39 * words per sentence \u2212 15.59 Flesch Fomula 206.835 \u2212 1.015 * words per sentence \u2212 84.6 * syllables per word Automated Readability Index 4.71 * characters per word + 0.5 * words per sentence \u2212 21.43",
                "type_str": "table"
            },
            "TABREF10": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>Feature Name</td><td>Definition</td></tr><tr><td>type token ratio corrected type token ratio root type token ratio</td><td>number of word types / number of word tokens number of word types / \u221a 2  *  number of word tokens number of word types / \u221a number of word tokens</td></tr><tr><td>bilogorathmic type token ratio</td><td>log(number of word types)/log(number of word tokens)</td></tr><tr><td>uber index</td><td>(log(number of word types)) 2 /log( number of word tokens number of word types )</td></tr><tr><td colspan=\"2\">measure of textual lexical diversity (MTLD) see McCarthy and Jarvis, 2010</td></tr><tr><td>number of senses</td><td>total number of senses across all words / number of word tokens</td></tr><tr><td>hyeprnyms per word</td><td>number of hypernyms / number of word tokens</td></tr><tr><td>hyponyms per word</td><td>total number of senses hyponyms / number of word tokens</td></tr></table>",
                "text": "Existing traditional feature definitions",
                "type_str": "table"
            },
            "TABREF11": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>15</td></tr></table>",
                "text": "Existing traditional feature definitions",
                "type_str": "table"
            },
            "TABREF12": {
                "html": null,
                "num": null,
                "content": "<table><tr><td>Features</td><td>Weighted</td><td colspan=\"2\">Macro F1 SD</td><td>SD</td></tr><tr><td/><td>F1</td><td/><td>weighted</td><td>Macro F1</td></tr><tr><td/><td/><td/><td>F1</td><td/></tr><tr><td>Linear classifier with Flesch Score</td><td>0.3357</td><td>0.1816</td><td>0.0243</td><td>0.0079</td></tr><tr><td>SVM with HAN</td><td>0.3625</td><td>0.2134</td><td>0.0400</td><td>0.0331</td></tr><tr><td>Linear classifier with Flesch features</td><td>0.3939</td><td>0.2639</td><td>0.0239</td><td>0.0305</td></tr><tr><td>SVM with Flesch features</td><td>0.4776</td><td>0.3609</td><td>0.0222</td><td>0.0190</td></tr><tr><td>SVM with CNN age regression</td><td>0.7279</td><td>0.6431</td><td>0.0198</td><td>0.0205</td></tr><tr><td>SVM with CNN ordered class regression</td><td>0.7316</td><td>0.6482</td><td>0.0142</td><td>0.0141</td></tr><tr><td>SVM with CNN age regression and linguistic</td><td>0.7779</td><td>0.7088</td><td>0.0156</td><td>0.0194</td></tr><tr><td>features</td><td/><td/><td/><td/></tr><tr><td>SVM with CNN ordered classes regression,</td><td>0.7797</td><td>0.7114</td><td>0.0130</td><td>0.0120</td></tr><tr><td>and linguistic features</td><td/><td/><td/><td/></tr><tr><td>Linear classifier with word types</td><td>0.7821</td><td>0.7109</td><td>0.0162</td><td>0.0127</td></tr><tr><td>SVM with Linguistic features and Flesch fea-</td><td>0.7952</td><td>0.7367</td><td>0.0121</td><td>0.0157</td></tr><tr><td>tures</td><td/><td/><td/><td/></tr><tr><td>SVM with Linguistic features</td><td>0.7952</td><td>0.7366</td><td>0.0130</td><td>0.0164</td></tr><tr><td>HAN</td><td>0.8065</td><td>0.7435</td><td>0.0123</td><td>0.0220</td></tr><tr><td>Logistic regression classification with word</td><td>0.8088</td><td>0.7497</td><td>0.0127</td><td>0.0152</td></tr><tr><td>types</td><td/><td/><td/><td/></tr><tr><td>Logistic regression classification with word</td><td>0.8088</td><td>0.7497</td><td>0.0121</td><td>0.0148</td></tr><tr><td>types and word count</td><td/><td/><td/><td/></tr><tr><td>Logistic regression classification with word</td><td>0.8098</td><td>0.7505</td><td>0.0130</td><td>0.0163</td></tr><tr><td>types, word count, and Flesch features</td><td/><td/><td/><td/></tr><tr><td>Logistic regression classification with word</td><td>0.8206</td><td>0.7664</td><td>0.0428</td><td>0.0500</td></tr><tr><td>types, Flesch features, and linguistic features</td><td/><td/><td/><td/></tr><tr><td>CNN</td><td>0.8282</td><td>0.7748</td><td>0.0211</td><td>0.0183</td></tr><tr><td>SVM with CNN classifier and linguistic fea-</td><td>0.8286</td><td>0.7753</td><td>0.0222</td><td>0.0209</td></tr><tr><td>tures</td><td/><td/><td/><td/></tr><tr><td>Logistic regression classification with word</td><td>0.8293</td><td>0.7760</td><td>0.0152</td><td>0.0172</td></tr><tr><td>types, Flesch features, and ling features</td><td/><td/><td/><td/></tr><tr><td>SVM with CNN classifier</td><td>0.8296</td><td>0.7754</td><td>0.0163</td><td>0.0136</td></tr><tr><td>SVM with HAN and linguistic features</td><td>0.8441</td><td>0.7970</td><td>0.0643</td><td>0.0827</td></tr><tr><td>SVM with transformer, Flesch features, and</td><td>0.8721</td><td>0.8273</td><td>0.0095</td><td>0.0121</td></tr><tr><td>linguistic features</td><td/><td/><td/><td/></tr><tr><td>Transformer</td><td>0.8721</td><td>0.8272</td><td>0.0071</td><td>0.0102</td></tr><tr><td>SVM with transformer</td><td>0.8729</td><td>0.8288</td><td>0.0064</td><td>0.0090</td></tr><tr><td>SVM with transformer and Flesch features</td><td>0.8746</td><td>0.8305</td><td>0.0054</td><td>0.0107</td></tr><tr><td colspan=\"2\">SVM with transformer and linguistic features 0.8769</td><td>0.8343</td><td>0.0077</td><td>0.0129</td></tr></table>",
                "text": "WeeBit downsampled model results sorted by weighted F1 score 16",
                "type_str": "table"
            },
            "TABREF13": {
                "html": null,
                "num": null,
                "content": "<table/>",
                "text": "WeeBit model results sorted by weighted F1 score",
                "type_str": "table"
            }
        }
    }
}