{ "paper_id": "2020", "header": { "generated_with": "S2ORC 1.0.0", "date_generated": "2023-01-19T01:18:43.323196Z" }, "title": "pyBART: Evidence-based Syntactic Transformations for IE", "authors": [ { "first": "Aryeh", "middle": [], "last": "Tiktinsky", "suffix": "", "affiliation": {}, "email": "aryeht@allenai.org" }, { "first": "Yoav", "middle": [], "last": "Goldberg", "suffix": "", "affiliation": {}, "email": "yoavg@allenai.org" }, { "first": "Reut", "middle": [], "last": "Tsarfaty", "suffix": "", "affiliation": {}, "email": "reutt@allenai.org" } ], "year": "", "venue": null, "identifiers": {}, "abstract": "Syntactic dependencies can be predicted with high accuracy, and are useful for both machine-learned and pattern-based information extraction tasks. However, their utility can be improved. These syntactic dependencies are designed to accurately reflect syntactic relations, and they do not make semantic relations explicit. Therefore, these representations lack many explicit connections between content words, that would be useful for downstream applications. Proposals like English Enhanced UD improve the situation by extending universal dependency trees with additional explicit arcs. However, they are not available to Python users, and are also limited in coverage. We introduce a broad-coverage, datadriven and linguistically sound set of transformations, that makes event-structure and many lexical relations explicit. We present pyBART, an easy-to-use open-source Python library for converting English UD trees either to Enhanced UD graphs or to our representation. The library can work as a standalone package or be integrated within a spaCy NLP pipeline. When evaluated in a pattern-based relation extraction scenario, our representation results in higher extraction scores than Enhanced UD, while requiring fewer patterns.", "pdf_parse": { "paper_id": "2020", "_pdf_hash": "", "abstract": [ { "text": "Syntactic dependencies can be predicted with high accuracy, and are useful for both machine-learned and pattern-based information extraction tasks. However, their utility can be improved. These syntactic dependencies are designed to accurately reflect syntactic relations, and they do not make semantic relations explicit. Therefore, these representations lack many explicit connections between content words, that would be useful for downstream applications. Proposals like English Enhanced UD improve the situation by extending universal dependency trees with additional explicit arcs. However, they are not available to Python users, and are also limited in coverage. We introduce a broad-coverage, datadriven and linguistically sound set of transformations, that makes event-structure and many lexical relations explicit. We present pyBART, an easy-to-use open-source Python library for converting English UD trees either to Enhanced UD graphs or to our representation. The library can work as a standalone package or be integrated within a spaCy NLP pipeline. When evaluated in a pattern-based relation extraction scenario, our representation results in higher extraction scores than Enhanced UD, while requiring fewer patterns.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Abstract", "sec_num": null } ], "body_text": [ { "text": "Owing to neural-based advances in parsing technology, NLP researchers and practitioners can now accurately produce syntactically-annotated corpora at scale. However, the use and empirical benefits of the dependency structures themselves remain limited. Basic syntactic dependencies encode the functional connections between words but lack many functional and semantic relations that exist between the content words in the sentence. Moreover, the use of strictly-syntactic relations results in structural diversity, undermining the efforts to effectively extract coherent semantic information from the resulting structures.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Thus, human practitioners and applications that \"consume\" these syntactic trees are required to devote substantial efforts to processing the trees in order to identify and extract the information needed for downstream applications, such as information and relation extraction (IE). Meanwhile, semantic representations (Banarescu et al., 2013; Palmer et al., 2010; Abend and Rappoport, 2013; Oepen et al., 2014) are harder to predict with sufficient accuracy, calling for a middle ground.", "cite_spans": [ { "start": 318, "end": 342, "text": "(Banarescu et al., 2013;", "ref_id": "BIBREF1" }, { "start": 343, "end": 363, "text": "Palmer et al., 2010;", "ref_id": "BIBREF10" }, { "start": 364, "end": 390, "text": "Abend and Rappoport, 2013;", "ref_id": "BIBREF0" }, { "start": 391, "end": 410, "text": "Oepen et al., 2014)", "ref_id": "BIBREF9" } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Indeed, De Marneffe and Manning (2008) introduced collapsed and propagated dependencies, in an attempt to make some semantic-like relations more apparent. The Universal Dependencies (UD) project 1 similarly embraces the concept of Enhanced Dependencies (Nivre et al., 2018) ), adding explicit relations that are otherwise left implicit. Schuster and Manning (2016) provide further enhancements targeted specifically at English (Enhanced UD). 2 Candito et al. (2017) suggest further enhancements to address diathesis alternations. 3 In this work we continue this line of thought, and take it a step further. We present pyBART, an 1 universaldepdenencies.org 2 In this paper we do not distinguish between the Universal Enhanced UD and Schuster and Manning (2016) 's En-hanced++ English UD. We refer to their union on English as Enhanced UD.", "cite_spans": [ { "start": 11, "end": 38, "text": "Marneffe and Manning (2008)", "ref_id": "BIBREF3" }, { "start": 253, "end": 273, "text": "(Nivre et al., 2018)", "ref_id": "BIBREF8" }, { "start": 337, "end": 364, "text": "Schuster and Manning (2016)", "ref_id": "BIBREF14" }, { "start": 442, "end": 443, "text": "2", "ref_id": null }, { "start": 444, "end": 465, "text": "Candito et al. (2017)", "ref_id": "BIBREF2" }, { "start": 530, "end": 531, "text": "3", "ref_id": null }, { "start": 733, "end": 760, "text": "Schuster and Manning (2016)", "ref_id": "BIBREF14" } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "3 Efforts such as PropS (Stanovsky et al., 2016) and Pred-Patt (White et al., 2016) , share our motivation of extracting predicate-argument structures from treebank-trainable trees, though outside of the UD framework. Efforts such as KNext (Durme and Schubert, 2008) automatically extract logic-based forms by converting treebank-trainable trees, for consumption by further processing. HLF (Rudinger and Van Durme, 2014) , DepLambda (Reddy et al., 2016) and UDepLambda (Reddy et al., 2017) attempt to provide a formal semantic representation by converting dependency structures to logical forms. While they share a high-level goal with ours -exposing functional relations in a sentence in a unified way -their end result, logical forms, is substantially different from pyBART structures. While providing substantial benefits for semantic parsing applications, logical forms are less readable for non-experts than labeled relations between content words. As these efforts rely on dependency trees as a backbone, they could potentially benefit from py-BART's focus on syntactic enhancements on top of (E)UD. easy-to-use Python library which converts English UD trees to a new representation that subsumes the English Enhanced UD representation and substantially extends it. We designed the representation to be linguistically sound and automatically recoverable from the syntactic structure, while exposing the kinds of relations required by IE applications. Some of these modifications are illustrated in Figure 1 . 4 We aim to make event structure explicit, and cover as many linguistically plausible phenomena as possible. We term our representation BART (The BIU-AI2 Representation Transformation).", "cite_spans": [ { "start": 24, "end": 48, "text": "(Stanovsky et al., 2016)", "ref_id": "BIBREF16" }, { "start": 53, "end": 83, "text": "Pred-Patt (White et al., 2016)", "ref_id": null }, { "start": 240, "end": 266, "text": "(Durme and Schubert, 2008)", "ref_id": "BIBREF4" }, { "start": 390, "end": 420, "text": "(Rudinger and Van Durme, 2014)", "ref_id": "BIBREF13" }, { "start": 433, "end": 453, "text": "(Reddy et al., 2016)", "ref_id": "BIBREF11" }, { "start": 469, "end": 489, "text": "(Reddy et al., 2017)", "ref_id": "BIBREF12" }, { "start": 1515, "end": 1516, "text": "4", "ref_id": null } ], "ref_spans": [ { "start": 1504, "end": 1512, "text": "Figure 1", "ref_id": null } ], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "To assess the benefits of BART with respect to UD and other enhancements, we compare them in the context of a pattern-based relation extraction task, and demonstrate that BART achieves higher F 1 scores while requiring fewer patterns.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "The python conversion library, pyBART, integrates with the spaCy 5 library, and is available under an open-source Apache license. A web-based demo for experimenting with the converter is also available. https://allenai.github.io/ pybart/.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "We aim to provide a representation that will be useful for downstream NLP tasks, while retaining the following key properties. The proposal has to be (i) based on syntactic structure and (ii) useful for information seeking applications. As a consequence of (ii), we also want it to (iii) make event structure explicit and (iv) allow favoring recall over precision.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The BART Representation", "sec_num": "2" }, { "text": "Being based on syntax as the backbone would allow us to capitalize on independent advances in syntactic parsing, and on its relative domain independence. We want our representation to be not only accurate but also useful for information seeking applications. This suggests a concrete methodology ( \u00a72.1) and evaluation criteria ( \u00a75): we choose which relations to focus on based on concrete cases attested in relation extraction and QA-corpora, and evaluate the proposal based on the usefulness in a relation extraction task.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The BART Representation", "sec_num": "2" }, { "text": "In general, information-seeking applications favor making events explicit. Current syntactic representations prefer to assign syntactic heads as root predicates, rather than actual eventive verb. In contrast, we aim to center our representation around the main event predicate in the sentence, while indicating event properties such as aspectuality (Sam started walking) or evidentiality (Sam seems to like them) as modifiers of rather than heads. To do this in a consistent manner, we introduce a new node of type STATE for copular sentences, making their event structure parallel to those containing finite eventive verbs ( \u00a74.4)", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The BART Representation", "sec_num": "2" }, { "text": "Finally, downstream users may prefer to favor recall over precision in some cases. To allow for this, we depart from previous efforts that refrain from providing any uncertain information. We chose to explicitly expose some relations which we believe to be useful but judge to be uncertain, while clearly marking their uncertainty in the output. This allows users to experiment with the different cases and assess the reliability of the specific constructions in their own application domain. We introduce two uncertainty marking mechanisms, discussed in \u00a72.3.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The BART Representation", "sec_num": "2" }, { "text": "Our departure point is the English EUD representation (Schuster and Manning, 2016) and related efforts discussed above, which we seek to extend in a way which is useful to information seeking applications. To identify relevant constructions that are not covered by current representations, we use a data-driven process. We consider concrete relations that are expressed in annotated task-based corpora: a relation extraction dataset (ACE05, (Walker et al., 2006) ), which annotates relations and events, and a QA-SRL dataset (He et al., 2015) which connects predicates to sentence segments that are perceived by people as their (possibly implied) arguments. For each of these corpora, we consider the dependency paths between the annotated elements, looking for cases where a direct relation in the corpus corresponds to an indirect dependency path in the syntactic graph. We identify recurring cases that we think can be shortened, and which can be justified linguistically and empirically. We then come up with proposed enhancements and modifications, and verify them empirically against a larger corpus by extracting cases that match the corresponding patterns and browsing the results.", "cite_spans": [ { "start": 54, "end": 82, "text": "(Schuster and Manning, 2016)", "ref_id": "BIBREF14" }, { "start": 441, "end": 462, "text": "(Walker et al., 2006)", "ref_id": "BIBREF18" }, { "start": 525, "end": 542, "text": "(He et al., 2015)", "ref_id": "BIBREF6" } ], "ref_spans": [], "eq_spans": [], "section": "Data-driven Methodology", "sec_num": "2.1" }, { "text": "As is common in dependency-based representations, BART structures are labeled, directed multi-graphs whose nodes are the words of a sentence, and the labeled edges indicate the relations between them. Some constructions add additional nodes, such as copy-nodes (Schuster and Manning, 2016) and STATE nodes ( \u00a74.4).", "cite_spans": [ { "start": 261, "end": 289, "text": "(Schuster and Manning, 2016)", "ref_id": "BIBREF14" } ], "ref_spans": [], "eq_spans": [], "section": "Formal Structure", "sec_num": "2.2" }, { "text": "An innovative aspect of our approach is that each edge is associated with additional information beyond its dependency label. This information is structured as follows: SRC: a field indicating the origin of this edgeeither \"UD\" for the original dependency edges, or a pair indicating the type and sub-type of the construction that resulted in the BART edge (e.g., {SRC=(conj,and)} or {SRC=(adv,while)}). UNC, ALT: optional fields indicating uncertainty, described below.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Formal Structure", "sec_num": "2.2" }, { "text": "Some syntactic constructions are ambiguous with respect to the ability to propagate information through them. Rather than giving up on all ambiguous constructions, we opted to generate the edges and mark them with an UNC=TRUE flag, deferring the decision regarding the validity of the edge to the user: 1 # Load a UD-based english model 2 nlp = spacy.load(\"en_ud_model\") 3 4 # Add BART converter to spaCy's pipeline 5 from pybart.api import converter 6 converter = converter( ... ) 7 nlp.add_pipe(converter, name=\"BART\") 8 9 # Test the new converter component 10 doc = nlp(\"He saw me while driving\") 11 me_token = doc [2] 12 for par_tok in me_token._.parent_list: In some cases, we can identify that one of two options is possible, but cannot determine which. In these cases we report both edges, but mark them explicitly as alternatives to each other. This is achieved with an ALT=X field on both edges, with X being a number indicating the pair. 3 Python code and Web-demo", "cite_spans": [ { "start": 618, "end": 621, "text": "[2]", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Embracing uncertainty", "sec_num": "2.3" }, { "text": "The pyBART library provides a Python converter from English UD trees to BART. pyBART subsumes the enhancements of the EUD Java implementation provided in Stanford Core-NLP, 6 and extends them as described in \u00a74. While py-BART's default performs all enhancements, it can be configured to follow a more selective behavior. pyBART has two modes: (1) a converter from CoNLLU-formatted UD trees to CoNLLUformatted BART structures; 7 and (2) a spaCy (Honnibal and Montani, 2017) pipeline component. 8 After registering pyBART as a spaCy pipeline, tokens on the analyzed document will have a . .parent list field, containing the list of parents of the token in the BART structure. Each item is a dictionary specifying-in addition to the parent-token id and dependency label-also the extra information described in \u00a72.2. See Figure 2 for an illustration of the API.", "cite_spans": [ { "start": 444, "end": 472, "text": "(Honnibal and Montani, 2017)", "ref_id": null }, { "start": 493, "end": 494, "text": "8", "ref_id": null } ], "ref_spans": [ { "start": 817, "end": 826, "text": "Figure 2", "ref_id": null } ], "eq_spans": [], "section": "Embracing uncertainty", "sec_num": "2.3" }, { "text": "A web-based demo that parses sentences into both EUD and BART graphs, visualizes them, and compares their outputs, is also provided. 9", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Embracing uncertainty", "sec_num": "2.3" }, { "text": "BART conversion consists of four conceptual changes from basic UD. The first type propagates shared arguments between predicates in nested structures. The second type shares arguments between parallel structures. The third type attempts to unify syntactic alternations to reduce diversity, making structures that carry similar meaning also similar in structure. Finally, the forth type is designed to make event structure explicit in the syntactic representation, allowing finite verbs that indicate event properties to act as event modifiers rather than root predicates. In accordance with that, we further introduce a new STATE node, that acts as the main predicate node for stative (copular, verb-less) sentences.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Coverage of Linguistic Phenomena", "sec_num": "4" }, { "text": "Our first type of conversions propagates an external core argument to be explicitly linked as the subject of a subordinate clause. Complement control: The various EUD representations explicitly indicate the external subjects of xcomp clauses containing a to marker. We embrace this choice and extend it to cover also clauses without a to marker, including imperative clauses and clauses with controlled gerunds.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Nested Structures", "sec_num": "4.1" }, { "text": "(1)", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Nested Structures", "sec_num": "4.1" }, { "text": "xcomp Noun-modifying clauses: Similarly, EUD links the empty subject of a finite relative clause to the corresponding argument of the external clause. We extend this behavior to also cover reduced relative clauses (2a), and we follow Candito et al. (2017) in also including other relative clauses such as noun-modifying participles (2b).", "cite_spans": [ { "start": 234, "end": 255, "text": "Candito et al. (2017)", "ref_id": "BIBREF2" } ], "ref_spans": [], "eq_spans": [], "section": "Let my people go! nsubj dobj", "sec_num": null }, { "text": "(2) a.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Let my people go! nsubj dobj", "sec_num": null }, { "text": "b.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Let my people go! nsubj dobj", "sec_num": null }, { "text": "The neon god they made A vision softly creeping dobj nsubj 9 The dependency graph visualization component uses the TextAnnotationGraphs (TAG) library (Forbes et al., 2018) .", "cite_spans": [ { "start": 59, "end": 60, "text": "9", "ref_id": null }, { "start": 150, "end": 171, "text": "(Forbes et al., 2018)", "ref_id": "BIBREF5" } ], "ref_spans": [], "eq_spans": [], "section": "Let my people go! nsubj dobj", "sec_num": null }, { "text": "Adverbial clauses and \"dep\": Adverbial modifier clauses that miss a subject, often modify the subject of the main clause. We propagate the external subject to be the subject of the internal clause. 10 (3) You shouldn't text while driving nsubj We observe that many dep edges empirically behave like adverbial clauses, and treat them similarly. We mark these edges as \"uncertain\".", "cite_spans": [ { "start": 198, "end": 200, "text": "10", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Let my people go! nsubj dobj", "sec_num": null }, { "text": "The second type of conversions identifies parallel structures in which the latter instance is elliptical, and share the missing core argument contributed by the former instance. Apposition: Similarly to the PropS proposal (Stanovsky et al., 2016) , we share relations across apposition parts, making the two, currently hierarchical, phrase, more duplicate-like.", "cite_spans": [ { "start": 222, "end": 246, "text": "(Stanovsky et al., 2016)", "ref_id": "BIBREF16" } ], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "(4) E.T., the Extraterrestrial, phones home nsubj nsubj appos Modifiers in conjunction: In modified coordinated constructions, we share prepositional (5) and possessive (6) modifiers between the coordinated parts. Since dependency trees are inherently ambiguous between conjoined modification and single-conjunt modification, (e.g, compare (5) to \"Mogly was lost and raised by wolves\", or (6) to \"my Father and E.T.\"), we mark both as UNC. Elaboration/Specification Clauses: For noun nominal modifiers that have the form of an elaboration or specification, we share the head of the modified noun with its dependent modifier. That is, if the modification is marked by like or such as prepositions, we propagate the head noun to the nominal dependent. 7I enjoy fruits such as apples dobj dobj Indexicals: the interpretation of locative and temporal indexicals such as here, there and now depends on the situation and the speaker, and often modify not only the predicate but the entire situation. We therefore share the adverbial modification from the noun to the main verb. Due to their situation-specific nature, we mark these as UNC. 8He wonders in these woods here advmod(UNC) nmod advmod", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "Compounds: Shwartz and Waterson (2018) show that in many cases, compounds can be seen as having a multiple-head. Therefore, we share the existing relations across the compound parts.", "cite_spans": [ { "start": 11, "end": 38, "text": "Shwartz and Waterson (2018)", "ref_id": "BIBREF15" } ], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "I used canola oil", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "dobj(UNC) dobj", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "As many compounds do have a clear head (e.g. I used baby oil, where baby is clearly not the head), we mark these as uncertain.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Parallel structures", "sec_num": "4.2" }, { "text": "This type of conversions aim to unify syntactic variability. We identify structures that are syntactically different but share (some) semantic structure, and add arcs or nodes to expose the similarity. The Passivization Alternation: Following Candito et al. (2017) we relate the passive alteration to its active variant.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Syntactic Alternations", "sec_num": "4.3" }, { "text": "The Sheriff was shot by Bob nsubj dobj nsubjpass nmod:by", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Syntactic Alternations", "sec_num": "4.3" }, { "text": "Hyphen reconstruction: Noun-verb Hyphen Constructions (HC) which are modifying a nominal can be seen as conveying the same information as a copular sentence wherein the noun is the subject and the verb is the predicate. To explicitly indicate this, we add to all modifying noun-verb HCs a subject and a modifier relation originating at the verb-part of the HC. Adjectival modifiers: Adjectival modification can be viewed as capturing the same information as a predicative copular sentence conveying the same meaning (so, \"a green apple\" implies that \"an apple is green\"). To explicitly capture this productive implication, we add a subject relation from each adjectival modifier to its corresponding modified noun. 12I see dead people nsubj Genitive Constructions: Genitive cases can be alternatively expressed as a compound. We add a compound relation to unify the expression of genitives across X of Y and compound structures. 13Army of zombies compound 4.4 Event-Centered Representations In many sentences, the finite root predicate does not indicate the main event. Instead, a verb in the subordinated clause expresses the event, and the finite verb acts as its modifier. For example, in sentences like \"He started working\", \"He seems to work there\", the main event indicated is \"work\", while the root predicates (\"started\", \"seemed\") modify this event. Here, we present a chain of changes that puts emphasis on events by delegating copular and tense auxiliaries (is, was), evidentials (seem, say) and various aspectual verbs (started, continued) to be clausal modifiers, rather than heads of the sentence. This creates a further challenge, since there is a prevalent discrepancy between predicative sentences such as \"He works\" and copular sentences as \"He is smart\". The UD structure for the latter lacks a node that clearly indicates a stative event (in Vendler (1957) 's terminology). We remedy this by adding a node to represent the STATE and have tense, aspect, modality and evidentiality directly modifying it. 11 Copular Sentences and Stative Predicates: We added to all copula constructions new node named STATE, which represents the stative event introduced by the copular clause. This node becomes the root, and we rewire the entire clause around this STATE. By doing so we unify it with the structures of clauses with finite predicative. Once we added the STATE node, we form a new relation, termed ev, to mark event/state modifications. The resulting structure is as follows: Evidential reconstructions: We can now explicitly mark properties of events as dependents of the verbal or stative root by means of the label ev. We do so, using verbs' white-lists, for verbs marking evidentiality (15) and for reported-speech (16). Aspectual constructions: Finally, we can now also mark aspectual verbs as modifying the complement (matrix) verb denoting the main event. The complement (matrix) verb becomes the root of the dependency structure, and we add the new ev relation to mark the aspectual modification of the event.", "cite_spans": [ { "start": 1861, "end": 1875, "text": "Vendler (1957)", "ref_id": "BIBREF17" } ], "ref_spans": [], "eq_spans": [], "section": "Syntactic Alternations", "sec_num": "4.3" }, { "text": "He started talking funny nsubj ev nsubj xcomp", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Syntactic Alternations", "sec_num": "4.3" }, { "text": "Our proposed representation attempts to target information-seeking applications, but is it effective? We evaluate the resulting graph structures against the UD and Enhanced UD representations, in the context of a relation-extraction (RE) task. Concretely, we evaluate the representations on their ability to perform pattern-based RE on the TACRED dataset (Zhang et al., 2017) . We use an automated and reproducible methodology: for each of the representations, we use the RE train-set to acquire extraction patterns. We then apply the patterns to the dev-set, compute F1-scores, and, for each relation, filter the patterns that hurt F1-score. We then apply the filtered pattern-set to the test-set, and report F1 scores.", "cite_spans": [ { "start": 355, "end": 375, "text": "(Zhang et al., 2017)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Evaluation", "sec_num": "5" }, { "text": "To acquire extraction patterns, we use the following procedure: given a labeled sentence consisting of a relation name and the sentence indices of the two entities participating in the relation, we compute the shortest dependency path between the entities, ignoring edge directions. We then form an extraction pattern from the directed edges on this path. We consult a list of trigger words (Yu et al., 2015) collected for the different relations. If a trigger word or its lemma is found on the path, we form an unlexicalized path except for the trigger word (i.e. E1 dobj >compound E2). If no trigger-word is found, the path is lexicalized with the word's lemmas (i.e. E1 dobj \"activity\" >compound E2). We use this procedure to compare UD, Enhanced UD (EUD), BART without EUD enhancements, and full BART, which is a superset of Enhanced UD (Table 1) . BART achieves a substantially higher F1 score of 49.15%, an increase of 5.5 F1 points over UD, and 3.5 F1 points above Enhanced UD. It does so by substantially improving recall while somewhat decreasing precision.", "cite_spans": [ { "start": 391, "end": 408, "text": "(Yu et al., 2015)", "ref_id": "BIBREF20" } ], "ref_spans": [ { "start": 876, "end": 885, "text": "(Table 1)", "ref_id": "TABREF3" } ], "eq_spans": [], "section": "Evaluation", "sec_num": "5" }, { "text": "Recall F1 UD", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Representation Precision", "sec_num": null }, { "text": "We also consider economy: the number of different patterns needed to achieve a given recall level. Figure 3 plots the achieved recall against the number of patterns. As the curves show, Enhanced UD is more economic than UD, and our representation is substantially more economic than both. To achieve 30.7% recall (the maximal recall of UD), UD requires 112 patterns, EUD requires 77 patterns, while BART needed only 52 patterns.", "cite_spans": [], "ref_spans": [ { "start": 99, "end": 107, "text": "Figure 3", "ref_id": "FIGREF5" } ], "eq_spans": [], "section": "Representation Precision", "sec_num": null }, { "text": "We propose a syntax-based representation that aims to make the event structure and as many lexical relations as possible explicit, for the benefit of downstream information-seeking applications. We provide a Python API that converts UD trees to this representation, and demonstrate its empirical benefits on a relation extraction task. The following are additional examples that we could not fit into the space constraints of the paper.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Conclusion", "sec_num": "6" }, { "text": "Complement control Example (1) shows an example of linking the external subject to a controlled finite verb. The following complementary example shows linking the subject to a controlled gerund: Elaboration/Specification Clauses Example (7) shows a specification clause connected as an object to the root. The following is a complementary example of using the like elaboration-preposition, in which the modifier noun is a subject dependant of its head. The modified noun inherits the subject relation from its modifier head. ", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Conclusion", "sec_num": "6" }, { "text": "Some preserved UD relations are omitted for readability. 5 https://spacy.io", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "", "sec_num": null }, { "text": "https://nlp.stanford.edu/software/ stanford-dependencies.html 7 The extra edge information is linearized into the dependency label after a '@' separator.8 This requires a spaCy model trained to produce UD trees, which we provide.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "", "sec_num": null }, { "text": "In external clauses that include a subject and an object, ambiguity may arise as to which is to be modified. We propagate both and mark the edges as alternates (ALT, ( \u00a72.3)).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "", "sec_num": null }, { "text": "Pragmatically, some users prefer to not have non-word nodes. pyBART supports this by providing a mode that treats the copula as the head, retaining the other modifications.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "", "sec_num": null } ], "back_matter": [ { "text": "This project has received funding from the European Research Council (ERC) under the European Union's Horizon2020 research and innovation programme, grant agreement 802774 (iEX-TRACT) and grant agreement 677352 (NLPRO).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Acknowledgements", "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": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics", "volume": "1", "issue": "", "pages": "228--238", "other_ids": {}, "num": null, "urls": [], "raw_text": "Omri Abend and Ari Rappoport. 2013. Universal con- ceptual cognitive annotation (ucca). In Proceed- ings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Pa- pers), pages 228-238.", "links": null }, "BIBREF1": { "ref_id": "b1", "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": "Philipp", "middle": [], "last": "Koehn", "suffix": "" }, { "first": "Martha", "middle": [], "last": "Palmer", "suffix": "" }, { "first": "Nathan", "middle": [], "last": "Schneider", "suffix": "" } ], "year": 2013, "venue": "Proceedings of the 7th linguistic annotation workshop and interoperability with discourse", "volume": "", "issue": "", "pages": "178--186", "other_ids": {}, "num": null, "urls": [], "raw_text": "Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer, and Nathan Schneider. 2013. Abstract meaning representation for sembanking. In Proceedings of the 7th linguistic annotation workshop and interoperability with dis- course, pages 178-186.", "links": null }, "BIBREF2": { "ref_id": "b2", "title": "Enhanced UD dependencies with neutralized diathesis alternation", "authors": [ { "first": "Marie", "middle": [], "last": "Candito", "suffix": "" }, { "first": "Bruno", "middle": [], "last": "Guillaume", "suffix": "" }, { "first": "Guy", "middle": [], "last": "Perrier", "suffix": "" }, { "first": "Djam\u00e9", "middle": [], "last": "Seddah", "suffix": "" } ], "year": 2017, "venue": "Proceedings of the Fourth International Conference on Dependency Linguistics", "volume": "", "issue": "", "pages": "42--53", "other_ids": {}, "num": null, "urls": [], "raw_text": "Marie Candito, Bruno Guillaume, Guy Perrier, and Djam\u00e9 Seddah. 2017. Enhanced UD dependencies with neutralized diathesis alternation. In Proceed- ings of the Fourth International Conference on De- pendency Linguistics (Depling 2017), pages 42-53, Pisa,Italy. Link\u00f6ping University Electronic Press.", "links": null }, "BIBREF3": { "ref_id": "b3", "title": "Stanford typed dependencies manual", "authors": [ { "first": "Marie-Catherine De", "middle": [], "last": "Marneffe", "suffix": "" }, { "first": "Christopher D", "middle": [], "last": "Manning", "suffix": "" } ], "year": 2008, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Marie-Catherine De Marneffe and Christopher D Man- ning. 2008. Stanford typed dependencies manual. Technical report, Technical report, Stanford Univer- sity.", "links": null }, "BIBREF4": { "ref_id": "b4", "title": "Open knowledge extraction through compositional language processing", "authors": [ { "first": "Benjamin", "middle": [], "last": "Durme", "suffix": "" }, { "first": "Lenhart", "middle": [], "last": "Schubert", "suffix": "" } ], "year": 2008, "venue": "Proceedings of the 2008 Conference on Semantics in Text Processing", "volume": "", "issue": "", "pages": "", "other_ids": { "DOI": [ "10.3115/1626481.1626500" ] }, "num": null, "urls": [], "raw_text": "Benjamin Durme and Lenhart Schubert. 2008. Open knowledge extraction through compositional lan- guage processing. Proceedings of the 2008 Confer- ence on Semantics in Text Processing.", "links": null }, "BIBREF5": { "ref_id": "b5", "title": "Text annotation graphs: Annotating complex natural language phenomena", "authors": [ { "first": "Angus", "middle": [], "last": "Forbes", "suffix": "" }, { "first": "Kristine", "middle": [], "last": "Lee", "suffix": "" }, { "first": "Gus", "middle": [], "last": "Hahn-Powell", "suffix": "" }, { "first": "Marco", "middle": [ "A" ], "last": "Valenzuela-Escrcega", "suffix": "" }, { "first": "Mihai", "middle": [], "last": "Surdeanu", "suffix": "" } ], "year": 2018, "venue": "Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC'18)", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Angus Forbes, Kristine Lee, Gus Hahn-Powell, Marco A. Valenzuela-Escrcega, and Mihai Sur- deanu. 2018. Text annotation graphs: Annotat- ing complex natural language phenomena. In Pro- ceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC'18), Miyazaki, Japan. European Language Resources Association (ELRA).", "links": null }, "BIBREF6": { "ref_id": "b6", "title": "Question-answer driven semantic role labeling: Using natural language to annotate natural language", "authors": [ { "first": "Luheng", "middle": [], "last": "He", "suffix": "" }, { "first": "Mike", "middle": [], "last": "Lewis", "suffix": "" }, { "first": "Luke", "middle": [], "last": "Zettlemoyer", "suffix": "" } ], "year": 2015, "venue": "Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing", "volume": "", "issue": "", "pages": "643--653", "other_ids": { "DOI": [ "10.18653/v1/D15-1076" ] }, "num": null, "urls": [], "raw_text": "Luheng He, Mike Lewis, and Luke Zettlemoyer. 2015. Question-answer driven semantic role labeling: Us- ing natural language to annotate natural language. In Proceedings of the 2015 Conference on Empiri- cal Methods in Natural Language Processing, pages 643-653, Lisbon, Portugal. Association for Compu- tational Linguistics.", "links": null }, "BIBREF7": { "ref_id": "b7", "title": "2017. spaCy 2: Natural language understanding with Bloom embeddings, convolutional neural networks and incremental parsing", "authors": [ { "first": "Matthew", "middle": [], "last": "Honnibal", "suffix": "" }, { "first": "Ines", "middle": [], "last": "Montani", "suffix": "" } ], "year": null, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Matthew Honnibal and Ines Montani. 2017. spaCy 2: Natural language understanding with Bloom embed- dings, convolutional neural networks and incremen- tal parsing. To appear.", "links": null }, "BIBREF8": { "ref_id": "b8", "title": "Enhancing universal dependency treebanks: A case study", "authors": [ { "first": "Joakim", "middle": [], "last": "Nivre", "suffix": "" }, { "first": "Paola", "middle": [], "last": "Marongiu", "suffix": "" }, { "first": "Filip", "middle": [], "last": "Ginter", "suffix": "" }, { "first": "Jenna", "middle": [], "last": "Kanerva", "suffix": "" }, { "first": "Simonetta", "middle": [], "last": "Montemagni", "suffix": "" }, { "first": "Sebastian", "middle": [], "last": "Schuster", "suffix": "" }, { "first": "Maria", "middle": [], "last": "Simi", "suffix": "" } ], "year": 2018, "venue": "Proceedings of the Second Workshop on Universal Dependencies (UDW 2018)", "volume": "", "issue": "", "pages": "102--107", "other_ids": { "DOI": [ "10.18653/v1/W18-6012" ] }, "num": null, "urls": [], "raw_text": "Joakim Nivre, Paola Marongiu, Filip Ginter, Jenna Kanerva, Simonetta Montemagni, Sebastian Schus- ter, and Maria Simi. 2018. Enhancing universal de- pendency treebanks: A case study. In Proceedings of the Second Workshop on Universal Dependencies (UDW 2018), pages 102-107, Brussels, Belgium. Association for Computational Linguistics.", "links": null }, "BIBREF9": { "ref_id": "b9", "title": "SemEval 2014 task 8: 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": "Dan", "middle": [], "last": "Flickinger", "suffix": "" }, { "first": "Jan", "middle": [], "last": "Haji\u010d", "suffix": "" }, { "first": "Angelina", "middle": [], "last": "Ivanova", "suffix": "" }, { "first": "Yi", "middle": [], "last": "Zhang", "suffix": "" } ], "year": 2014, "venue": "Proceedings of the 8th International Workshop on Semantic Evaluation", "volume": "", "issue": "", "pages": "63--72", "other_ids": { "DOI": [ "10.3115/v1/S14-2008" ] }, "num": null, "urls": [], "raw_text": "Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Dan Flickinger, Jan Haji\u010d, Angelina Ivanova, and Yi Zhang. 2014. SemEval 2014 task 8: Broad-coverage semantic dependency parsing. In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014), pages 63-72, Dublin, Ireland. Association for Computational Lin- guistics.", "links": null }, "BIBREF10": { "ref_id": "b10", "title": "Semantic role labeling", "authors": [ { "first": "Martha", "middle": [], "last": "Palmer", "suffix": "" }, { "first": "Daniel", "middle": [], "last": "Gildea", "suffix": "" }, { "first": "Nianwen", "middle": [], "last": "Xue", "suffix": "" } ], "year": 2010, "venue": "Synthesis Lectures on Human Language Technologies", "volume": "3", "issue": "1", "pages": "1--103", "other_ids": {}, "num": null, "urls": [], "raw_text": "Martha Palmer, Daniel Gildea, and Nianwen Xue. 2010. Semantic role labeling. Synthesis Lectures on Human Language Technologies, 3(1):1-103.", "links": null }, "BIBREF11": { "ref_id": "b11", "title": "Transforming dependency structures to logical forms for semantic parsing", "authors": [ { "first": "Siva", "middle": [], "last": "Reddy", "suffix": "" }, { "first": "Oscar", "middle": [], "last": "T\u00e4ckstr\u00f6m", "suffix": "" }, { "first": "Michael", "middle": [], "last": "Collins", "suffix": "" }, { "first": "Tom", "middle": [], "last": "Kwiatkowski", "suffix": "" }, { "first": "Dipanjan", "middle": [], "last": "Das", "suffix": "" }, { "first": "Mark", "middle": [], "last": "Steedman", "suffix": "" }, { "first": "Mirella", "middle": [], "last": "Lapata", "suffix": "" } ], "year": 2016, "venue": "Transactions of the Association for Computational Linguistics", "volume": "4", "issue": "", "pages": "127--140", "other_ids": { "DOI": [ "10.1162/tacl_a_00088" ] }, "num": null, "urls": [], "raw_text": "Siva Reddy, Oscar T\u00e4ckstr\u00f6m, Michael Collins, Tom Kwiatkowski, Dipanjan Das, Mark Steedman, and Mirella Lapata. 2016. Transforming dependency structures to logical forms for semantic parsing. Transactions of the Association for Computational Linguistics, 4:127-140.", "links": null }, "BIBREF12": { "ref_id": "b12", "title": "Mark Steedman, and Mirella Lapata", "authors": [ { "first": "Siva", "middle": [], "last": "Reddy", "suffix": "" }, { "first": "Oscar", "middle": [], "last": "Tckstrm", "suffix": "" }, { "first": "Slav", "middle": [], "last": "Petrov", "suffix": "" } ], "year": 2017, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Siva Reddy, Oscar Tckstrm, Slav Petrov, Mark Steed- man, and Mirella Lapata. 2017. Universal semantic parsing.", "links": null }, "BIBREF13": { "ref_id": "b13", "title": "Is the Stanford dependency representation semantic?", "authors": [ { "first": "Rachel", "middle": [], "last": "Rudinger", "suffix": "" }, { "first": "Benjamin", "middle": [], "last": "Van Durme", "suffix": "" } ], "year": 2014, "venue": "Proceedings of the Second Workshop on EVENTS: Definition, Detection, Coreference, and Representation", "volume": "", "issue": "", "pages": "54--58", "other_ids": { "DOI": [ "10.3115/v1/W14-2908" ] }, "num": null, "urls": [], "raw_text": "Rachel Rudinger and Benjamin Van Durme. 2014. Is the Stanford dependency representation seman- tic? In Proceedings of the Second Workshop on EVENTS: Definition, Detection, Coreference, and Representation, pages 54-58, Baltimore, Maryland, USA. Association for Computational Linguistics.", "links": null }, "BIBREF14": { "ref_id": "b14", "title": "Enhanced english universal dependencies: An improved representation for natural language understanding tasks", "authors": [ { "first": "Sebastian", "middle": [], "last": "Schuster", "suffix": "" }, { "first": "D", "middle": [], "last": "Christopher", "suffix": "" }, { "first": "", "middle": [], "last": "Manning", "suffix": "" } ], "year": 2016, "venue": "Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16)", "volume": "", "issue": "", "pages": "2371--2378", "other_ids": {}, "num": null, "urls": [], "raw_text": "Sebastian Schuster and Christopher D Manning. 2016. Enhanced english universal dependencies: An im- proved representation for natural language under- standing tasks. In Proceedings of the Tenth Interna- tional Conference on Language Resources and Eval- uation (LREC'16), pages 2371-2378.", "links": null }, "BIBREF15": { "ref_id": "b15", "title": "Olive oil is made of olives, baby oil is made for babies: Interpreting noun compounds using paraphrases in a neural model", "authors": [ { "first": "Vered", "middle": [], "last": "Shwartz", "suffix": "" }, { "first": "Chris", "middle": [], "last": "Waterson", "suffix": "" } ], "year": 2018, "venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", "volume": "2", "issue": "", "pages": "218--224", "other_ids": { "DOI": [ "10.18653/v1/N18-2035" ] }, "num": null, "urls": [], "raw_text": "Vered Shwartz and Chris Waterson. 2018. Olive oil is made of olives, baby oil is made for babies: Inter- preting noun compounds using paraphrases in a neu- ral model. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies, Volume 2 (Short Papers), pages 218-224, New Orleans, Louisiana. Association for Computa- tional Linguistics.", "links": null }, "BIBREF16": { "ref_id": "b16", "title": "Getting more out of syntax with props", "authors": [ { "first": "Gabriel", "middle": [], "last": "Stanovsky", "suffix": "" }, { "first": "Jessica", "middle": [], "last": "Ficler", "suffix": "" }, { "first": "Ido", "middle": [], "last": "Dagan", "suffix": "" }, { "first": "Yoav", "middle": [], "last": "Goldberg", "suffix": "" } ], "year": 2016, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": { "arXiv": [ "arXiv:1603.01648" ] }, "num": null, "urls": [], "raw_text": "Gabriel Stanovsky, Jessica Ficler, Ido Dagan, and Yoav Goldberg. 2016. Getting more out of syntax with props. arXiv preprint arXiv:1603.01648.", "links": null }, "BIBREF17": { "ref_id": "b17", "title": "Verbs and times. The Philosophical Review", "authors": [ { "first": "Zeno", "middle": [], "last": "Vendler", "suffix": "" } ], "year": 1957, "venue": "", "volume": "66", "issue": "", "pages": "143--160", "other_ids": {}, "num": null, "urls": [], "raw_text": "Zeno Vendler. 1957. Verbs and times. The Philosophi- cal Review, 66(2):143-160.", "links": null }, "BIBREF18": { "ref_id": "b18", "title": "Ace 2005 multilingual training corpus. Linguistic Data Consortium", "authors": [ { "first": "Christopher", "middle": [], "last": "Walker", "suffix": "" }, { "first": "Stephanie", "middle": [], "last": "Strassel", "suffix": "" }, { "first": "Julie", "middle": [], "last": "Medero", "suffix": "" }, { "first": "Kazuaki", "middle": [], "last": "Maeda", "suffix": "" } ], "year": 2006, "venue": "", "volume": "", "issue": "", "pages": "2006--2012", "other_ids": {}, "num": null, "urls": [], "raw_text": "Christopher Walker, Stephanie Strassel, Julie Medero, and Kazuaki Maeda. 2006. Ace 2005 multilin- gual training corpus. Linguistic Data Consortium, Philadelphia, LDC2006T06.", "links": null }, "BIBREF19": { "ref_id": "b19", "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": "Proceedings 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 Proceedings of the 2016 Con- ference on Empirical Methods in Natural Language Processing, pages 1713-1723, Austin, Texas. Asso- ciation for Computational Linguistics.", "links": null }, "BIBREF20": { "ref_id": "b20", "title": "Why read if you can scan? trigger scoping strategy for biographical fact extraction", "authors": [ { "first": "Dian", "middle": [], "last": "Yu", "suffix": "" }, { "first": "Heng", "middle": [], "last": "Ji", "suffix": "" }, { "first": "Sujian", "middle": [], "last": "Li", "suffix": "" }, { "first": "Chin-Yew", "middle": [], "last": "Lin", "suffix": "" } ], "year": 2015, "venue": "Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", "volume": "", "issue": "", "pages": "1203--1208", "other_ids": { "DOI": [ "10.3115/v1/N15-1126" ] }, "num": null, "urls": [], "raw_text": "Dian Yu, Heng Ji, Sujian Li, and Chin-Yew Lin. 2015. Why read if you can scan? trigger scoping strategy for biographical fact extraction. In Proceedings of the 2015 Conference of the North American Chap- ter of the Association for Computational Linguis- tics: Human Language Technologies, pages 1203- 1208, Denver, Colorado. Association for Computa- tional Linguistics.", "links": null } }, "ref_entries": { "FIGREF0": { "type_str": "figure", "text": ": 16 {'head': 2, 'rel':'dobj', 'src':'UD'} 17 {'head': 5, 'rel': 'nsubj', 18 'src':('advcl','while'), 'alt':'0'} Figure 2: Usage example of pyBART's spaCy-pipeline component. She acted, trusting her instincts nsubj {UNC} dep nsubj", "uris": null, "num": null }, "FIGREF1": { "type_str": "figure", "text": "You saw me while driving, Sue saw Sam after returning nsubj{ALT=0} nsubj{ALT=0} nsubj{ALT=1} nsubj{ALT=1}", "uris": null, "num": null }, "FIGREF5": { "type_str": "figure", "text": "Economy comparison: Recall vs number of patterns, for the different representations.", "uris": null, "num": null }, "FIGREF6": { "type_str": "figure", "text": "Yuhao Zhang, Victor Zhong, Danqi Chen, Gabor Angeli, and Christopher D. Manning. 2017. Positionaware attention and supervised data improve slot filling. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing (EMNLP 2017), pages 35-45.", "uris": null, "num": null }, "TABREF0": { "html": null, "num": null, "content": "
\u00a74.1
nsubj\u00a74.1\u00a74.2
nsubjdobj
nsubj\u00a74.2advcl\u00a74.3
nsubjxcompcompound
ev
\u00a74.4
detdetmarkdetcase
apposcopadvcldobjnmod
nsubj
", "type_str": "table", "text": "Neo, the One, is STATE a hero, for chasing this army of RobotsFigure 1: Representation of Neo, the One, is a hero, for chasing this army of Robots. The arcs above the sentence are BART additions. The ones below are EUD. Red arcs are removed in BART while black are retained." }, "TABREF1": { "html": null, "num": null, "content": "
nsubjnsubj
evevxcomp
nsubjxcompnsubjxcomp
ev
(16)The Media reported that peace was achieved
ccomp
", "type_str": "table", "text": "Sam seems to like them. They seem STATE nice." }, "TABREF3": { "html": null, "num": null, "content": "", "type_str": "table", "text": "Effectiveness of the different representations on the TACRED relation extraction task." }, "TABREF5": { "html": null, "num": null, "content": "
nsubjnsubj
copevxcomp
Sally is smartSally is STATE smart
amod
(22) U D :BART :
nsubj
copnsubjxcomp
detevdet
He is the manHe is STATE the man
(23) U D :BART :
nsubj
copnsubjnmod
caseevcase
They are from IsraelThey are STATE from Israel
(24) U D :BART :
xcomp
mark
copnsubjxcomp
nsubjdetevevdet
Sam is to be a manSam is to be STATE a man
mark
(25) U D :BART :
nsubj
nsubjxcompevxcomp
Sam sounds funnySam sounds STATE funny
amod
(26) U D :BART :
nsubj
nsubjxcompevxcomp
Sam seems happySam seems STATE happy
amod
(27) U D :BART :
nsubj
nsubjxcompdobjevdobj
Sam seems to like themSam seems to like them
(28) U D :BART :
nsubj
nsubjxcompadvmodevadvmod
Sally began walking homeSally began walking home
", "type_str": "table", "text": "Copular Sentences and Stative PredicatesWe show additional examples of these transformations, with explicit comparison to UD.(21) U D :BART :" } } } }