| { |
| "paper_id": "S19-2001", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T15:47:05.183558Z" |
| }, |
| "title": "SemEval-2019 Task 1: Cross-lingual Semantic Parsing with UCCA", |
| "authors": [ |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Hershcovich", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Hebrew University of Jerusalem", |
| "location": {} |
| }, |
| "email": "danielh@cs.huji.ac.il" |
| }, |
| { |
| "first": "Elior", |
| "middle": [], |
| "last": "Sulem", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Hebrew University of Jerusalem", |
| "location": {} |
| }, |
| "email": "eliors@cs.huji.ac.il" |
| }, |
| { |
| "first": "Zohar", |
| "middle": [], |
| "last": "Aizenbud", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Hebrew University of Jerusalem", |
| "location": {} |
| }, |
| "email": "zohara@cs.huji.ac.il" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Hebrew University of Jerusalem", |
| "location": {} |
| }, |
| "email": "arir@cs.huji.ac.il" |
| }, |
| { |
| "first": "Leshem", |
| "middle": [], |
| "last": "Choshen", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Hebrew University of Jerusalem", |
| "location": {} |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "We present the SemEval 2019 shared task on Universal Conceptual Cognitive Annotation (UCCA) parsing in English, German and French, and discuss the participating systems and results. UCCA is a crosslinguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for existing parsing techniques, as it exhibits reentrancy (resulting in DAG structures), discontinuous structures and non-terminal nodes corresponding to complex semantic units. The shared task has yielded improvements over the state-of-the-art baseline in all languages and settings. Full results can be found in the task's website https://competitions. codalab.org/competitions/19160.", |
| "pdf_parse": { |
| "paper_id": "S19-2001", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "We present the SemEval 2019 shared task on Universal Conceptual Cognitive Annotation (UCCA) parsing in English, German and French, and discuss the participating systems and results. UCCA is a crosslinguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for existing parsing techniques, as it exhibits reentrancy (resulting in DAG structures), discontinuous structures and non-terminal nodes corresponding to complex semantic units. The shared task has yielded improvements over the state-of-the-art baseline in all languages and settings. Full results can be found in the task's website https://competitions. codalab.org/competitions/19160.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Semantic representation is receiving growing attention in NLP in the past few years, and many proposals for semantic schemes have recently been put forth. Examples include Abstract Meaning Representation (AMR; Banarescu et al., 2013) , Broad-coverage Semantic Dependencies (SDP; Oepen et al., 2016) , Universal Decompositional Semantics (UDS; White et al., 2016) , Parallel Meaning Bank (Abzianidze et al., 2017) , and Universal Conceptual Cognitive Annotation (UCCA; Abend and Rappoport, 2013) . These advances in semantic representation, along with corresponding advances in semantic parsing, can potentially benefit essentially all text understanding tasks, and have already demonstrated applicability to a variety of tasks, including summarization (Liu et al., 2015; Dohare and Karnick, 2017) , paraphrase detection (Issa et al., 2018) , and semantic evaluation (using UCCA; see below). In this shared task, we focus on UCCA parsing in multiple languages. One of our goals is to benefit semantic parsing in languages with less annotated resources by making use of data from more resource-rich languages. We refer to this approach as cross-lingual parsing, while other works (Zhang et al., 2017 (Zhang et al., , 2018 define cross-lingual parsing as the task of parsing text in one language to meaning representation in another language.", |
| "cite_spans": [ |
| { |
| "start": 210, |
| "end": 233, |
| "text": "Banarescu et al., 2013)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 279, |
| "end": 298, |
| "text": "Oepen et al., 2016)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 337, |
| "end": 342, |
| "text": "(UDS;", |
| "ref_id": null |
| }, |
| { |
| "start": 343, |
| "end": 362, |
| "text": "White et al., 2016)", |
| "ref_id": "BIBREF35" |
| }, |
| { |
| "start": 387, |
| "end": 412, |
| "text": "(Abzianidze et al., 2017)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 468, |
| "end": 494, |
| "text": "Abend and Rappoport, 2013)", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 752, |
| "end": 770, |
| "text": "(Liu et al., 2015;", |
| "ref_id": "BIBREF20" |
| }, |
| { |
| "start": 771, |
| "end": 796, |
| "text": "Dohare and Karnick, 2017)", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 820, |
| "end": 839, |
| "text": "(Issa et al., 2018)", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 1178, |
| "end": 1197, |
| "text": "(Zhang et al., 2017", |
| "ref_id": "BIBREF37" |
| }, |
| { |
| "start": 1198, |
| "end": 1219, |
| "text": "(Zhang et al., , 2018", |
| "ref_id": "BIBREF38" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Overview", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In addition to its potential applicative value, work on semantic parsing poses interesting algorithmic and modeling challenges, which are often different from those tackled in syntactic parsing, including reentrancy (e.g., for sharing arguments across predicates), and the modeling of the interface with lexical semantics.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Overview", |
| "sec_num": "1" |
| }, |
| { |
| "text": "UCCA is a cross-linguistically applicable semantic representation scheme, building on the established Basic Linguistic Theory typological framework (Dixon, 2010b (Dixon, ,a, 2012 . It has demonstrated applicability to multiple languages, including English, French and German, and pilot annotation projects were conducted on a few languages more. UCCA structures have been shown to be well-preserved in translation (Sulem et al., 2015) , and to support rapid annotation by nonexperts, assisted by an accessible annotation interface . 1 UCCA has already shown applicative value for text simplifica-", |
| "cite_spans": [ |
| { |
| "start": 148, |
| "end": 161, |
| "text": "(Dixon, 2010b", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 162, |
| "end": 178, |
| "text": "(Dixon, ,a, 2012", |
| "ref_id": "BIBREF12" |
| }, |
| { |
| "start": 414, |
| "end": 434, |
| "text": "(Sulem et al., 2015)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Overview", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The main relation of a Scene that evolves in time (usually an action or movement).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Scene Elements P Process", |
| "sec_num": null |
| }, |
| { |
| "text": "The main relation of a Scene that does not evolve in time. A Participant Scene participant (including locations, abstract entities and Scenes serving as arguments).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "S State", |
| "sec_num": null |
| }, |
| { |
| "text": "A secondary relation in a Scene.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "D Adverbial", |
| "sec_num": null |
| }, |
| { |
| "text": "Necessary for the conceptualization of the parent unit. E Elaborator A non-Scene relation applying to a single Center. N Connector A non-Scene relation applying to two or more Centers, highlighting a common feature.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Elements of Non-Scene Units C Center", |
| "sec_num": null |
| }, |
| { |
| "text": "All other types of non-Scene relations: (1) Rs that relate a C to some super-ordinate relation, and (2) Rs that relate two Cs pertaining to different aspects of the parent unit.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "R Relator", |
| "sec_num": null |
| }, |
| { |
| "text": "A Scene linked to other Scenes by regular linkage (e.g., temporal, logical, purposive). L Linker A relation between two or more Hs (e.g., \"when\", \"if\", \"in order to\").", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inter-Scene Relations H Parallel Scene", |
| "sec_num": null |
| }, |
| { |
| "text": "A relation between the speech event and the uttered Scene (e.g., \"surprisingly\").", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "G Ground", |
| "sec_num": null |
| }, |
| { |
| "text": "Does not introduce a relation or participant. Required by some structural pattern. tion (Sulem et al., 2018b) , as well as for defining semantic evaluation measures for text-to-text generation tasks, including machine translation (Birch et al., 2016 ), text simplification (Sulem et al., 2018a) and grammatical error correction (Choshen and Abend, 2018) .", |
| "cite_spans": [ |
| { |
| "start": 88, |
| "end": 109, |
| "text": "(Sulem et al., 2018b)", |
| "ref_id": "BIBREF33" |
| }, |
| { |
| "start": 230, |
| "end": 249, |
| "text": "(Birch et al., 2016", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 273, |
| "end": 294, |
| "text": "(Sulem et al., 2018a)", |
| "ref_id": "BIBREF32" |
| }, |
| { |
| "start": 328, |
| "end": 353, |
| "text": "(Choshen and Abend, 2018)", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Other F Function", |
| "sec_num": null |
| }, |
| { |
| "text": "The shared task defines a number of tracks, based on the different corpora and the availability of external resources (see \u00a75). It received submissions from eight research groups around the world. In all settings at least one of the submitted systems improved over the state-of-the-art TUPA parser (Hershcovich et al., 2017 (Hershcovich et al., , 2018 , used as a baseline.", |
| "cite_spans": [ |
| { |
| "start": 298, |
| "end": 323, |
| "text": "(Hershcovich et al., 2017", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 324, |
| "end": 351, |
| "text": "(Hershcovich et al., , 2018", |
| "ref_id": "BIBREF15" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Other F Function", |
| "sec_num": null |
| }, |
| { |
| "text": "UCCA represents the semantics of linguistic utterances as directed acyclic graphs (DAGs), where terminal (childless) nodes correspond to the text tokens, and non-terminal nodes to semantic units that participate in some super-ordinate relation. Edges are labeled, indicating the role of a child in the relation the parent represents. Nodes and edges belong to one of several layers, each corresponding to a \"module\" of semantic distinctions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Task Definition", |
| "sec_num": "2" |
| }, |
| { |
| "text": "UCCA's foundational layer covers the predicate-argument structure evoked by predicates of all grammatical categories (verbal, nominal, adjectival and others), the inter-relations between them, and other major linguistic phenomena such as semantic heads and multi-word expressions. It is the only layer for which annotated corpora exist at the moment, and is thus the target of this shared task. The layer's basic notion is the Scene, describing a state, action, movement or some other relation that evolves in time. Each Scene contains one main relation (marked as either a Process or a State), as well as one or more Participants. For example, the sentence \"After graduation, John moved to Paris\" (Figure 1 ) contains two Scenes, whose main relations are \"graduation\" and \"moved\". \"John\" is a Participant in both Scenes, while \"Paris\" only in the latter. Further categories account for inter-Scene relations and the internal structure of complex arguments and relations (e.g., coordination and multi-word expressions). Table 1 provides a concise description of the categories used by the UCCA foundational layer.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 698, |
| "end": 707, |
| "text": "(Figure 1", |
| "ref_id": "FIGREF0" |
| }, |
| { |
| "start": 1020, |
| "end": 1027, |
| "text": "Table 1", |
| "ref_id": "TABREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Task Definition", |
| "sec_num": "2" |
| }, |
| { |
| "text": "UCCA distinguishes primary edges, corresponding to explicit relations, from remote edges (appear dashed in Figure 1 ) that allow for a unit to participate in several super-ordinate relations. Primary edges form a tree in each layer, whereas remote edges enable reentrancy, forming a DAG.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 107, |
| "end": 115, |
| "text": "Figure 1", |
| "ref_id": "FIGREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Task Definition", |
| "sec_num": "2" |
| }, |
| { |
| "text": "UCCA graphs may contain implicit units with no correspondent in the text. Figure 2 shows the annotation for the sentence \"A similar technique is almost impossible to apply to other crops, such as cotton, soybeans and rice.\" 2 It includes a single Scene, whose main relation is \"apply\", a secondary relation \"almost impossible\", as well as two complex arguments: \"a similar technique\" and the coordinated argument \"such as cotton, soybeans, and rice.\" In addition, the Scene includes an implicit argument, which represents the agent of the \"apply\" relation.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 74, |
| "end": 82, |
| "text": "Figure 2", |
| "ref_id": "FIGREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Task Definition", |
| "sec_num": "2" |
| }, |
| { |
| "text": "While parsing technology is well-established for syntactic parsing, UCCA has several formal properties that distinguish it from syntactic representations, mostly UCCA's tendency to abstract away from syntactic detail that do not affect argument structure. For instance, consider the following examples where the concept of a Scene has a different rationale from the syntactic concept of a clause. First, non-verbal predicates in UCCA are represented like verbal ones, such as when they appear in copula clauses or noun phrases. Indeed, in Figure 1 , \"graduation\" and \"moved\" are considered separate Scenes, despite appearing in the same clause. Second, in the same example, \"John\" is marked as a (remote) Participant in the graduation Scene, despite not being explicitly mentioned. Third, consider the possessive construction in \"John's trip home\". While in UCCA \"trip\" evokes a Scene in which \"John\" is a Participant, a syntactic scheme would analyze this phrase similarly to \"John's shoes\". The differences in the challenges posed by syntactic parsing and UCCA parsing, and more generally by semantic parsing, motivate the development of targeted parsing technology to tackle it.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 539, |
| "end": 547, |
| "text": "Figure 1", |
| "ref_id": "FIGREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Task Definition", |
| "sec_num": "2" |
| }, |
| { |
| "text": "All UCCA corpora are freely available. 3 For English, we use v1.2.3 of the Wikipedia UCCA corpus (Wiki), v1.2.2 of the UCCA Twenty Thousand Leagues Under the Sea English-French parallel corpus (20K), which includes UCCA manual annotation for the first five chapters in French and English, and v1.0.1 of the UCCA German Twenty", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "3 https://github.com/ UniversalConceptualCognitiveAnnotation", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Thousand Leagues Under the Sea corpus, which includes the entire book in German. For consistent annotation, we replace any Time and Quantifier labels with Adverbial and Elaborator in these data sets. The resulting training, development 4 and test sets 5 are publicly available, and the splits are given in Table 2 . Statistics on various structural properties are given in Table 3 .", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 306, |
| "end": 313, |
| "text": "Table 2", |
| "ref_id": "TABREF1" |
| }, |
| { |
| "start": 373, |
| "end": 380, |
| "text": "Table 3", |
| "ref_id": "TABREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The corpora were manually annotated according to v1.2 of the UCCA guidelines, 6 and reviewed by a second annotator. All data was passed through automatic validation and normalization scripts. 7 The goal of validation is to rule out cases that are inconsistent with the UCCA annotation guidelines. For example, a Scene, defined by the presence of a Process or a State, should include at least one Participant.", |
| "cite_spans": [ |
| { |
| "start": 192, |
| "end": 193, |
| "text": "7", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Due to the small amount of annotated data available for French, we only provided a minimal training set of 15 sentences, in addition to the development and test set. Systems for French were expected to pursue semi-supervised approaches, such as cross-lingual learning or structure projection, leveraging the parallel nature of the corpus, or to rely on datasets for related formalisms, such as Universal Dependencies (Nivre et al., 2016) . The full unannotated 20K Leagues corpus in English and French was released as well, in order to facilitate pursuing cross-lingual approaches.", |
| "cite_spans": [ |
| { |
| "start": 417, |
| "end": 437, |
| "text": "(Nivre et al., 2016)", |
| "ref_id": "BIBREF24" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Datasets were released in an XML format, including tokenized text automatically pre-train/trial dev test total corpus sentences tokens sentences tokens sentences tokens passages sentences tokens English-Wiki 4,113 124,935 514 17,784 515 15,854 367 5,142 158,573 English-20K 0 0 0 0 492 12,574 154 492 12,574 French-20K 15 618 238 6,374 239 5,962 154 492 12,954 German-20K 5,211 119,872 651 12,334 652 12,325 367 6,514 144,531 processed using spaCy (see \u00a75), and gold-standard UCCA annotation for the train and development sets. 8 To facilitate the use of existing NLP tools, we also released the data in SDP, AMR, CoNLL-U and plain text formats.", |
| "cite_spans": [ |
| { |
| "start": 566, |
| "end": 567, |
| "text": "8", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 195, |
| "end": 455, |
| "text": "English-Wiki 4,113 124,935 514 17,784 515 15,854 367 5,142 158,573 English-20K 0 0 0 0 492 12,574 154 492 12,574 French-20K 15 618 238 6,374 239 5,962 154 492 12,954 German-20K 5,211 119,872 651 12,334 652 12,325 367 6,514", |
| "ref_id": "TABREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Data & Resources", |
| "sec_num": "3" |
| }, |
| { |
| "text": "We use the TUPA parser, the only parser for UCCA at the time the task was announced, as a baseline (Hershcovich et al., 2017 (Hershcovich et al., , 2018 . TUPA is a transition-based DAG parser based on a BiLSTM-based classifier. 9 TUPA in itself has been found superior to a number of conversionbased parsers that use existing parsers for other formalisms to parse UCCA by constructing a twoway conversion protocol between the formalisms. It can thus be regarded as a strong baseline for sys-8 https://github.com/ UniversalConceptualCognitiveAnnotation/ docs/blob/master/FORMAT.md 9 https://github.com/huji-nlp/tupa tem submissions to the shared task.", |
| "cite_spans": [ |
| { |
| "start": 99, |
| "end": 124, |
| "text": "(Hershcovich et al., 2017", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 125, |
| "end": 152, |
| "text": "(Hershcovich et al., , 2018", |
| "ref_id": "BIBREF15" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "TUPA: The Baseline Parser", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Tracks. Participants in the task were evaluated in four settings:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "1. English in-domain setting, using the Wiki corpus.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "2. English out-of-domain setting, using the Wiki corpus as training and development data, and 20K Leagues as test data.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "3. German in-domain setting, using the 20K Leagues corpus.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "4. French setting with no training data, using the 20K Leagues as development and test data.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "In order to allow both even ground comparison between systems and using hitherto untried resources, we held both an open and a closed track for submissions in the English and German settings. Closed track submissions were only allowed to use the gold-standard UCCA annotation distributed for the task in the target language, and were limited in their use of additional resources. Concretely, the only additional data they were allowed to use is that used by TUPA, which consists of automatic annotations provided by spaCy: 10 POS tags, syntactic dependency relations, and named entity types and spans. In addition, the closed track only allowed the use of word embeddings provided by fastText (Bojanowski et al., 2017) 11 for all languages.", |
| "cite_spans": [ |
| { |
| "start": 693, |
| "end": 718, |
| "text": "(Bojanowski et al., 2017)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Systems in the open track, on the other hand, were allowed to use any additional resource, such as UCCA annotation in other languages, dictionaries or datasets for other tasks, provided that they make sure not to use any additional gold standard annotation over the same text used in the UCCA corpora. 12 In both tracks, we required that submitted systems are not trained on the development data. We only held an open track for French, due to the paucity of training data. The four settings and two tracks result in a total of 7 competitions.", |
| "cite_spans": [ |
| { |
| "start": 302, |
| "end": 304, |
| "text": "12", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Scoring. The following scores an output graph", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "G 1 = (V 1 , E 1 ) against a gold one, G 2 = (V 2 , E 2 ), over the same sequence of terminals (tokens) W . For a node v in V 1 or V 2 , define yield(v) \u2286 W as is its set of terminal descendants. A pair of edges (v 1 , u 1 ) \u2208 E 1 and (v 2 , u 2 ) \u2208 E 2 with la- bels (categories) 1 , 2", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "is matching if yield(u 1 ) = yield(u 2 ) and 1 = 2 . Labeled precision and recall are defined by dividing the number of matching edges in G 1 and G 2 by |E 1 | and |E 2 |, respectively. F 1 is their harmonic mean:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "2 \u2022 Precision \u2022 Recall Precision + Recall", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Unlabeled precision, recall and F 1 are the same, but without requiring that 1 = 2 for the edges to match. We evaluate these measures for primary and remote edges separately. For a more finegrained evaluation, we additionally report precision, recall and F 1 on edges of each category. 13", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "We received a total of eight submissions to the different tracks: MaskParse@Deski\u00f1 (Marzinotto et al., 2019) from Orange Labs and Aix-Marseille University, HLT@SUDA (Jiang et al., 2019) from Soochow University, T\u00fcPa (P\u00fctz and Glocker, 2019) from the University of T\u00fcbingen, UC Davis (Yu and Sagae, 2019) from the University of California, Davis , GCN-Sem (Taslimipoor et al., 2019) from the University of Wolverhampton, CUNY-PekingU (Lyu et al., 2019) from the City University of New York and Peking University, DANGNT@UIT.VNU-HCM (Nguyen and Tran, 2019) from the University of Information Technology VNU-HCM, and XLangMo from Zhejiang University. Two systems (HLT@SUDA and CUNY-PekingU) participated in all the tracks. 14 In terms of parsing approaches, the task was quite varied.", |
| "cite_spans": [ |
| { |
| "start": 83, |
| "end": 108, |
| "text": "(Marzinotto et al., 2019)", |
| "ref_id": "BIBREF22" |
| }, |
| { |
| "start": 165, |
| "end": 185, |
| "text": "(Jiang et al., 2019)", |
| "ref_id": null |
| }, |
| { |
| "start": 355, |
| "end": 381, |
| "text": "(Taslimipoor et al., 2019)", |
| "ref_id": "BIBREF34" |
| }, |
| { |
| "start": 433, |
| "end": 451, |
| "text": "(Lyu et al., 2019)", |
| "ref_id": "BIBREF21" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participating Systems", |
| "sec_num": "6" |
| }, |
| { |
| "text": "HLT@SUDA converted UCCA graphs to constituency trees and trained a constituency parser and a recovery mechanism of remote edges in a multi-task framework. MaskParse@Deski\u00f1 used a bidirectional GRU tagger with a masking mechanism. T\u00fcpa and XLangMo used a transition-based approach. UC Davis used an encoder-decoder architecture. GCN-SEM uses a BiLSTM model to predict Semantic Dependency Parsing tags, when the syntactic dependency tree is given in the input. CUNY-PKU is based on an ensemble that includes different variations of the TUPA parser. DAN-GNT@UIT.VNU-HCM converted syntactic dependency trees to UCCA graphs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participating Systems", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Different systems handled remote edges differently. DANGNT@UIT.VNU-HCM and GCN-SEM ignored remote edges. UC Davis used a different BiLSTM for remote edges. HLT@SUDA marked remote edges when converting the graph to a constituency tree and trained a classification model for their recovery. MaskParse@Deski\u00f1 handles remote edges by detecting arguments that are outside of the parent's node span using a detection threshold on the output probabilities.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participating Systems", |
| "sec_num": "6" |
| }, |
| { |
| "text": "In terms of using the data, all teams but one used the UCCA XML format, two used the CoNLL-U format, which is derived by a lossy conversion process, and only one team found the other data formats helpful. One of the teams (MaskParse@Deski\u00f1) built a new training data adapted to their model by repeating each sentence N times, N being the number of non-terminal nodes in the UCCA graphs. Three of the teams adapted the baseline TUPA parser, or parts of it to form their parser, namely T\u00fcPa, CUNY-PekingU and XLangMo; HLT@SUDA used a constituency parser (Stern et al., 2017) as a component in their model; DANGNT@UIT.VNU-HCM is a rule-based system over the Stanford Parser, and the rest are newly constructed parsers.", |
| "cite_spans": [ |
| { |
| "start": 552, |
| "end": 572, |
| "text": "(Stern et al., 2017)", |
| "ref_id": "BIBREF30" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participating Systems", |
| "sec_num": "6" |
| }, |
| { |
| "text": "All teams found it useful to use external resources beyond those provided by the Shared Task. Four submissions used external embeddings, MUSE (Conneau et al., 2017) in the case of MaskParse@Deski\u00f1 and XLangMo, ELMo (Peters et al., 2018) in the case of T\u00fcPa, 15 and BERT (Devlin et al., 2019) in the case of HLT@SUDA. Other resources included additional unlabeled data (T\u00fcPa), a list of multi-word expressions (MaskParse@Deski\u00f1), and the Stanford parser in the case of DANGNT@UIT.VNU-HCM. Only CUNY-PKU used the 20K unlabeled parallel data in English and French. A common trend for many of the systems was the use of cross-lingual projection or transfer (MaskParse@Deski\u00f1, HLT@SUDA, T\u00fcPa, GCN-Sem, CUNY-PKU and XLangMo). This was necessary for French, and was found helpful for German as well (CUNY-PKU). Table 4 shows the labeled and unlabeled F1 for primary and remote edges, for each system in each track. Overall F1 (All) is the F1 calculated over both primary and remote edges. Full results are available online. 16 Figure 3 shows the fine-grained evaluation by labeled F1 per UCCA category, for each system in each track. While Ground edges were uniformly 16 http://bit.ly/semeval2019task1results difficult to parse due to their sparsity in the training data, Relators were the easiest for all systems, as they are both common and predictable. The Process/State distinction proved challenging, and most main relations were identified as the more common Process category. The winning system in most tracks (HLT@SUDA) performed better on almost all categories. Its largest advantage was on Parallel Scenes and Linkers, showing was especially successful at identifying Scene boundaries relative to the other systems, which requires a good understanding of syntax.", |
| "cite_spans": [ |
| { |
| "start": 142, |
| "end": 164, |
| "text": "(Conneau et al., 2017)", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 270, |
| "end": 291, |
| "text": "(Devlin et al., 2019)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 1017, |
| "end": 1019, |
| "text": "16", |
| "ref_id": null |
| }, |
| { |
| "start": 1161, |
| "end": 1163, |
| "text": "16", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 804, |
| "end": 811, |
| "text": "Table 4", |
| "ref_id": "TABREF4" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Participating Systems", |
| "sec_num": "6" |
| }, |
| { |
| "text": "The HLT@SUDA system participated in all the tracks, obtaining the first place in the six English and German tracks and the second place in the French open track. The system is based on the conversion of UCCA graphs into constituency trees, marking remote and discontinuous edges for recovery. The classification-based recovery of the remote edges is performed simultaneously with the constituency parsing in a multi-task learning framework. This work, which further connects between semantic and syntactic parsing, proposes a recovery mechanism that can be applied to other grammatical formalisms, enabling the conversion of a given formalism to another one for parsing. The idea of this system is inspired by the pseudo non-projective dependency parsing approach proposed by Nivre and Nilsson (2005) .", |
| "cite_spans": [ |
| { |
| "start": 776, |
| "end": 800, |
| "text": "Nivre and Nilsson (2005)", |
| "ref_id": "BIBREF25" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The MaskParse@Deski\u00f1 system only participated to the French open track, focusing on crosslingual parsing. The system uses a semantic tagger, implemented with a bidirectional GRU and a masking mechanism to recursively extract the inner semantic structures in the graph. Multilingual word embeddings are also used. Using the English and German training data as well as the small French trial data for training, the parser ranked fourth in the French open track with a labeled F1 score of 65.4%, suggesting that this new model could be useful for low-resource languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The T\u00fcpa system takes a transition-based approach, building on the TUPA transition system and oracle, but modifies its feature representations. Specifically, instead of representing the parser configuration using LSTMs over the partially parsed graph, stack and buffer, they use feedforward networks with ELMo contextualized embeddings. The stack and buffer are represented 0 86 76 69 66 93 30 73 77 82 74 80 29 77 63 63 64 92 29 69 77 83 74 78 50 74 66 62 62 91 30 72 77 83 74 81 0 76 62 60 62 91 23 73 75 81 71 78 0 76 53 62 63 89 31 70 71 87 74 80 29 84 29 58 45 91 0 HLT@SUDA baseline Davis CUNY-PekingU DANGNT@UIT. by the top three items on them. For the partially parsed graph, they extract the rightmost and leftmost parents and children of the respective items, and represent them by the ELMo embedding of their form, the embedding of their dependency heads (for terminals, for non-terminals this is replaced with a learned embedding) and the embeddings of all terminal children. Results are generally on-par with the TUPA baseline, and surpass it from the out-of-domain English setting. This suggests that the TUPA architecture may be simplified, without compromising performance.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 374, |
| "end": 673, |
| "text": "0 86 76 69 66 93 30 73 77 82 74 80 29 77 63 63 64 92 29 69 77 83 74 78 50 74 66 62 62 91 30 72 77 83 74 81 0 76 62 60 62 91 23 73 75 81 71 78 0 76 53 62 63 89 31 70 71 87 74 80 29 84 29 58 45 91 0", |
| "ref_id": "TABREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The UC Davis system participated only in the English closed track, where they achieved the second highest score, on par with TUPA. The proposed parser has an encoder-decoder architecture, where the encoder is a simple BiLSTM encoder for each span of words. The decoder iteratively and greedily traverses the sentence, and attempts to predict span boundaries. The basic algorithm yields an unlabeled contiguous phrase-based tree, but additional modules predict the labels of the spans, discontiguous units (by joining together spans from the contiguous tree under a new node), and remote edges. The work is inspired by Kitaev and Klein (2018) , who used similar methods for constituency parsing.", |
| "cite_spans": [ |
| { |
| "start": 618, |
| "end": 641, |
| "text": "Kitaev and Klein (2018)", |
| "ref_id": "BIBREF19" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The GCN-SEM system uses a BiLSTM encoder, and predicts bi-lexical semantic dependencies (in the SDP format) using word, token and syntactic dependency parses. The latter is incorporated into the network with a graph convolutional network (GCN). The team participated in the English and German closed tracks, and were not among the highest-ranking teams. However, scores on the UCCA test sets converted to the bi-lexical CoNLL-U format were rather high, implying that the lossy conversion could be much of the reason.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The CUNY-PKU system was based on an ensemble. The ensemble included variations of TUPA parser, namely the MLP and BiLSTM models (Hershcovich et al., 2017) and the BiLSTM model with an additional MLP. The system also proposes a way to aggregate the ensemble going through CKY parsing and accounting for remotes and discontinuous spans. The team participated in all tracks, including additional information in the open domain, notably synthetic data based on automatically translating annotated texts. Their system ranks first in the French open track.", |
| "cite_spans": [ |
| { |
| "start": 128, |
| "end": 154, |
| "text": "(Hershcovich et al., 2017)", |
| "ref_id": "BIBREF14" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The DANGNT@UIT.VNU-HCM system partic-ipated only in the English Wiki open and closed tracks. The system is based on graph transformations from dependency trees into UCCA, using heuristics to create non-terminal nodes and map the dependency relations to UCCA categories. The manual rules were developed based on the training and development data. As the system converts trees to trees and does not add reentrancies, it does not produce remote edges. While the results are not among the highest-ranking in the task, the primary labeled F1 score of 71.1% in the English open track shows that a rule-based system on top of a leading dependency parser (the Stanford parser) can obtain reasonable results for this task.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "The task has yielded substantial improvements to UCCA parsing in all settings. Given that the best reported results were achieved with different parsing and learning approaches than the baseline model TUPA (which has been the only available parser for UCCA), the task opens a variety of paths for future improvement. Cross-lingual transfer, which capitalizes on UCCA's tendency to be preserved in translation, was employed by a number of systems and has proven remarkably effective. Indeed, the high scores obtained for French parsing in a low-resource setting suggest that high quality UCCA parsing can be straightforwardly extended to additional languages, with only a minimal amount of manual labor.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "9" |
| }, |
| { |
| "text": "Moreover, given the conceptual similarity between the different semantic representations , it is likely the parsers developed for the shared task will directly contribute to the development of other semantic parsing technology. Such a contribution is facilitated by the available conversion scripts available between UCCA and other formats.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "9" |
| }, |
| { |
| "text": "https://github.com/omriabnd/UCCA-App", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The same example was used byOepen et al. (2015) to compare different semantic dependency schemes.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://bit.ly/semeval2019task1traindev 5 http://bit.ly/semeval2019task1test 6 http://bit.ly/semeval2019task1guidelines 7 https://github.com/huji-nlp/ucca/ tree/master/scripts", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://spacy.io 11 http://fasttext.cc", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "We are not aware of any such annotation, but include this restriction for completeness.13 The official evaluation script providing both coarse-grained and fine-grained scores can be found in https://github.com/huji-nlp/ucca/blob/ master/scripts/evaluate_standard.py.14 It was later discovered that CUNY-PekingU used some of the evaluation data for training in the open tracks, and they were thus disqualified from these tracks.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "GCN-Sem used ELMo in the closed tracks, training on the available data.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "We are deeply grateful to Dotan Dvir and the UCCA annotation team for their diligent work on the corpora used in this shared task.This work was supported by the Israel Science Foundation (grant No. 929/17), and by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister's Office.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgments", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Universal Conceptual Cognitive Annotation (UCCA)", |
| "authors": [ |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "228--238", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Omri Abend and Ari Rappoport. 2013. Universal Con- ceptual Cognitive Annotation (UCCA). In Proc. of ACL, pages 228-238.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The state of the art in semantic representation", |
| "authors": [ |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "77--89", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/P17-1008" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Omri Abend and Ari Rappoport. 2017. The state of the art in semantic representation. In Proc. of ACL, pages 77-89.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "UCCAApp: Web-application for syntactic and semantic phrase-based annotation", |
| "authors": [ |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Shai", |
| "middle": [], |
| "last": "Yerushalmi", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proc. of ACL System Demonstrations", |
| "volume": "", |
| "issue": "", |
| "pages": "109--114", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Omri Abend, Shai Yerushalmi, and Ari Rappoport. 2017. UCCAApp: Web-application for syntactic and semantic phrase-based annotation. Proc. of ACL System Demonstrations, pages 109-114.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "The parallel meaning bank: Towards a multilingual corpus of translations annotated with compositional meaning representations", |
| "authors": [ |
| { |
| "first": "Lasha", |
| "middle": [], |
| "last": "Abzianidze", |
| "suffix": "" |
| }, |
| { |
| "first": "Johannes", |
| "middle": [], |
| "last": "Bjerva", |
| "suffix": "" |
| }, |
| { |
| "first": "Kilian", |
| "middle": [], |
| "last": "Evang", |
| "suffix": "" |
| }, |
| { |
| "first": "Hessel", |
| "middle": [], |
| "last": "Haagsma", |
| "suffix": "" |
| }, |
| { |
| "first": "Rik", |
| "middle": [], |
| "last": "Van Noord", |
| "suffix": "" |
| }, |
| { |
| "first": "Pierre", |
| "middle": [], |
| "last": "Ludmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Duc-Duy", |
| "middle": [], |
| "last": "Nguyen", |
| "suffix": "" |
| }, |
| { |
| "first": "Johan", |
| "middle": [], |
| "last": "Bos", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Lasha Abzianidze, Johannes Bjerva, Kilian Evang, Hessel Haagsma, Rik van Noord, Pierre Ludmann, Duc-Duy Nguyen, and Johan Bos. 2017. The paral- lel meaning bank: Towards a multilingual corpus of translations annotated with compositional meaning representations. CoRR, abs/1702.03964.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Abstract Meaning Representation for sembanking", |
| "authors": [ |
| { |
| "first": "Laura", |
| "middle": [], |
| "last": "Banarescu", |
| "suffix": "" |
| }, |
| { |
| "first": "Claire", |
| "middle": [], |
| "last": "Bonial", |
| "suffix": "" |
| }, |
| { |
| "first": "Shu", |
| "middle": [], |
| "last": "Cai", |
| "suffix": "" |
| }, |
| { |
| "first": "Madalina", |
| "middle": [], |
| "last": "Georgescu", |
| "suffix": "" |
| }, |
| { |
| "first": "Kira", |
| "middle": [], |
| "last": "Griffitt", |
| "suffix": "" |
| }, |
| { |
| "first": "Ulf", |
| "middle": [], |
| "last": "Hermjakob", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Knight", |
| "suffix": "" |
| }, |
| { |
| "first": "Martha", |
| "middle": [], |
| "last": "Palmer", |
| "suffix": "" |
| }, |
| { |
| "first": "Nathan", |
| "middle": [], |
| "last": "Schneider", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proc. of the Linguistic Annotation Workshop", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Martha Palmer, and Nathan Schneider. 2013. Abstract Meaning Representation for sem- banking. In Proc. of the Linguistic Annotation Workshop.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "HUME: Human UCCAbased evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Alexandra", |
| "middle": [], |
| "last": "Birch", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proc. of EMNLP", |
| "volume": "", |
| "issue": "", |
| "pages": "1264--1274", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alexandra Birch, Omri Abend, Ond\u0159ej Bojar, and Barry Haddow. 2016. HUME: Human UCCA- based evaluation of machine translation. In Proc. of EMNLP, pages 1264-1274.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Enriching word vectors with subword information", |
| "authors": [ |
| { |
| "first": "Piotr", |
| "middle": [], |
| "last": "Bojanowski", |
| "suffix": "" |
| }, |
| { |
| "first": "Edouard", |
| "middle": [], |
| "last": "Grave", |
| "suffix": "" |
| }, |
| { |
| "first": "Armand", |
| "middle": [], |
| "last": "Joulin", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomas", |
| "middle": [], |
| "last": "Mikolov", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "TACL", |
| "volume": "5", |
| "issue": "", |
| "pages": "135--146", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching word vectors with subword information. TACL, 5:135-146.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Referenceless measure of faithfulness for grammatical error correction", |
| "authors": [ |
| { |
| "first": "Leshem", |
| "middle": [], |
| "last": "Choshen", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proc. of NAACL", |
| "volume": "", |
| "issue": "", |
| "pages": "124--129", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Leshem Choshen and Omri Abend. 2018. Reference- less measure of faithfulness for grammatical error correction. In Proc. of NAACL (Short papers), pages 124-129.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Word translation without parallel data", |
| "authors": [ |
| { |
| "first": "Alexis", |
| "middle": [], |
| "last": "Conneau", |
| "suffix": "" |
| }, |
| { |
| "first": "Guillaume", |
| "middle": [], |
| "last": "Lample", |
| "suffix": "" |
| }, |
| { |
| "first": "Marc'aurelio", |
| "middle": [], |
| "last": "Ranzato", |
| "suffix": "" |
| }, |
| { |
| "first": "Ludovic", |
| "middle": [], |
| "last": "Denoyer", |
| "suffix": "" |
| }, |
| { |
| "first": "Herv\u00e9", |
| "middle": [], |
| "last": "J\u00e9gou", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1710.04087" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alexis Conneau, Guillaume Lample, Marc'Aurelio Ranzato, Ludovic Denoyer, and Herv\u00e9 J\u00e9gou. 2017. Word translation without parallel data. arXiv preprint arXiv:1710.04087.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "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": "Proc. of NAACL", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "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 Proc. of NAACL (to appear).", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Basic Linguistic Theory: Grammatical Topics", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [ |
| "W" |
| ], |
| "last": "Robert", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Dixon", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "", |
| "volume": "2", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Robert M. W. Dixon. 2010a. Basic Linguistic Theory: Grammatical Topics, volume 2. Oxford University Press.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Basic Linguistic Theory: Methodology", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [ |
| "W" |
| ], |
| "last": "Robert", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Dixon", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "", |
| "volume": "1", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Robert M. W. Dixon. 2010b. Basic Linguistic Theory: Methodology, volume 1. Oxford University Press.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Basic Linguistic Theory: Further Grammatical Topics", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [ |
| "W" |
| ], |
| "last": "Robert", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Dixon", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "", |
| "volume": "3", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Robert M. W. Dixon. 2012. Basic Linguistic Theory: Further Grammatical Topics, volume 3. Oxford University Press.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Text summarization using abstract meaning representation", |
| "authors": [ |
| { |
| "first": "Shibhansh", |
| "middle": [], |
| "last": "Dohare", |
| "suffix": "" |
| }, |
| { |
| "first": "Harish", |
| "middle": [], |
| "last": "Karnick", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shibhansh Dohare and Harish Karnick. 2017. Text summarization using abstract meaning representa- tion. CoRR, abs/1706.01678.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "A transition-based directed acyclic graph parser for UCCA", |
| "authors": [ |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Hershcovich", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "1127--1138", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daniel Hershcovich, Omri Abend, and Ari Rap- poport. 2017. A transition-based directed acyclic graph parser for UCCA. In Proc. of ACL, pages 1127-1138.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Multitask parsing across semantic representations", |
| "authors": [ |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Hershcovich", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "373--385", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daniel Hershcovich, Omri Abend, and Ari Rappoport. 2018. Multitask parsing across semantic representa- tions. In Proc. of ACL, pages 373-385.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Abstract meaning representation for paraphrase detection", |
| "authors": [ |
| { |
| "first": "Fuad", |
| "middle": [], |
| "last": "Issa", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Damonte", |
| "suffix": "" |
| }, |
| { |
| "first": "Shay", |
| "middle": [ |
| "B" |
| ], |
| "last": "Cohen", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiaohui", |
| "middle": [], |
| "last": "Yan", |
| "suffix": "" |
| }, |
| { |
| "first": "Yi", |
| "middle": [], |
| "last": "Chang", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proc. of NAACL", |
| "volume": "", |
| "issue": "", |
| "pages": "442--452", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fuad Issa, Marco Damonte, Shay B. Cohen, Xiaohui Yan, and Yi Chang. 2018. Abstract meaning rep- resentation for paraphrase detection. In Proc. of NAACL, pages 442-452.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "at semEval-2019 Task 1: UCCA graph parsing as constituent tree parsing", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Hlt", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Suda", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "HLT@SUDA at semEval-2019 Task 1: UCCA graph parsing as constituent tree parsing. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Consituency parser with self-attentive decoder", |
| "authors": [ |
| { |
| "first": "Nikita", |
| "middle": [], |
| "last": "Kitaev", |
| "suffix": "" |
| }, |
| { |
| "first": "Dan", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "2676--2686", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nikita Kitaev and Dan Klein. 2018. Consituency parser with self-attentive decoder. In ACL, pages 2676-2686.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "Toward abstractive summarization using semantic representations", |
| "authors": [ |
| { |
| "first": "Fei", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Jeffrey", |
| "middle": [], |
| "last": "Flanigan", |
| "suffix": "" |
| }, |
| { |
| "first": "Sam", |
| "middle": [], |
| "last": "Thomson", |
| "suffix": "" |
| }, |
| { |
| "first": "Norman", |
| "middle": [], |
| "last": "Sadeh", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah", |
| "middle": [ |
| "A" |
| ], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proc. of NAACL-HLT", |
| "volume": "", |
| "issue": "", |
| "pages": "1077--1086", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fei Liu, Jeffrey Flanigan, Sam Thomson, Norman Sadeh, and Noah A. Smith. 2015. Toward abstrac- tive summarization using semantic representations. In Proc. of NAACL-HLT, pages 1077-1086, Denver, Colorado.", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "CUNY-PKU parser at SemEval-2019 Task 1: Crosslingual semantic parsing with UCCA", |
| "authors": [ |
| { |
| "first": "Weimin", |
| "middle": [], |
| "last": "Lyu", |
| "suffix": "" |
| }, |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "Abdul", |
| "middle": [ |
| "Rafae" |
| ], |
| "last": "Khan", |
| "suffix": "" |
| }, |
| { |
| "first": "Shengqiang", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Weiwei", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| }, |
| { |
| "first": "Jia", |
| "middle": [], |
| "last": "Xu", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Weimin Lyu, Sheng Huang, Abdul Rafae Khan, Shengqiang Zhang, Weiwei Sun, and Jia Xu. 2019. CUNY-PKU parser at SemEval-2019 Task 1: Cross- lingual semantic parsing with UCCA. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "MaskParse@Deski\u00f1 at semEval-2019 Task 1: Cross-lingual UCCA semantic parsing with recursive masked sequence tagging", |
| "authors": [ |
| { |
| "first": "Gabriel", |
| "middle": [], |
| "last": "Marzinotto", |
| "suffix": "" |
| }, |
| { |
| "first": "Johannes", |
| "middle": [], |
| "last": "Heinecke", |
| "suffix": "" |
| }, |
| { |
| "first": "G\u00e9raldine", |
| "middle": [], |
| "last": "Damnati", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gabriel Marzinotto, Johannes Heinecke, and G\u00e9raldine Damnati. 2019. MaskParse@Deski\u00f1 at semEval- 2019 Task 1: Cross-lingual UCCA semantic parsing with recursive masked sequence tagging. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "DAN-GNT@UIT.VNU-HCM at SemEval-2019 Task 1: Graph transformation system from Stanford basic dependencies to Universal Conceptual Cognitive Annotation (UCCA)", |
| "authors": [ |
| { |
| "first": "Trung", |
| "middle": [], |
| "last": "Dang Tuan Nguyen", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tran", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dang Tuan Nguyen and Trung Tran. 2019. DAN- GNT@UIT.VNU-HCM at SemEval-2019 Task 1: Graph transformation system from Stanford basic dependencies to Universal Conceptual Cognitive Annotation (UCCA). In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "Universal dependencies v1: A multilingual treebank collection", |
| "authors": [ |
| { |
| "first": "Joakim", |
| "middle": [], |
| "last": "Nivre", |
| "suffix": "" |
| }, |
| { |
| "first": "Marie-Catherine", |
| "middle": [], |
| "last": "De Marneffe", |
| "suffix": "" |
| }, |
| { |
| "first": "Filip", |
| "middle": [], |
| "last": "Ginter", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoav", |
| "middle": [], |
| "last": "Goldberg", |
| "suffix": "" |
| }, |
| { |
| "first": "Jan", |
| "middle": [], |
| "last": "Hajic", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher", |
| "middle": [ |
| "D" |
| ], |
| "last": "Manning", |
| "suffix": "" |
| }, |
| { |
| "first": "Ryan", |
| "middle": [], |
| "last": "Mcdonald", |
| "suffix": "" |
| }, |
| { |
| "first": "Slav", |
| "middle": [], |
| "last": "Petrov", |
| "suffix": "" |
| }, |
| { |
| "first": "Sampo", |
| "middle": [], |
| "last": "Pyysalo", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proc. of LREC", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Joakim Nivre, Marie-Catherine de Marneffe, Filip Gin- ter, Yoav Goldberg, Jan Hajic, Christopher D. Man- ning, Ryan McDonald, Slav Petrov, Sampo Pyysalo, Natalia Silveira, Reut Tsarfaty, and Daniel Zeman. 2016. Universal dependencies v1: A multilingual treebank collection. In Proc. of LREC.", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "Pseudoprojective dependency parsing", |
| "authors": [ |
| { |
| "first": "Joakin", |
| "middle": [], |
| "last": "Nivre", |
| "suffix": "" |
| }, |
| { |
| "first": "Jens", |
| "middle": [], |
| "last": "Nilsson", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "99--106", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Joakin Nivre and Jens Nilsson. 2005. Pseudo- projective dependency parsing. In Proc. of ACL, pages 99-106.", |
| "links": null |
| }, |
| "BIBREF26": { |
| "ref_id": "b26", |
| "title": "Towards comparability of linguistic graph banks for semantic parsing", |
| "authors": [ |
| { |
| "first": "Stephan", |
| "middle": [], |
| "last": "Oepen", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Kuhlmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Yusuke", |
| "middle": [], |
| "last": "Miyao", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Zeman", |
| "suffix": "" |
| }, |
| { |
| "first": "Silvie", |
| "middle": [], |
| "last": "Cinkova", |
| "suffix": "" |
| }, |
| { |
| "first": "Dan", |
| "middle": [], |
| "last": "Flickinger", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proc. of LREC", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Silvie Cinkova, Dan Flickinger, Jan Hajic, Angelina Ivanova, and Zdenka Uresova. 2016. Towards comparability of linguistic graph banks for semantic parsing. In Proc. of LREC.", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "SemEval 2015 task 18: Broad-coverage semantic dependency parsing", |
| "authors": [ |
| { |
| "first": "Stephan", |
| "middle": [], |
| "last": "Oepen", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Kuhlmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Yusuke", |
| "middle": [], |
| "last": "Miyao", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Zeman", |
| "suffix": "" |
| }, |
| { |
| "first": "Silvie", |
| "middle": [], |
| "last": "Cinkov\u00e1", |
| "suffix": "" |
| }, |
| { |
| "first": "Dan", |
| "middle": [], |
| "last": "Flickinger", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proc. of SemEval", |
| "volume": "", |
| "issue": "", |
| "pages": "915--926", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Silvie Cinkov\u00e1, Dan Flickinger, Jan Haji\u010d, and Zde\u0148ka Ure\u0161ov\u00e1. 2015. SemEval 2015 task 18: Broad-coverage semantic dependency pars- ing. In Proc. of SemEval, pages 915-926.", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "Deep contextualized word representations", |
| "authors": [ |
| { |
| "first": "Matthew", |
| "middle": [], |
| "last": "Peters", |
| "suffix": "" |
| }, |
| { |
| "first": "Mark", |
| "middle": [], |
| "last": "Neumann", |
| "suffix": "" |
| }, |
| { |
| "first": "Mohit", |
| "middle": [], |
| "last": "Iyyer", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Gardner", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher", |
| "middle": [], |
| "last": "Clark", |
| "suffix": "" |
| }, |
| { |
| "first": "Kenton", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Luke", |
| "middle": [], |
| "last": "Zettlemoyer", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", |
| "volume": "1", |
| "issue": "", |
| "pages": "2227--2237", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/N18-1202" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Matthew Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep contextualized word rep- resentations. In Proceedings of the 2018 Confer- ence of the North American Chapter of the Associ- ation for Computational Linguistics: Human Lan- guage Technologies, Volume 1 (Long Papers), pages 2227-2237. Association for Computational Linguis- tics.", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "T\u00fcpa at SemEval-2019 Task 1: (Almost) feature-free semantic parsing", |
| "authors": [ |
| { |
| "first": "Tobias", |
| "middle": [], |
| "last": "P\u00fctz", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Glocker", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tobias P\u00fctz and Kevin Glocker. 2019. T\u00fcpa at SemEval-2019 Task 1: (Almost) feature-free seman- tic parsing. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF30": { |
| "ref_id": "b30", |
| "title": "A minimal span-based neural constituency parser", |
| "authors": [ |
| { |
| "first": "Mitchell", |
| "middle": [], |
| "last": "Stern", |
| "suffix": "" |
| }, |
| { |
| "first": "Jacob", |
| "middle": [], |
| "last": "Andreas", |
| "suffix": "" |
| }, |
| { |
| "first": "Dan", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "818--827", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Mitchell Stern, Jacob Andreas, and Dan Klein. 2017. A minimal span-based neural constituency parser. In ACL, pages 818-827.", |
| "links": null |
| }, |
| "BIBREF31": { |
| "ref_id": "b31", |
| "title": "Conceptual annotations preserve structure across translations: A French-English case study", |
| "authors": [ |
| { |
| "first": "Elior", |
| "middle": [], |
| "last": "Sulem", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proc. of S2MT", |
| "volume": "", |
| "issue": "", |
| "pages": "11--22", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Elior Sulem, Omri Abend, and Ari Rappoport. 2015. Conceptual annotations preserve structure across translations: A French-English case study. In Proc. of S2MT, pages 11-22.", |
| "links": null |
| }, |
| "BIBREF32": { |
| "ref_id": "b32", |
| "title": "Semantic structural annotation for text simplification", |
| "authors": [ |
| { |
| "first": "Elior", |
| "middle": [], |
| "last": "Sulem", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "NAACL 2018", |
| "volume": "", |
| "issue": "", |
| "pages": "685--696", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Elior Sulem, Omri Abend, and Ari Rappoport. 2018a. Semantic structural annotation for text simplifica- tion. In NAACL 2018, pages 685-696.", |
| "links": null |
| }, |
| "BIBREF33": { |
| "ref_id": "b33", |
| "title": "Simple and effective text simplification using semantic and neural methods", |
| "authors": [ |
| { |
| "first": "Elior", |
| "middle": [], |
| "last": "Sulem", |
| "suffix": "" |
| }, |
| { |
| "first": "Omri", |
| "middle": [], |
| "last": "Abend", |
| "suffix": "" |
| }, |
| { |
| "first": "Ari", |
| "middle": [], |
| "last": "Rappoport", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proc. of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "162--173", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Elior Sulem, Omri Abend, and Ari Rappoport. 2018b. Simple and effective text simplification using se- mantic and neural methods. In Proc. of ACL, pages 162-173.", |
| "links": null |
| }, |
| "BIBREF34": { |
| "ref_id": "b34", |
| "title": "GCN-Sem at SemEval-2019 Task 1: Semantic parsing using graph convolutional and recurrent neural networks", |
| "authors": [ |
| { |
| "first": "Shiva", |
| "middle": [], |
| "last": "Taslimipoor", |
| "suffix": "" |
| }, |
| { |
| "first": "Omid", |
| "middle": [], |
| "last": "Rohanian", |
| "suffix": "" |
| }, |
| { |
| "first": "Sara", |
| "middle": [], |
| "last": "Mo\u017ee", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shiva Taslimipoor, Omid Rohanian, and Sara Mo\u017ee. 2019. GCN-Sem at SemEval-2019 Task 1: Seman- tic parsing using graph convolutional and recurrent neural networks. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF35": { |
| "ref_id": "b35", |
| "title": "Universal decompositional semantics on universal dependencies", |
| "authors": [ |
| { |
| "first": "Aaron", |
| "middle": [], |
| "last": "Steven White", |
| "suffix": "" |
| }, |
| { |
| "first": "Drew", |
| "middle": [], |
| "last": "Reisinger", |
| "suffix": "" |
| }, |
| { |
| "first": "Keisuke", |
| "middle": [], |
| "last": "Sakaguchi", |
| "suffix": "" |
| }, |
| { |
| "first": "Tim", |
| "middle": [], |
| "last": "Vieira", |
| "suffix": "" |
| }, |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Rachel", |
| "middle": [], |
| "last": "Rudinger", |
| "suffix": "" |
| }, |
| { |
| "first": "Kyle", |
| "middle": [], |
| "last": "Rawlins", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proc. of the 2016 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "1713--1723", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Aaron Steven White, Drew Reisinger, Keisuke Sak- aguchi, Tim Vieira, Sheng Zhang, Rachel Rudinger, Kyle Rawlins, and Benjamin Van Durme. 2016. Universal decompositional semantics on universal dependencies. In Proc. of the 2016 Conference on Empirical Methods in Natural Language Process- ing, pages 1713-1723.", |
| "links": null |
| }, |
| "BIBREF36": { |
| "ref_id": "b36", |
| "title": "UC Davis at SemEval-2019 Task 1: DAG semantic parsing with attention-based decoder", |
| "authors": [ |
| { |
| "first": "Dian", |
| "middle": [], |
| "last": "Yu", |
| "suffix": "" |
| }, |
| { |
| "first": "Kenju", |
| "middle": [], |
| "last": "Sagae", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proc. of SemEval-2019", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dian Yu and Kenju Sagae. 2019. UC Davis at SemEval-2019 Task 1: DAG semantic parsing with attention-based decoder. In Proc. of SemEval-2019.", |
| "links": null |
| }, |
| "BIBREF37": { |
| "ref_id": "b37", |
| "title": "Selective decoding for cross-lingual open information extraction", |
| "authors": [ |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Duh", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proc. of IJCNLP", |
| "volume": "", |
| "issue": "", |
| "pages": "832--842", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sheng Zhang, Kevin Duh, and Benjamin Van Durme. 2017. Selective decoding for cross-lingual open in- formation extraction. In Proc. of IJCNLP, pages 832-842.", |
| "links": null |
| }, |
| "BIBREF38": { |
| "ref_id": "b38", |
| "title": "Cross-lingual decompositional semantic parsing", |
| "authors": [ |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Xutai", |
| "middle": [], |
| "last": "Ma", |
| "suffix": "" |
| }, |
| { |
| "first": "Rachel", |
| "middle": [], |
| "last": "Rudinger", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Duh", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proc. of EMNLP", |
| "volume": "", |
| "issue": "", |
| "pages": "1664--1675", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sheng Zhang, Xutai Ma, Rachel Rudinger, Kevin Duh, and Benjamin Van Durme. 2018. Cross-lingual decompositional semantic parsing. In Proc. of EMNLP, pages 1664-1675.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "text": "An example UCCA graph.", |
| "type_str": "figure", |
| "num": null |
| }, |
| "FIGREF1": { |
| "uris": null, |
| "text": "UCCA example with an implicit unit.", |
| "type_str": "figure", |
| "num": null |
| }, |
| "FIGREF2": { |
| "uris": null, |
| "text": "Each system's labeled F1 per UCCA category in each track.", |
| "type_str": "figure", |
| "num": null |
| }, |
| "TABREF0": { |
| "text": "The complete set of categories in UCCA's foundational layer.", |
| "content": "<table/>", |
| "html": null, |
| "num": null, |
| "type_str": "table" |
| }, |
| "TABREF1": { |
| "text": "Data splits of the corpora used for the shared task.", |
| "content": "<table><tr><td/><td colspan=\"4\">En-Wiki En-20K Fr-20K De-20K</td></tr><tr><td># passages</td><td>367</td><td>154</td><td>154</td><td>367</td></tr><tr><td># sentences</td><td>5,141</td><td>492</td><td>492</td><td>6,514</td></tr><tr><td># tokens</td><td colspan=\"4\">158,739 12,638 13,021 144,529</td></tr><tr><td># non-terminals</td><td colspan=\"4\">62,002 4,699 5,110 51,934</td></tr><tr><td>% discontinuous</td><td>1.71</td><td>3.19</td><td>4.64</td><td>8.87</td></tr><tr><td>% reentrant</td><td>1.84</td><td>0.89</td><td>0.65</td><td>0.31</td></tr><tr><td># edges</td><td colspan=\"4\">208,937 16,803 17,520 187,533</td></tr><tr><td>% primary</td><td colspan=\"3\">97.40 96.79 97.02</td><td>97.32</td></tr><tr><td>% remote</td><td>2.60</td><td>3.21</td><td>2.98</td><td>2.68</td></tr><tr><td>by category</td><td/><td/><td/><td/></tr><tr><td>% Participant</td><td>17.17</td><td colspan=\"2\">18.1 17.08</td><td>19.86</td></tr><tr><td>% Center</td><td colspan=\"3\">18.74 16.31 18.03</td><td>14.32</td></tr><tr><td>% Adverbial</td><td>3.65</td><td>5.25</td><td>4.18</td><td>5.67</td></tr><tr><td>% Elaborator</td><td colspan=\"3\">18.98 18.06 18.65</td><td>14.88</td></tr><tr><td>% Function</td><td>3.38</td><td>3.58</td><td>2.58</td><td>2.98</td></tr><tr><td>% Ground</td><td>0.03</td><td>0.56</td><td>0.37</td><td>0.57</td></tr><tr><td>% Parallel Scene</td><td>6.02</td><td>6.3</td><td>6.15</td><td>7.54</td></tr><tr><td>% Linker</td><td>2.19</td><td>2.66</td><td>2.57</td><td>2.49</td></tr><tr><td>% Connector</td><td>1.26</td><td>0.93</td><td>0.84</td><td>0.65</td></tr><tr><td>% Process</td><td>7.1</td><td>7.51</td><td>6.91</td><td>7.03</td></tr><tr><td>% Relator</td><td>8.58</td><td>8.09</td><td>9.6</td><td>7.54</td></tr><tr><td>% State</td><td>1.62</td><td>2.1</td><td>1.88</td><td>3.34</td></tr><tr><td>% Punctuation</td><td colspan=\"3\">11.28 10.55 11.16</td><td>13.15</td></tr></table>", |
| "html": null, |
| "num": null, |
| "type_str": "table" |
| }, |
| "TABREF2": { |
| "text": "Statistics of the corpora used for the shared task.", |
| "content": "<table/>", |
| "html": null, |
| "num": null, |
| "type_str": "table" |
| }, |
| "TABREF4": { |
| "text": "", |
| "content": "<table/>", |
| "html": null, |
| "num": null, |
| "type_str": "table" |
| } |
| } |
| } |
| } |
