ACL-OCL / Base_JSON /prefixC /json /codi /2021.codi-main.12.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:27:42.530443Z"
},
"title": "discopy: A Neural System for Shallow Discourse Parsing",
"authors": [
{
"first": "Ren\u00e9",
"middle": [],
"last": "Knaebel",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Potsdam",
"location": {}
},
"email": "[email protected]"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper demonstrates discopy, a novel framework that makes it easy to design components for end-to-end shallow discourse parsing. For the purpose of demonstration, we implement recent neural approaches and integrate contextualized word embeddings to predict explicit and non-explicit discourse relations. Our proposed neural feature-free system performs competitively to systems presented at the latest Shared Task on Shallow Discourse Parsing. Finally, a web front end is shown that simplifies the inspection of annotated documents. The source code, documentation, and pretrained models are publicly accessible.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper demonstrates discopy, a novel framework that makes it easy to design components for end-to-end shallow discourse parsing. For the purpose of demonstration, we implement recent neural approaches and integrate contextualized word embeddings to predict explicit and non-explicit discourse relations. Our proposed neural feature-free system performs competitively to systems presented at the latest Shared Task on Shallow Discourse Parsing. Finally, a web front end is shown that simplifies the inspection of annotated documents. The source code, documentation, and pretrained models are publicly accessible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Whenever people compose text, they (consciously or not) make sure that related sentences are cohesive and coherent within a common section. By using models to analyze discourse, we identify relations within a text that consist of phrases and a certain sense. These discourse relations and their understanding are important for other tasks in the NLP community such as abstractive summarization (Gerani et al., 2014 ), text simplification (Zhong et al., 2020) , and argumentation mining (Hewett et al., 2019) . The Penn Discourse Treebank (PDTB) (Prasad et al., 2008) , for example, describes discourse as a set of individual relations. The following two (artificial) examples demonstrate the main types of relations annotated in their corpus:",
"cite_spans": [
{
"start": 394,
"end": 414,
"text": "(Gerani et al., 2014",
"ref_id": "BIBREF1"
},
{
"start": 438,
"end": 458,
"text": "(Zhong et al., 2020)",
"ref_id": "BIBREF20"
},
{
"start": 486,
"end": 507,
"text": "(Hewett et al., 2019)",
"ref_id": "BIBREF2"
},
{
"start": 545,
"end": 566,
"text": "(Prasad et al., 2008)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. While it is raining outside, I clean the dishes. Relations consist of two arguments (Arg1 in italics and Arg2 in bold) and a sense (e.g. Tempo-ral.Synchronous 1 ) is assigned. The first example is called an explicit relation, because the relation is signaled by a phrase called connective (Conn is underlined). The second example refers to the group of implicit relations because of the absence of a connective that signals the relation. Additionally, if adjacent sentences have an entity-based relation, they are marked as EntRel.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The area of shallow discourse parsing (SDP) aims to build models finding aforementioned discourse structures. Started through the development of PDTB, shallow discourse parsing gained more awareness by two shared Tasks (Xue et al., 2015 (Xue et al., , 2016 . Successful systems at the last competition were those of Wang and Lan (2016) ; Qin et al. (2016) ; Schenk et al. (2016) ; Oepen et al. (2016) ; .",
"cite_spans": [
{
"start": 219,
"end": 236,
"text": "(Xue et al., 2015",
"ref_id": "BIBREF18"
},
{
"start": 237,
"end": 256,
"text": "(Xue et al., , 2016",
"ref_id": "BIBREF19"
},
{
"start": 316,
"end": 335,
"text": "Wang and Lan (2016)",
"ref_id": "BIBREF16"
},
{
"start": 338,
"end": 355,
"text": "Qin et al. (2016)",
"ref_id": "BIBREF11"
},
{
"start": 358,
"end": 378,
"text": "Schenk et al. (2016)",
"ref_id": "BIBREF14"
},
{
"start": 381,
"end": 400,
"text": "Oepen et al. (2016)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This work introduces an end-to-end neural system that implements recently researched components for these tasks. Our goal is to design components that all rely on the same contextualized word embeddings as input and, thus, it avoids the necessity to train huge neural networks. We compare our results with state-of-the-art shallow discourse parsers that took part at the CoNLL Shared Task in 2016 (Xue et al., 2016) which is to our knowledge the last time full systems were published. The contributions of this paper are as follows:",
"cite_spans": [
{
"start": 397,
"end": 415,
"text": "(Xue et al., 2016)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. We introduce a simple modular and easily extendable framework for shallow discourse parsing. We also provide pretrained systems by recent advances in word representations that demonstrate competitive performance compared to existing systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. We provide a first version of a web front end to visualize parser outputs and, optionally, to connect a parser via REST API.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In our framework discopy, we design a clean and modular parser pipeline principle. Each component has to implement a specified interface that assumes to process a well defined document structure. Starting with a document without annotated discourse relations, each component further adds its predictions while the document is passed through the pipeline, for example one component identifies connectives and their sense and, based on this prediction, another component extracts arguments around these connectives to complete the explicit relations. This parser architecture makes the definition of a custom pipeline easy and components remain interchangeable. Together with the framework, we provide multiple components for an endto-end neural shallow discourse parser. The simple pipeline interface (exemplified in Listing 2) with methods such as fit, parse, and eval, ensures pleasant user experience. The system combines recent research on various subtasks with advances in contextualized word embeddings. We make the framework and pre-trained components available under https://github.com/rknaebel/discopy. In the following, we briefly summarize the components implemented in our system. Contextualized Word Embeddings. We start by generating contextualized embeddings for each document. These embeddings come from a chosen BERT architecture that is provided by the Hugging Face transformers library (Wolf et al., 2020) . Pre-tokenized sentences are processed again by a specific BERT tokenizer which results in a possibly higher number of sub-tokens as the input sequence. For each input token, we select and concatenate the last four hidden layers that correspond to the first sub-token, following the principle demonstrated by Devlin et al. (2019) that performed best using the BERT architecture as a feature extractor. Each component in our discourse parser uses the same input embeddings. This has the advantage, to only produce the computation-intense embeddings once in the beginning. Connective Sense Classifier. The first component in the pipeline refers to the problem of connective disambiguation and explicit sense classification. This component is based on the work of Knaebel and Stede (2020) of which we use the jointly trained model to keep the number of components as small as possible. The component first extracts connective candidates based on a pattern-matching approach. Then, these candidates are classified as having a sentential meaning or a connective meaning which is indicated by a predicted sense class. The idea of using the same features for both tasks originates from Pitler and Nenkova (2009) . Explicit Connective Argument Extractor. The component that is responsible to extract explicit arguments creates a window surrounding the previously predicted connective and searches for corresponding arguments (Arg1 and Arg2) within this span. We extend the connective argument extractor of Knaebel et al. (2019) and replace GloVe embeddings (Pennington et al., 2014) by our contextualized embeddings. Implicit Sense Classifier. Implicit relations are annotated on adjacent sentences within the same paragraph that do not contain any other explicit relation. For the implicit sense classifier, we choose a simple approach and collect all implicit candidate sentence pairs. We follow previous work by Rutherford et al. (2017) which has been recently chosen as a baseline in work by Liang et al. (2020) . There, embeddings for both arguments are collected and processed by a recurrent neural network. Then, both intermediate representations are combined using a maximum pooling layer and given to a fully connected layer to predict the implicit sense. We adopt this approach by using our contextualized embeddings, and we add a labels for entity-based relations (EntRel) as well as a for the absence of any relation (NoRel) to the final set of predictions.",
"cite_spans": [
{
"start": 1404,
"end": 1423,
"text": "(Wolf et al., 2020)",
"ref_id": "BIBREF17"
},
{
"start": 1734,
"end": 1754,
"text": "Devlin et al. (2019)",
"ref_id": "BIBREF0"
},
{
"start": 2604,
"end": 2629,
"text": "Pitler and Nenkova (2009)",
"ref_id": "BIBREF9"
},
{
"start": 2923,
"end": 2944,
"text": "Knaebel et al. (2019)",
"ref_id": "BIBREF4"
},
{
"start": 2974,
"end": 2999,
"text": "(Pennington et al., 2014)",
"ref_id": "BIBREF8"
},
{
"start": 3332,
"end": 3356,
"text": "Rutherford et al. (2017)",
"ref_id": "BIBREF13"
},
{
"start": 3413,
"end": 3432,
"text": "Liang et al. (2020)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "2"
},
{
"text": "In conjunction with our system, we provide a prototypical web-based front end with several views that simplifies the inspection of parser results. It can be used to visualize annotated documents, parse docu- ments, and inspect them interactively. Further, the visual inspection makes it easier to identify weaknesses of a developed parser, e.g. inaccurate connective identification or misplaced argument spans. The system is built on top of a simple Python web service powered by FastAPI 2 and it is designed using a reactive JavaScript library called VueJS 3 . Both sides communicate via RESTful interface with each other. Figure 1 demonstrates the view of a selected document. At the top, there is a simple search bar for easily accessing documents. Directly below, the document's text is shown together with a list of its discourse relations at the bottom of the view. Then, each discourse relation is listed with its corresponding relation type (e.g. Explicit, Implicit, EntRel, AltLex), as well as its sense. Different parts of a relation, first and second arguments as well as the connective, are highlighted by colors. Additionally, some context tokens are given before and after the relation if possible.",
"cite_spans": [],
"ref_spans": [
{
"start": 624,
"end": 632,
"text": "Figure 1",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Visualization",
"sec_num": "3"
},
{
"text": "The connective sense classifier takes the connective candidate and one surrounding context tokens as input. The two hidden layers both have dimensions 256. A dropout layer follows after each hidden layer with a 0.3 drop rate. Both argument extractors use two bi-directional recurrent layers with a hidden size of 256 in each direction, a dropout rate of 0.2 before and after the fully connected layer having a dimension of 128. The explicit extractor is trained on explicit examples with a window size of 100. The implicit sense classifier accepts two arguments with at most 35 tokens each. The same bi-directional recurrent layer with hidden size 128 processes both arguments. The drop rate of the dropout layer that follows after concatenation is 0.25, and the size of the hidden dimension afterward is 128. All models are trained with AMSGrad Adam (Reddi et al., 2018) and a 0.001 learning rate.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "For our evaluation, we use the same experimental design as proposed at the CoNLL Shared Task 2016 (Xue et al., 2016) . We have trained multiple pipelines with varying language models used to compute the input embeddings. The model names in our experiment tables follow the naming of the word embedding model 4 . As comparison systems, we choose the overall best performing submissions",
"cite_spans": [
{
"start": 98,
"end": 116,
"text": "(Xue et al., 2016)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Discussion",
"sec_num": "5"
},
{
"text": "Explicits Implicits for each test set (ecnucs (Wang and Lan, 2016) and oslopots (Oepen et al., 2016) ). Similar to the Shared Task, we compare two different thresholds: strict refers to an exact match of relations while partial counts relations as correct if their overlap is at least 70 %. Performances are measured on Section 23 of the PDTB as well as PDTB-like annotated Wikipedia data prepared for the Shared Task.",
"cite_spans": [
{
"start": 46,
"end": 66,
"text": "(Wang and Lan, 2016)",
"ref_id": "BIBREF16"
},
{
"start": 80,
"end": 100,
"text": "(Oepen et al., 2016)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "1 parser 1 conn 1 A1 1 A2 1 A12 1 parser 1 A1 1 A2 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "In Table 1 , strict results of the studied models are summarized. In the table's left part pointing to explicit relations, neural models outperform traditional models in most categories except for Arg1 identification, but still results are pretty close. Especially the bert-base model has an overall high performance. Interestingly, albert-base performs quite good, even though it has the smallest number of trained parameters. Also, it seems not beneficial in our experimental design to use a large version of a model. A reason for that might be the higher number of input values per token leading the model to an unstable training. The performance for implicit relations (arguments and overall) is noticeably weak as we used I fairly simple method for recognizing arguments following Lin et al. (2014) . Thereby, the overall implicit results are lowered as relations were not counted as correct during evaluation. The partial scores in Table 2 were expected to be higher compared to their strict counter parts.",
"cite_spans": [
{
"start": 786,
"end": 803,
"text": "Lin et al. (2014)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 1",
"ref_id": "TABREF1"
},
{
"start": 938,
"end": 945,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "In this work, we demonstrated a framework for shallow discourse parsing and integrated a web-based graphical user interface to study parser outputs. We presented an exemplary pipeline built from neural components that are based on recent models. We extend previous approaches to incorporate precomputed contextualized word embeddings. Our pipeline system performs competitively to former discourse parsers and partially outperforms them, while not using any linguistic features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "In the future, we plan to integrate more recent neural architectures into the system to improve overall scores. Further, we want to improve the graphical interface to seamlessly integrate the visualization directly into the text such as done with brat 5 for dependency parses. Thus, it will be easier to compare multiple relations in their context. Overlapping arguments are a major problem, why we decided to list relations separately. Building on that a view would be useful for comparing discourse relations across documents, e.g. comparing predictions and gold annotations or multiple parser outputs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "Explicits Implicits ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "1 parser 1 A1 1 A2 1 A12 1 parser 1 A1 1 A2 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "Senses are ordered in a hierarchy of up to three levels. Temporal refers to the first level and Synchronous to the second, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "fastapi.tiangolo.com 3 vuejs.org",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Model names follow huggingface.co/models",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "brat.nlplab.org",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This research was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), project 455911521.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": "7"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"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 under- standing. 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
},
"BIBREF1": {
"ref_id": "b1",
"title": "Abstractive summarization of product reviews using discourse structure",
"authors": [
{
"first": "Shima",
"middle": [],
"last": "Gerani",
"suffix": ""
},
{
"first": "Yashar",
"middle": [],
"last": "Mehdad",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Carenini",
"suffix": ""
},
{
"first": "Raymond",
"middle": [
"T"
],
"last": "Ng",
"suffix": ""
},
{
"first": "Bita",
"middle": [],
"last": "Nejat",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1602--1613",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1168"
]
},
"num": null,
"urls": [],
"raw_text": "Shima Gerani, Yashar Mehdad, Giuseppe Carenini, Raymond T. Ng, and Bita Nejat. 2014. Abstractive summarization of product reviews using discourse structure. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1602-1613, Doha, Qatar. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The utility of discourse parsing features for predicting argumentation structure",
"authors": [
{
"first": "Freya",
"middle": [],
"last": "Hewett",
"suffix": ""
},
{
"first": "Roshan",
"middle": [],
"last": "Prakash Rane",
"suffix": ""
},
{
"first": "Nina",
"middle": [],
"last": "Harlacher",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 6th Workshop on Argument Mining",
"volume": "",
"issue": "",
"pages": "98--103",
"other_ids": {
"DOI": [
"10.18653/v1/W19-4512"
]
},
"num": null,
"urls": [],
"raw_text": "Freya Hewett, Roshan Prakash Rane, Nina Harlacher, and Manfred Stede. 2019. The utility of discourse parsing features for predicting argumentation struc- ture. In Proceedings of the 6th Workshop on Argu- ment Mining, pages 98-103, Florence, Italy. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Contextualized embeddings for connective disambiguation in shallow discourse parsing",
"authors": [
{
"first": "Ren\u00e9",
"middle": [],
"last": "Knaebel",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the First Workshop on Computational Approaches to Discourse",
"volume": "",
"issue": "",
"pages": "65--75",
"other_ids": {
"DOI": [
"10.18653/v1/2020.codi-1.7"
]
},
"num": null,
"urls": [],
"raw_text": "Ren\u00e9 Knaebel and Manfred Stede. 2020. Contextu- alized embeddings for connective disambiguation in shallow discourse parsing. In Proceedings of the First Workshop on Computational Approaches to Discourse, pages 65-75, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Window-based neural tagging for shallow discourse argument labeling",
"authors": [
{
"first": "Ren\u00e9",
"middle": [],
"last": "Knaebel",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Stober",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL)",
"volume": "",
"issue": "",
"pages": "768--777",
"other_ids": {
"DOI": [
"10.18653/v1/K19-1072"
]
},
"num": null,
"urls": [],
"raw_text": "Ren\u00e9 Knaebel, Manfred Stede, and Sebastian Stober. 2019. Window-based neural tagging for shallow discourse argument labeling. In Proceedings of the 23rd Conference on Computational Natural Lan- guage Learning (CoNLL), pages 768-777, Hong Kong, China. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Extending implicit discourse relation recognition to the PDTB-3",
"authors": [
{
"first": "Li",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Zheng",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Webber",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the First Workshop on Computational Approaches to Discourse",
"volume": "",
"issue": "",
"pages": "135--147",
"other_ids": {
"DOI": [
"10.18653/v1/2020.codi-1.14"
]
},
"num": null,
"urls": [],
"raw_text": "Li Liang, Zheng Zhao, and Bonnie Webber. 2020. Ex- tending implicit discourse relation recognition to the PDTB-3. In Proceedings of the First Workshop on Computational Approaches to Discourse, pages 135- 147, Online. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A pdtb-styled end-to-end discourse parser",
"authors": [
{
"first": "Ziheng",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Min-Yen",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kan",
"suffix": ""
}
],
"year": 2014,
"venue": "Natural Language Engineering",
"volume": "20",
"issue": "",
"pages": "151--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ziheng Lin, Hwee Tou Ng, and Min-Yen Kan. 2014. A pdtb-styled end-to-end discourse parser. Natural Language Engineering, 20:151-184.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "OPT: Oslo-Potsdam-Teesside. pipelining rules, rankers, and classifier ensembles for shallow discourse parsing",
"authors": [
{
"first": "Stephan",
"middle": [],
"last": "Oepen",
"suffix": ""
},
{
"first": "Jonathon",
"middle": [],
"last": "Read",
"suffix": ""
},
{
"first": "Tatjana",
"middle": [],
"last": "Scheffler",
"suffix": ""
},
{
"first": "Uladzimir",
"middle": [],
"last": "Sidarenka",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
},
{
"first": "Erik",
"middle": [],
"last": "Velldal",
"suffix": ""
},
{
"first": "Lilja",
"middle": [],
"last": "\u00d8vrelid",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "20--26",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2002"
]
},
"num": null,
"urls": [],
"raw_text": "Stephan Oepen, Jonathon Read, Tatjana Scheffler, Uladzimir Sidarenka, Manfred Stede, Erik Velldal, and Lilja \u00d8vrelid. 2016. OPT: Oslo-Potsdam- Teesside. pipelining rules, rankers, and classifier en- sembles for shallow discourse parsing. In Pro- ceedings of the CoNLL-16 shared task, pages 20- 26, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "GloVe: Global vectors for word representation",
"authors": [
{
"first": "Jeffrey",
"middle": [],
"last": "Pennington",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1532--1543",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1162"
]
},
"num": null,
"urls": [],
"raw_text": "Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. GloVe: Global vectors for word rep- resentation. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Process- ing (EMNLP), pages 1532-1543, Doha, Qatar. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Using syntax to disambiguate explicit discourse connectives in text",
"authors": [
{
"first": "Emily",
"middle": [],
"last": "Pitler",
"suffix": ""
},
{
"first": "Ani",
"middle": [],
"last": "Nenkova",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the ACL-IJCNLP 2009 Conference Short Papers",
"volume": "",
"issue": "",
"pages": "13--16",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Emily Pitler and Ani Nenkova. 2009. Using syntax to disambiguate explicit discourse connectives in text. In Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, pages 13-16, Suntec, Singapore. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "The penn discourse treebank 2.0",
"authors": [
{
"first": "Rashmi",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Nikhil",
"middle": [],
"last": "Dinesh",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Eleni",
"middle": [],
"last": "Miltsakaki",
"suffix": ""
},
{
"first": "Livio",
"middle": [],
"last": "Robaldo",
"suffix": ""
},
{
"first": "Aravind",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Webber",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of LREC",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rashmi Prasad, Nikhil Dinesh, Alan Lee, Eleni Milt- sakaki, Livio Robaldo, Aravind Joshi, and Bonnie Webber. 2008. The penn discourse treebank 2.0. In In Proceedings of LREC.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Shallow discourse parsing using convolutional neural network",
"authors": [
{
"first": "Lianhui",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Zhisong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "70--77",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2010"
]
},
"num": null,
"urls": [],
"raw_text": "Lianhui Qin, Zhisong Zhang, and Hai Zhao. 2016. Shal- low discourse parsing using convolutional neural net- work. In Proceedings of the CoNLL-16 shared task, pages 70-77, Berlin, Germany. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "On the convergence of adam and beyond",
"authors": [
{
"first": "J",
"middle": [],
"last": "Sashank",
"suffix": ""
},
{
"first": "Satyen",
"middle": [],
"last": "Reddi",
"suffix": ""
},
{
"first": "Sanjiv",
"middle": [],
"last": "Kale",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kumar",
"suffix": ""
}
],
"year": 2018,
"venue": "6th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sashank J. Reddi, Satyen Kale, and Sanjiv Kumar. 2018. On the convergence of adam and beyond. In 6th International Conference on Learning Representa- tions, ICLR 2018, Vancouver, BC, Canada, April 30 -May 3, 2018, Conference Track Proceedings. Open- Review.net.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A systematic study of neural discourse models for implicit discourse relation",
"authors": [
{
"first": "Attapol",
"middle": [],
"last": "Rutherford",
"suffix": ""
},
{
"first": "Vera",
"middle": [],
"last": "Demberg",
"suffix": ""
},
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "281--291",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Attapol Rutherford, Vera Demberg, and Nianwen Xue. 2017. A systematic study of neural discourse models for implicit discourse relation. In Proceedings of the 15th Conference of the European Chapter of the As- sociation for Computational Linguistics: Volume 1, Long Papers, pages 281-291, Valencia, Spain. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Do we really need all those rich linguistic features? a neural network-based approach to implicit sense labeling",
"authors": [
{
"first": "Niko",
"middle": [],
"last": "Schenk",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Chiarcos",
"suffix": ""
},
{
"first": "Kathrin",
"middle": [],
"last": "Donandt",
"suffix": ""
},
{
"first": "Samuel",
"middle": [],
"last": "R\u00f6nnqvist",
"suffix": ""
},
{
"first": "Evgeny",
"middle": [],
"last": "Stepanov",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Riccardi",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "41--49",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2005"
]
},
"num": null,
"urls": [],
"raw_text": "Niko Schenk, Christian Chiarcos, Kathrin Donandt, Samuel R\u00f6nnqvist, Evgeny Stepanov, and Giuseppe Riccardi. 2016. Do we really need all those rich linguistic features? a neural network-based approach to implicit sense labeling. In Proceedings of the CoNLL-16 shared task, pages 41-49, Berlin, Ger- many. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "UniTN end-to-end discourse parser for CoNLL 2016 shared task",
"authors": [
{
"first": "Evgeny",
"middle": [],
"last": "Stepanov",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Riccardi",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "85--91",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2012"
]
},
"num": null,
"urls": [],
"raw_text": "Evgeny Stepanov and Giuseppe Riccardi. 2016. UniTN end-to-end discourse parser for CoNLL 2016 shared task. In Proceedings of the CoNLL-16 shared task, pages 85-91, Berlin, Germany. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Two end-to-end shallow discourse parsers for English and Chinese in CoNLL-2016 shared task",
"authors": [
{
"first": "Jianxiang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Man",
"middle": [],
"last": "Lan",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "33--40",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2004"
]
},
"num": null,
"urls": [],
"raw_text": "Jianxiang Wang and Man Lan. 2016. Two end-to-end shallow discourse parsers for English and Chinese in CoNLL-2016 shared task. In Proceedings of the CoNLL-16 shared task, pages 33-40, Berlin, Ger- many. Association for Computational Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "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": "Remi",
"middle": [],
"last": "Louf",
"suffix": ""
},
{
"first": "Morgan",
"middle": [],
"last": "Funtowicz",
"suffix": ""
},
{
"first": "Joe",
"middle": [],
"last": "Davison",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Shleifer",
"suffix": ""
},
{
"first": "Clara",
"middle": [],
"last": "Patrick Von Platen",
"suffix": ""
},
{
"first": "Yacine",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Jernite",
"suffix": ""
},
{
"first": "Canwen",
"middle": [],
"last": "Plu",
"suffix": ""
},
{
"first": "Teven",
"middle": [
"Le"
],
"last": "Xu",
"suffix": ""
},
{
"first": "Sylvain",
"middle": [],
"last": "Scao",
"suffix": ""
},
{
"first": "Mariama",
"middle": [],
"last": "Gugger",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Drame",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations",
"volume": "",
"issue": "",
"pages": "38--45",
"other_ids": {
"DOI": [
"10.18653/v1/2020.emnlp-demos.6"
]
},
"num": null,
"urls": [],
"raw_text": "Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pier- ric Cistac, Tim Rault, Remi Louf, Morgan Funtow- icz, Joe Davison, Sam Shleifer, Patrick von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, and Alexander Rush. 2020. Trans- formers: State-of-the-art natural language process- ing. In Proceedings of the 2020 Conference on Em- pirical Methods in Natural Language Processing: System Demonstrations, pages 38-45, Online. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "The CoNLL-2015 shared task on shallow discourse parsing",
"authors": [
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Sameer",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "Rashmi",
"middle": [],
"last": "Pradhan",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Attapol",
"middle": [],
"last": "Bryant",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rutherford",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task",
"volume": "",
"issue": "",
"pages": "1--16",
"other_ids": {
"DOI": [
"10.18653/v1/K15-2001"
]
},
"num": null,
"urls": [],
"raw_text": "Nianwen Xue, Hwee Tou Ng, Sameer Pradhan, Rashmi Prasad, Christopher Bryant, and Attapol Rutherford. 2015. The CoNLL-2015 shared task on shallow discourse parsing. In Proceedings of the Nine- teenth Conference on Computational Natural Lan- guage Learning -Shared Task, pages 1-16, Beijing, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "CoNLL 2016 shared task on multilingual shallow discourse parsing",
"authors": [
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Sameer",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "Attapol",
"middle": [],
"last": "Pradhan",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Rutherford",
"suffix": ""
},
{
"first": "Chuan",
"middle": [],
"last": "Webber",
"suffix": ""
},
{
"first": "Hongmin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "1--19",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2001"
]
},
"num": null,
"urls": [],
"raw_text": "Nianwen Xue, Hwee Tou Ng, Sameer Pradhan, At- tapol Rutherford, Bonnie Webber, Chuan Wang, and Hongmin Wang. 2016. CoNLL 2016 shared task on multilingual shallow discourse parsing. In Pro- ceedings of the CoNLL-16 shared task, pages 1- 19, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Discourse level factors for sentence deletion in text simplification",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Zhong",
"suffix": ""
},
{
"first": "Chao",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Junyi Jessy",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2020,
"venue": "AAAI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Zhong, Chao Jiang, Wei Xu, and Junyi Jessy Li. 2020. Discourse level factors for sentence deletion in text simplification. In AAAI.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"text": "Temporal.Synchronous) 2. Yesterday I walked through the rain, today I am sick. (Contingency.Cause)",
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"uris": null,
"text": "load pdtb documents with contextualized embeddings docs_train = load_bert_conll_dataset(...) docs_val = load_bert_conll_dataset(...) # definition of the parser pipeline by list of components parser = ParserPipeline([ # add connective and its sense ConnectiveSenseClassifier(...), # use connective to add explicit arguments ConnectiveArgumentExtractor(...), # extract adjacent sentences without explicit relation ImplicitArgumentExtractor(), # attach implicit sense ArgumentSenseClassifier(...), ]) # fit custom pipeline on annotated documents parser.fit(docs_train, docs_val) # extract discourse relations parses = parser.parse(docs_val)Listing 1: Discopy pipeline source code example.",
"type_str": "figure"
},
"FIGREF2": {
"num": null,
"uris": null,
"text": "Web-based front end overview. A selected document is shown with its discourse relations in the bottom.",
"type_str": "figure"
},
"TABREF1": {
"num": null,
"text": "Experimental results (strict F1 scores) for Section 23 of WSJ and the blind data set proposed for CoNLL Shared Task.",
"type_str": "table",
"content": "<table/>",
"html": null
},
"TABREF3": {
"num": null,
"text": "Experimental results (partial F1 scores with 0.7 overlap) for Section 23 of WSJ and the blind data set proposed for CoNLL Shared Task.",
"type_str": "table",
"content": "<table/>",
"html": null
}
}
}
}