<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="264"/><title>SEMAFOR: Frame Argument Resolution with Log-Linear Models</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 264-267, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Chen" givenname="Desai"><org  name="Carnegie Mellon University" country="USA" city="Pittsburgh"/></author><author surname="Schneider" givenname="Nathan"><org  name="Carnegie Mellon University" country="USA" city="Pittsburgh"/></author><author surname="Das" givenname="Dipanjan"><org  name="Carnegie Mellon University" country="USA" city="Pittsburgh"/></author><author surname="Smith" givenname="Noah A."><org  name="Carnegie Mellon University" country="USA" city="Pittsburgh"/></author></firstpageheader><frontmatter><p><b>SEMAFOR: Frame Argument Resolution with Log-Linear Models</b></p><p><b>Desai Chen Nathan Schneider Dipanjan Das Noah A. Smith</b></p><p>School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA</p><p>{desaic@andrew,dipanjan@cs,nschneid@cs,nasmith@cs}.emu.edu</p></frontmatter><abstract>This paper describes the SEMAFOR sys­tem's performance in the SemEval 2010 task on linking events and their partici­pants in discourse. Our entry is based upon SEMAFOR 1.0 (Das et al., 2010a), a frame-semantic probabilistic parser built from log-linear models. The extended sys­tem models <i>null instantiations, </i>including non-local argument reference. Performance is evaluated on the task data with and with­out gold-standard overt arguments. In both settings, it fares the best of the submitted systems with respect to recall and <i>Fi.</i> </abstract></header><body><section number="1" title="Introduction"><p>The theory of frame semantics (Fillmore, 1982) holds that meaning is largely structured by holis­tic units of knowledge, called <i>frames. </i>Each frame encodes a conventionalized gestalt event or sce­nario, often with conceptual dependents (partic­ipants, props, or attributes) filling roles to elab­orate the specific instance of the frame. In the FrameNet lexicon (Fillmore et al., 2003), each frame defines <b>core roles </b>tightly coupled with the particular meaning of the frame, as well as more generic <b>non-core </b>roles (Ruppenhofer et al., 2006). Frames can be evoked with linguistic pred­icates, known as <b>lexical units (LUs); </b>role fillers can be expressed overtly and linked to the frame via (morpho)syntactic constructions. However, a great deal of conceptually-relevant content is left unexpressed or is not explicitly linked to the frame via linguistic conventions; rather, it is expected that the listener will be able to infer the appro­priate relationships pragmatically. Certain types of implicit content and implicit reference are for­malized in the theory of <b>null instantiations (NIs) </b>(Fillmore, 1986; Ruppenhofer, 2005). A complete frame-semantic analysis of text thus incorporates covert <i>and </i>overt predicate-argument information.</p><p>In this paper, we describe a system for frame-semantic analysis, evaluated on a semantic role labeling task for explicit and implicit arguments (§2). Extending the SEMAFOR 1.0 frame-semantic parser (Das et al., 2010a; outlined in §3), we detect null instantiations via a simple two-stage pipeline: the first stage predicts <i>whether </i>a given role is null-instantiated, and the second stage (§4) predicts <i>how </i>it is null-instantiated, if it is not overt. We report performance on the SemEval 2010 test set under the full-SRL and Nl-only conditions.</p><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">2 Data</doubt><p>The SemEval 2007 task on frame-semantic pars­ing (Baker et al., 2007) provided a small (about 50,000 words and 2,000 sentences) dataset of news text, travel guides, and bureaucratic accounts of weapons stockpiles. Sentences in this dataset were fully annotated with frames and their argu­ments. The SemEval 2010 task (Ruppenhofer et al., 2010) adds annotated data in the fiction do­main: parts of two Sherlock Holmes stories by Arthur Conan Doyle. The SemEval 2010 <b>train­ing set </b>consists of the SemEval 2007 data plus one document from the new domain. This doc­ument has about 7800 words in 438 sentences; it has 1492 annotated frame instances, including 3169 (overt and null-instantiated) argument anno­tations. The <b>test set </b>consists of two chapters from another story: Chapter 13 contains about 4000 words, 249 sentences, and 791 frames; Chapter 14 contains about 5000 words, 276 sentences, and 941 frames (see also Table 3). Figure 1 shows two annotated test sentences. All data released for the 2010 task include part-of-speech tags, lemmas, and phrase-structure trees from a parser, with head annotations for constituents.</p></section><section number="3" title="Argument identification"><p>Our starting point is SEMAFOR 1.0 (Das et al., 2010a), a discriminative probabilistic frame-semantic parsing model that operates in three stages: (a) rule-based target selection, (b) proba­bilistic disambiguation that resolves each target to a FrameNet frame, and (c) joint selection of text spans to fill the roles of each target through a sec­ond probabilistic model.<footnote anchor="1"/><page local="2" global="265"/></p><doubt alpha="66.0" length="103" tooSmall="False" monospace="0.0">!Das et al. (2010a) report the performance of this system on the complete SemEval 2007 task at 46.49%Fl</doubt><p>Cognizer <b>CP</b></p><doubt alpha="86.7" length="15" tooSmall="True" monospace="0.0">think, vOpinion</doubt><doubt alpha="100.0" length="7" tooSmall="True" monospace="0.0">Opinion</doubt><doubt alpha="100.0" length="5" tooSmall="True" monospace="0.0">Actor</doubt><doubt alpha="100.0" length="9" tooSmall="True" monospace="0.0">Causation</doubt><doubt alpha="100.0" length="11" tooSmall="True" monospace="0.0">iPhenomenon</doubt><doubt alpha="93.8" length="16" tooSmall="True" monospace="0.0">Degree Attribute</doubt><p>THINK that I shall be in a position to    MAKE the situation rather more</p><p>I to you before long .</p><doubt alpha="100.0" length="11" tooSmall="True" monospace="0.0">Experiencer</doubt><doubt alpha="100.0" length="10" tooSmall="True" monospace="0.0">difficulty</doubt><doubt alpha="100.0" length="21" tooSmall="True" monospace="0.0">DifficultyExperiencer</doubt><p>It has been an exceedingly DIFFICULT and most complicated business .</p><doubt alpha="100.0" length="6" tooSmall="True" monospace="0.0">Degree</doubt><doubt alpha="100.0" length="8" tooSmall="True" monospace="0.0">Activity</doubt><p><b>Figure 1. </b>Two consecutive sentences in the test set, with frame-semantic an­notations. Shaded regions represent frames: they include the target word in the sentence, the corresponding frame name and lexical unit, and arguments. Horizontal bars mark gold argument spans—white bars are gold annotations and black bars show mistakes of our NI-only system.</p><p><b>Chapter 13</b> <b>Chapter 14</b> <b>Table 1.</b><b> </b>Overt argument labeling performance.</p><p>Stage (c), known as <b>argument identification </b>or</p><p>SRL, is most relevant here. In this step, the system takes the target (frame-evoking) phrase <i>t </i>and cor­responding frame type / predicted by the previous stages, and independently fills each role of / with a word or phrase from the sentence, or the sym­bol other to indicate that the role has no (local) overt argument. Features used to inform this de­cision include aspects of the syntactic dependency parse (e.g. the path in the parse from the target to the argument); voice; word overlap of the argu­ment with respect to the target; and part-of-speech tags within and around the argument. SEMAFOR as described in (Das et al., 2010a) does not dis­tinguish between different types of null instantia­tions or find non-local referents. Given perfect input to stage (c), the system achieved 68.5% <i>F\ </i>on the SemEval 2007 data (exact match, evaluat­ing overt arguments only). The only difference in our use of SEMAFOR's argument identification module is in preprocessing the training data: we use dependency parses transformed from the head-augmented phrase-structure parses in the task data.</p><p>Table 1 shows the performance of our argument identification model on this task's test data. The SRL systems compared in (Ruppenhofer et al., 2010) all achieved precision in the mid 60% range, but SEMAFOR achieved substantially higher re­call, Fi, and label accuracy on this subtask. (The table also shows how performance of our model degrades when half or all of the new data are not used for training; the 9% difference in recall sug­gests the importance of in-domain training data.)</p></section><section number="4" title="Null instantiation detection"><p>In this subtask, which follows the argument iden­tification subtask (§3), our system seeks to char­acterize non-overt core roles given gold standard local frame-argument annotations. Consider the following passage from the test data:</p><p>"That's lucky for him—in fact, it's lucky for all of you, since you are all on the wrong side of the law in this matter. I am not sure that as a consci­entious detective [Authorities my] flrst duty is not to <u>arrest</u> [suspect the whole household], [Jorges0]</p><p>The frame we are interested in, AR REST, has four core roles, two of which (Authorities and Sus­pect) have overt (local) arguments. The third core role, Charges, is annotated as having anaphoric or <b>definite null instantiation (DNI). </b>"Definite" means that the discourse implies a specific referent that should be recoverable from context, without marking that referent linguistically. Some DNIs in the data are linked to phrases in syntactically non­local positions, such as in another sentence (see Figure 1). This one is not (though our model in­correctly labels <i>this matter </i>from the previous sen­tence as a DNI referent for this role). The fourth core role, Offense, is not annotated as a null in­stantiation because it belongs to the same <b>CoreSet </b>as Charges—which is to say they are relevant in a similar way to the frame as a whole (both pertain to the rationale for the arrest) and only one is typ­ically expressed.<footnote anchor="2"/> We will use the term <b>masked </b>to refer to any non-overt core role which does not need to be specified as null-instantiated due to a structural connection to another role in its frame.</p><p>The typology of NIs given in Ruppenhofer (2005) and employed in the annotation distin­guishes anaphoric/definite NIs from existential or <b>indefinite null instantiations (INIs). </b>Rather than having a specific referent accessible in the dis­course, INIs are left vague or deemphasized, as in<page local="3" global="266"/></p><footnote label="2">If the FrameNet lexicon marks a pair of roles within a frame as being in a CoreSet or Excludes relationship, then filling one of them satisfies the requirement that the other be (expressly or implicitly) present in the use of the frame.</footnote><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Training Data</b></p></td><td class="cell"><p><b>Prec.</b></p></td><td class="cell"><p><b>Ree.</b></p></td><td class="cell"><p>Fi</p></td><td class="cell"><p><b>Prec.</b></p></td><td class="cell"><p><b>Ree.</b></p></td><td class="cell"><p>Fi</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SemEval 2010 data (includes SemEval 2007 data) SemEval 2007 data + 50% new, in-domain data SemEval 2007 data only</p></td><td class="cell"><p>0.69 0.68 0.67</p></td><td class="cell"><p>0.50 0.47 0.41</p></td><td class="cell"><p>0.58 0.55 0.50</p></td><td class="cell"><p>0.66 0.66 0.64</p></td><td class="cell"><p>0.48 0.45 0.40</p></td><td class="cell"><p>0.56 0.54 0.50</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p><b>Chapter 13</b> <b>Chapter 14</b> <i>Predicted</i> <b>overt DNI</b></p><p>cS <b>INI masked inc. total</b></p><p><b>Table 2. </b>Performance on the full task and the NI-only task. The NI model was trained on the new SemEval 2010 document, "The Tiger of San Pedro" (data from the 2007 task was excluded because none of the null instantiations in that data had annotated referents).</p><p><b>Table 3. </b>Instantiation type confusion ma­trix for the full model (argument identifi­cation plus NI detection). Parenthesized numbers count the predictions of the cor­rect type which also predicted the same (argument or referent) span. On the NI-only task, our system has a similar distri­bution of NI detection errors.</p><p>the thing(s) eaten in the sentence <i>We ate.</i></p><p>The problem can be decomposed into two steps: (a) <i>classifying </i>each null instantiation as definite, indefinite, or masked; and (b) <i>resolving </i>the DNIs, which entails finding referents in the non-local context. Instead, our model makes a single NI pre­diction for any role that received no local argument (other) in the argument identification phase (§3), thereby combining classification and resolution.<footnote anchor="3"/></p><subsection number="4.1" title="Model"><p>Our model for this subtask is analogous to the ar­gument identification model: it chooses one from among many possible fillers for each role. How­ever, whereas the argument identification model considers parse constituents as potential local fillers (which might constitute an overt argument within the sentence) along with a special category, other, here the set of candidate fillers consists of phrases from outside the sentence, along with spe­cial categories IN I or masked. When selected, a non-local phrase will be interpreted as a non-local argument and labeled as a DNI referent.</p><p>These non-local candidate fillers are handled differently from candidates within the sentence considered in the argument identification model: they are selected using more restrictive criteria, and are associated with a different set of features. <b>Restricted search space for DNI referents. </b>We consider nouns, pronouns, and noun phrases from the previous three sentences as candidate DNI ref­erents. This narrows the search space considerably to make learning tractable, but at a cost: many gold DNI referents will not even be considered. In the training data, there are about 250 DNI in­stances with explicit referents; their distribution is</p><p>investigation of separate modeling is left to future work.</p><p>chaotic.<footnote anchor="4"/> Judging by the training data, our heuris­tics thus limit oracle recall to about 20% of DNIs.<footnote anchor="5"/><b>Modified feature set. </b>Since it is not obvious how to calculate a syntactic path between two words in different sentences, we replaced dependency path features with simpler features derived from FrameNet's lexicographic exemplar annotations. For each candidate span, we use two types of fea­tures to model the affinity between the head word and the role. The first indicates whether the head word is used as a filler for this role in at least one of the lexicographic exemplars. The second encodes the maximum distributional similarity to any word heading a filler of that role in the ex­emplars.<footnote anchor="6"/> In practice, we found that these fea­tures received negligible weight and had virtually no effect on performance, possibly due to data sparseness. An additional change in the feature set is that ordering/distance features (Das et al., 2010b, p. 13) were replaced with a feature indicat­ing the number of <i>sentences </i>away the candidate is from the target.<footnote anchor="7"/> Otherwise, the null identifica-</p><footnote label="4">91 DNI referents are found no more than three sentences prior; another 90 are in the same sentence as the target. 20 DNIs have referents which are not noun phrases. Six appear after the sentence containing its frame target; 28 appear at least 25 sentences prior. 60 have no referent.</footnote><footnote label="5">Our system ignores DNIs with no referent or with a ref­erent in the same sentence as the target. Experiments with variants on these assumptions show that the larger the search space (i.e. the more candidate DNI referents are under con­sideration), the worse the trained model performs at distin­guishing NIs from non-NIs (though DNI vs. INI precision improves). This suggests that data sparseness is hindering our system's ability to learn useful generalizations about NIs.</footnote><p>distributional similarity scores are obtained from D. Lin's Proximity-based Thesaurus (http : //webdocs.cs.ualberta.ca/~lindek/ Downloads/sims. lsp. gz) and quantized into bi­nary features for intervals: [0, .03), [.03, .06), [.06, .08), [.08, oo).</p><footnote label="7">A11 of the new features are instantiated in three forms:</footnote><table class="main" frame="box" rules="all" border="0" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p><b>Training Data</b></p></td><td class="cell"><p><b>Prec.</b></p></td><td class="cell"><p><b>Ree.</b></p></td><td class="cell"><p><i>Fi</i></p></td><td class="cell"><p><b>Prec.</b></p></td><td class="cell"><p><b>Ree.</b></p></td><td class="cell"><p><i>Fi</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SemEval 2010 new: 100%</p></td><td class="cell"><p>0.40</p></td><td class="cell"><p>0.64</p></td><td class="cell"><p>0.50</p></td><td class="cell"><p>0.53</p></td><td class="cell"><p>0.60</p></td><td class="cell"><p>0.56</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>o</p></td><td class="cell"><p>SemEval 2010 new: 75%</p></td><td class="cell"><p>0.66</p></td><td class="cell"><p>0.37</p></td><td class="cell"><p>0.50</p></td><td class="cell"><p>0.70</p></td><td class="cell"><p>0.37</p></td><td class="cell"><p>0.48</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>SemEval 2010 new: 50%</p></td><td class="cell"><p>0.73</p></td><td class="cell"><p>0.38</p></td><td class="cell"><p>0.51</p></td><td class="cell"><p>0.75</p></td><td class="cell"><p>0.35</p></td><td class="cell"><p>0.48</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>Full</i></p></td><td class="cell"><p>All</p></td><td class="cell"><p>0.35</p></td><td class="cell"><p>0.55</p></td><td class="cell"><p>0.43</p></td><td class="cell"><p>0.56</p></td><td class="cell"><p>0.49</p></td><td class="cell"><p>0.52</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table class="main" frame="box" rules="all" border="0" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>overt</b></p></td><td class="cell"><p><b>DNI</b></p></td><td class="cell"><p><b>INI</b></p></td><td class="cell"><p><b>masked</b></p></td><td class="cell"><p><b>inc.</b></p></td><td class="cell"><p><b>total</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>2068 (1630)</b></p></td><td class="cell"><p>5</p></td><td class="cell"><p>362</p></td><td class="cell"><p>327</p></td><td class="cell"><p>0</p></td><td class="cell"><p>2762</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>64</p></td><td class="cell"><p><b>12(3)</b></p></td><td class="cell"><p>182</p></td><td class="cell"><p>90</p></td><td class="cell"><p>0</p></td><td class="cell"><p>348</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>41</p></td><td class="cell"><p>2</p></td><td class="cell"><p><b>214</b></p></td><td class="cell"><p>96</p></td><td class="cell"><p>0</p></td><td class="cell"><p>353</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>73</p></td><td class="cell"><p>0</p></td><td class="cell"><p>240</p></td><td class="cell"><p><b>1394</b></p></td><td class="cell"><p>0</p></td><td class="cell"><p>1707</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>12</p></td><td class="cell"><p>2</p></td><td class="cell"><p>55</p></td><td class="cell"><p>2</p></td><td class="cell"><p><b>0</b></p></td><td class="cell"><p>71</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>2258</p></td><td class="cell"><p>21</p></td><td class="cell"><p>1053</p></td><td class="cell"><p>1909</p></td><td class="cell"><p>0</p></td><td class="cell"><p><b>3688 correct</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="4" global="267"/><p>tion model uses the same features as the argument identification model.</p><p>The theory of null instantiations holds that the grammaticality of lexically-licensed NI for a role in a given frame depends on the LU: for exam­ple, the verbs <i>buy </i>and <i>sell </i>share the same frame but differ as to whether the Buyer or Seller role may be lexically null-instantiated. Our model's feature set is rich enough to capture this in a soft way, with lexicalized features that fire, e.g., when the Seller role is null-instantiated and the target is <i>buy. </i>Moreover, (Ruppenhofer, 2005) hypoth­esizes that each role has a strong preference for one interpretation (INI or DNI) when it is lexically null-instantiated, regardless of LU. This, too, is modeled in our feature set. In theory these trends should be learnable given sufficient data, though it is doubtful that there are enough examples of null instantiations in the currently available dataset for this learning to take place.</p></subsection><subsection number="4.2" title="Evaluation"><p>We trained the model on the non-overt arguments in the new SemEval 2010 training document, which has 580 null instantiations—303 DNIs and 277 INIs.<footnote anchor="8"/>'<footnote anchor="9"/> Then we used the task scoring proce­dure to evaluate the NI detection subtask in isola­tion (given gold-standard overt arguments) as well as the full task (when this module is combined in a pipeline with argument identification). Results are shown in Table 2.<footnote anchor="10"/></p><p>Table 3 provides a breakdown of our sys­tem's predictions on the test data by instantiation type: overt local arguments, DNIs, INIs, and the MASKED category (marking the role as redundant or irrelevant for the particular use of the frame, given the other arguments). It also shows counts for <b>incorporated </b>("inc.") roles, which are filled by the frame-evoking target, e.g. <i>clear </i>in Figure l.<footnote anchor="11"/>This table shows that the system is reasonably ef­fective at discriminating NIs from masked roles,</p><p>one specific to the frame and the role, one specific to the role name only, and one to learn the overall bias of the data.</p><footnote label="8">For feature engineering we held out the last 25% of sen­tences from the new training document as development data, retraining on the full training set for final evaluation.</footnote><footnote label="9">We used Nils Reiter's FrameNet API, version 0.4 (http :// www.cl.uni-heideIberg.de/trac/ FrameNetAPI) in processing the data.</footnote><footnote label="10">The other system participating in the NI-only subtask had much lower NI recall of 8% (Ruppenhofer et al., 2010).</footnote><footnote label="11">We do not predict any DNIs without referents or in­corporated roles, though the evaluation script gives us credit when we predict INI for these cases.</footnote><p>but DNI identification suffers from low recall and INI identification from low precision. Data sparse­ness is likely the biggest obstacle here. To put this in perspective, there are over 20,000 training ex­amples of overt arguments, but fewer than 600 ex­amples of null instantiations, two thirds of which do not have referents. Without an order of mag­nitude more NI data (at least), it is unlikely that a supervised learner could generalize well enough to recognize on new data null instantiations of the over 7000 roles in the lexicon.</p></subsection></section><section number="5" title="Conclusion"><p>We have described a system that implements a clean probabilistic model of frame-semantic struc­ture, considering overt arguments as well as var­ious forms of null instantion of roles. The sys­tem was evaluated on SemEval 2010 data, with mixed success at detecting null instantiations. We believe in-domain data sparseness is the predom­inant factor limiting the robustness of our super­vised model.</p></section><section title="Acknowledgments"><p>This work was supported by DARPA grant NBCH-1080004 and computational resources provided by Yahoo. We thank the task organizers for providing data and conducting the evaluation, and two reviewers for their comments.</p></section><references><p>C. Baker, M. Ellsworth, and K. Erk. 2007. SemEval-2007 Task 19: Frame Semantic Structure Extraction. In <i>Proc. of SemEval.</i></p><p>D. Das, N. Schneider, D. Chen, and N. A. Smith. 2010a. Probabilistic frame-semantic parsing. <i>In Proc. ofNAACL-HLT.</i></p><p>D. Das, N. Schneider, D. Chen, and N. A. Smith. 2010b. SEMAFOR 1.0: A probabilistic frame-semantic parser. Technical Report CMU-LTI-10-001, Carnegie Mellon University.</p><p>C. J. Fillmore, C. R. Johnson, and M. R.L. Petruck. 2003. Background to FrameNet. <i>International Journal of Lexi­cography, </i>16(3).</p><p>C. J. Fillmore. 1982. Frame semantics. In <i>Linguistics in the Morning Calm, </i>pages 111-137. Hanshin Publishing Co., Seoul, South Korea.</p><p>C. J. Fillmore. 1986. Pragmatically controlled zero anaphora. In <i>Proc. of Berkeley Linguistics Society, </i>pages 95-107, Berkeley, CA.</p><p>J. Ruppenhofer, M. Ellsworth, M. R.L. Petruck, C. R. John­son, and J. Scheffczyk. 2006. FrameNet II: extended the­ory and practice.</p><p>J. Ruppenhofer, C. Sporleder, R. Morante, C. Baker, and M. Palmer. 2010. SemEval-2010 Task 10: Linking Events and Their Participants in Discourse. In <i>Proc. of SemEval.</i></p><p>J. Ruppenhofer. 2005. Regularities in null instantiation.</p></references></body></article>