<?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"/><title>Comparing Dependency and Constituent Syntax for Frame-semantic Analysis</title><author surname="Johansson" givenname="Richard"><org  name="Lund University" country="Sweden"/></author><author surname="Nugues" givenname="Pierre"><org  name="Lund University" country="Sweden"/></author></firstpageheader><frontmatter><p><b>Comparing Dependency and Constituent Syntax for Frame-semantic Analysis</b></p><p><b>Richard Johansson, Pierre Nugues</b></p><p>Lund University</p><p>(richard, pierre}@cs.lth.se</p></frontmatter><abstract>We address the question of which syntactic representation is best suited for role-semantic analysis of English in the FrameNet paradigm. We compare systems based on dependencies and constituents, and a dependency syntax with a rich set of grammatical functions with one with a smaller set. Our experiments show that dependency-based and constituent-based analyzers give roughly equivalent performance, and that a richer set of functions has a positive influence on argument classification for verbs. </abstract></header><body><section number="1." title="Introduction"><p>The role-semantic paradigm (Gildea and Jurafsky (2002), <i>inter alia) </i>is a prominent model in automatic semantic anal­ysis with a wide range of proposed applications. With a few exceptions, role-based semantic analysis relies cru­cially (Gildea and Palmer, 2002; Punyakanok et al., 2005) on some sort of syntactic representation as input. This en­ables the analyzer to extract syntactic features that are used by statistical classifiers. The connection between syntax and semantics has also been noted in annotation projects of semantic treebanks; for instance, the SALSA project (Bur-chardt et al., 2006) and the Prague Dependency Treebank (Hajic, 1998) have annotated semantic structures on top of syntactic treebanks.</p><p>The CoNLL 2004 and 2005 shared tasks (Carreras and Marquez, 2005) were the first events that conducted an impartial evaluation of role-semantic labelers on the Prop-Bank corpus. More recently, SemEval organized a simi­lar evaluation (Baker, 2007) using the FrameNet corpus. While nearly all participants in the CoNLL shared tasks used a constituent representation that underlies the Prop-Bank annotation, the best-performing system (Johansson and Nugues, 2007b) of SemEval 2007 used dependency graphs.</p><p>These evaluations are not directly comparable however. They use different corpora, annotation, and training meth­ods and from these results, it is difficult to conclude what is the optimal representation to use in the parsing step. Some grammatical features used in constituents and dependencies may be directly equivalent. Conversely, some other features are tied to a specific representation. In addition, the contri­bution of the features and their behavior as a function of the training set and its size would still need more exploration. This paper addresses the question of how the syntactic representation influences the performance of automatic se­mantic analysis in the paradigm of Frame Semantics (Fill-more, 1976; Baker et al., 1998). To study the impact of syntactic representations, we performed a set of experi­ments in which we compare the performance of constituent-based and dependency-based semantic analyzers on the three main subtasks of FrameNet-based role-semantic anal­ysis.</p></section><section number="2." title="Automatic Frame-Semantic Analysis"><p>The task of frame-semantic analysis is usually divided into three main subtasks: detection and disambiguation of target words, detection of semantic arguments, and finally classi­fication of arguments (see Figure 1).</p><p>PERCEIVER_PASSIVE,</p><p>PERCEPTION_EXPERIENCE</p><p>J   " ^PHENOMENON</p><doubt alpha="44.7" length="38" tooSmall="False" monospace="0.0">Do [I] [want] [him] [to [see] [me] ] ?</doubt><p>EXPERIENCER<b>i</b></p><p>FOCAL_P. <b>y </b>EVENT</p><p>DESIRING</p><figure caption="Figure 1: The stages in the frame-semantic structure extrac­tion process."></figure><p>Although it is generally agreed that the best performance is obtained when the tasks are solved jointly, it is easiest from an engineering point of view, and computationally less ex­pensive, to treat them as independent tasks that are solved sequentially.</p><p>For both the constituent-based and the dependency-based semantic analyzer, we implemented the three subtasks as statistical classifiers using support vector machines; the first classifier assigns a frame for a given target word, the sec­ond decides whether a given node in a constituent or depen­dency parse tree represents an argument for a given predi­cate, and the final one assigns a semantic role to a node that has been identified as an argument by the previous step.<page local="2"/> The second step also makes use of a set of filtering rules to reduce the number of potential arguments (Xue and Palmer, 2004). Table 1 shows the features used by the clas­sifiers. The features used by the constituent-based and the dependency-based classifiers are indicated by C and D, re­spectively.</p><p>The following three subsection describes the features used by the classifiers. All examples are given with respect to Figure 2.</p><subsection number="2.1." title="Common Features"><p>The following features are used by both the constituent-based and the dependency-based semantic analyzers. Head-finding rules (Johansson and Nugues, 2007a) were applied when heads of constituents were needed.</p><p>Frames. The set of frames listed in FrameNet for a lemma. For instance, for the verb <i>want, </i>FrameNet lists Desiring and Possession.</p><p>TargetLemma. The lemma of the target word itself, e.g. <i>want.</i></p><p>ChildWordSet. The set of dependent head words of the target word. For <i>see, </i>this set is { to, <i>me </i>}.</p><p>ParentWord. The word of the parent word of the tar­get. For <i>see </i>in the example, this is <i>want.</i></p><p>FEs. For a given frame, the set of available frame el­ements listed in FrameNet. For instance, for <i>see </i>in the Perception_experience frame, we have 12 frame elements: Degree, Perceiver_passive,</p><p>PHENOMENON, ...</p><p>TARGETPOS. Part-of-speech tag for the target word.</p><p>Voice. For verbs, this feature is Active or Passive. For other types of words, it is not defined.</p><p>Position. Position of the head word of the argument with respect to the target word: Before, After, or On.</p><p>HeadWord and HeadPOS. Word and part-of-speech tag of the argument.</p><p>LeftWord and LeftPOS. Word and part-of-speech tag of the leftmost dependent of the argument head.</p><p>RightWord and RightPOS. Word and part-of-speech tag of the rightmost dependent of the argument head.</p></subsection><subsection number="2.2." title="Features Used by the Constituent-based Analyzer"><p>C-Subcat. Subcategorization frame: corresponds to the phrase-structure rule used to expand the phrase around the target. For <i>want </i>in the example, this feature is</p><p>vp—&gt;vb s.</p><p>C-Path. A string representation of the path through the constituent tree from the target word to the argument constituent. For instance, the path from <i>want </i>to <i>I </i>is Tvp-Tsq-|np.</p><p>PhraseType. Phrase type of the argument constituent, e.g. np for <i>him.</i></p><p>GovCat. Governing category: this feature is either s or vp, and is found by starting at the argument con­stituent and moving upwards until either a vp or a sen­tence node (s , sinv, or sq) is found. For instance, for him, this feature is s, while for me, it is vp. This can be thought of as a very primitive way of distin­guishing subjects and objects.</p></subsection><subsection number="2.3." title="Features Used by the Dependency-based Analyzer"><p>D-Subcat. Subcategorization frame: the grammatical functions of the dependents concatenated. For <i>want, </i>this feature is obj+oprd.</p><p>D-Path. A string representation of the path through the dependency tree from the target node to the argument node. Moving upwards through verb chains is not counted in this path string. In the example, the path from <i>want </i>to <i>I </i>is j.sbj.</p><p>Function. The grammatical function of the argument node. For direct dependents of the target, this feature is identical to the D-Path.</p><p>ChildDepSet. The set of grammatical functions of the direct dependents of the target node. For instance, for <i>want, </i>this set is { obj, oprd }.</p><p>ChildWordDepSet. The set of word/function pairs of the dependents of the target. For instance, for <i>want, </i>this set is { him-obj, see-oprd }.</p><table caption="Table 1: Features used by the classifiers." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Target</p></td><td class="cell"><p>Argument</p></td><td class="cell"><p>Argument</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Features</p></td><td class="cell"><p>disambiguation</p></td><td class="cell"><p>identification</p></td><td class="cell"><p>classification</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Frames</p></td><td class="cell"><p>C,D</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TargetLemma</p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ChildWordSet</p></td><td class="cell"><p>c,d</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ParentWord</p></td><td class="cell"><p>c,d</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FEs</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TargetPOS</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Voice</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Position</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ArgWord/POS</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>LeftWord/POS</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>RightWord/POS</p></td><td class="cell"><p></p></td><td class="cell"><p>c,d</p></td><td class="cell"><p>c,d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>C-Subcat</p></td><td class="cell"><p>c</p></td><td class="cell"><p>c</p></td><td class="cell"><p>c</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>C-Path</p></td><td class="cell"><p></p></td><td class="cell"><p>c</p></td><td class="cell"><p>c</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PhraseType</p></td><td class="cell"><p></p></td><td class="cell"><p>c</p></td><td class="cell"><p>c</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>GovCat</p></td><td class="cell"><p></p></td><td class="cell"><p>c</p></td><td class="cell"><p>c</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>D-Subcat</p></td><td class="cell"><p>d</p></td><td class="cell"><p>d</p></td><td class="cell"><p>d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>D-Path</p></td><td class="cell"><p></p></td><td class="cell"><p>d</p></td><td class="cell"><p>d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Function</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p>d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ChildDepSet</p></td><td class="cell"><p>d</p></td><td class="cell"><p>d</p></td><td class="cell"><p>d</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ChildWordDepSet</p></td><td class="cell"><p>D</p></td><td class="cell"><p></p></td><td class="cell"><p></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></tr></table><page local="3"/><doubt alpha="85.7" length="7" tooSmall="False" monospace="0.0">ROOT-SQ</doubt><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">_ VCSBJ</doubt><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">OPRD</doubt><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">OBJ</doubt><p>VMOD OBJ</p><p>Do I want him to see me ?</p><figure caption="Figure 2: Constituent and dependency trees for the example sentence."></figure><doubt alpha="0.0" length="33" tooSmall="False" monospace="0.0">... . .    *    +    1 + 1    * +</doubt><doubt alpha="63.0" length="27" tooSmall="False" monospace="0.0">Do   I want him to see me ?</doubt></subsection></section><section number="3." title="Experiments"><p>The purpose of the experiments is twofold: first, to inves­tigate whether dependency-based semantic analyzers are competitive with constituent-based analyzers; secondly, to measure the influence of the richness of the set of gram­matical functions. In addition, we would like to measure the influence of formalisms rather than of parsing perfor­mance, so we used two parsers of each type.</p><p>To train and evaluate the dependency-based semantic ana­lyzers, we parsed the training and test corpora using two freely available parsers: MaltParser (Nivre et al., 2007) and MSTParser (McDonald and Pereira, 2006). They were both trained on a dependency treebank that had been automatically converted from the Penn Treebank using the LTH constituent-to-dependency conversion tool (Johansson and Nugues, 2007a), achieving a labeled accuracy of 87.4% and 86.9% on section 23 of the WSJ part of the Treebank, respectively. In addition, we trained a model for Malt-Parser using Penn2Malt<footnote anchor="1"/> which gives a dependency representation with a smaller set of grammatical functions. This model achieves a labeled accuracy of 90.3% on WsJ section 23.</p><p>For the constituent-based analyzers, we used the popular Collins' (1997) and Charniak's (2000) parsers. Although grammatical functions (subject, locative, temporal,...) are available in the Treebank, they are not available in the out­put of these parsers. The published labeled precision and recall figures for these parsers are 88.1/87.5 and 89.5/89.6, respectively. Collins' parser comes with three different parsing models; in the experiments, we report the result for the best-performing of these.</p><p>This gives us in total five semantic analyzers that we studied for each experiment: MaltParser and MST­Parser with LTH-style dependencies, MaltParser with Penn2Malt dependencies, and Collins' and Charniak's constituent parsers. In the experiments, we studied only target words that were adjectives, adverbs, noun, and verbs, since annotated data are more reliable for these word classes. All tests were run on the test data from the semEval-2007 task on Frame-semantic structure Extrac­tion (Baker, 2007). The test corpus consists of 120 sen­tences and contains 970 target words and 1,663 semantic arguments, not counting null-instantiated arguments.</p><footnote label="1">http://w3.msi.vxu.se/~nivre/research/Penn2Malt.html</footnote><subsection number="3.1." title="Target Word Detection and Frame Disambiguation"><p>Table 2 shows the precision, recall, and F1 measures for target word detection and disambiguation. In addition, the last column shows the disambiguation accuracy when the target word is given. When a number appears with an as­terisk, this denotes that the difference between this figure and the best figure has at least 95% statistical significance according to a McNemar test.</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">P</doubt><table caption="Table 2: Target word detection/disambiguation perfor­mance."></table><p>Interestingly, the performance on this task seems to be negatively affected by the rich set of grammatical func­tions - the two parsers that use the LTH dependency for­mat score lower than the dependency parser that uses the Penn2Malt format and the two constituent parsers. Since the dependency-based disambiguation classifiers use more features than their constituent-based counterparts, we believe that this difference may be a case of the "curse of dimensionality" - the large number of features makes the learning curve rise slowly. We intend to carry out a series of feature engineering experiments to investigate this more thoroughly.</p></subsection><subsection number="3.2." title="Semantic Argument Detection"><p>In the next experiment, we investigated the performance of argument detection when target words and frames were given. An argument was counted as correctly detected if its bracketing coincided with the bracketing in the gold stan­dard, disregarding punctuation. Table 3 shows the preci­sion, recall, and F1 measures. The table gives results for all targets and for verb targets.</p><p>The most striking discrepancy in the table is the low perfor­mance of the semantic analyzer based on MSTParser; the differences are much larger than the difference in parsing accuracy on the WsJ. A possible reason for this difference may be that MSTParser reportedly performs slightly worse than MaltParser on short-distance links, which possibly would include most arguments.</p><table caption="Table 2: Target word detection/disambiguation performance." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Parser</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>Fl</p></td><td class="cell"><p>Accuracy</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Malt/P2M</p></td><td class="cell"><p>74.1</p></td><td class="cell"><p>68.8</p></td><td class="cell"><p>71.4</p></td><td class="cell"><p>85.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Malt/LTH</p></td><td class="cell"><p>73.1</p></td><td class="cell"><p>67.8</p></td><td class="cell"><p>70.3</p></td><td class="cell"><p>84.5*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>mst/lth</p></td><td class="cell"><p>73.8</p></td><td class="cell"><p>68.4</p></td><td class="cell"><p>71.0</p></td><td class="cell"><p>85.1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Charniak</p></td><td class="cell"><p>74.4</p></td><td class="cell"><p>70.1</p></td><td class="cell"><p>72.2</p></td><td class="cell"><p>85.4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Collins</p></td><td class="cell"><p>73.7</p></td><td class="cell"><p>68.5</p></td><td class="cell"><p>71.1</p></td><td class="cell"><p>86.6</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></tr></table><page local="4"/><p>All targets Verb targets</p><p>The other two dependency-based analyzers perform well, especially the model using LTH-style grammatical func­tions, which outperforms the constituent-based analyzers by 0.8 points for argument detection over all targets. For verbs, on the other hand, the constituent-based analyz­ers outperform all the dependency-based ones by a wide margin. Inspection of the output data indicates that a part of the low figures for the dependency-based systems may be explained by ambiguity introduced by coordination and raising.</p></subsection><subsection number="3.3." title="Semantic Argument Classification"><p>In the final experiment, we gave the system as input the tar­get words and the corresponding frames, and the argument bracketings. Table 4 shows the argument classification ac­curacy for all targets and for verb targets. Here, the analyzers based on LTH-style dependencies out­perform the constituent-based analyzers. This difference is even more prominent for verbs; we believe that this is be­cause the LTH dependency graphs use 39 different labels for verb arguments and adjuncts, while the Penn2Malt graph only use five. For non-verb modifiers on the other hand, the LTH and Penn2Malt dependency styles use the same labels.</p><p>To further assess the influence of grammatical function on the classification accuracy, we performed a feature engi­neering study. For the dependency-based analyzers, the in­formation about the grammatical function is encoded in the D-Path and Function features. Table 5 shows the clas­sification accuracy varies according to the feature set. It is clear that at least one of D-Path and Function is neces­sary for accurate classification. Interestingly, it seems that the best performance is achieved when D-Path is left out. This also reduces the classifier complexity since Func­tion has a much smaller range than D-Path. We performed a similar experiment for the constituent case (Table 6); here, the information about grammatical function is encoded in the C-Path and GovCat features. Here, the result suggests that both features are necessary for best ac­curacy - the C-Path feature should not be removed, which gives a more complex classifier since the number of possi­ble values for C-Path is very large.</p></subsection></section><section number="4." title="Perspectives"><p>For English, there exist both constituent and dependency parsers, and this study has shown that frame-semantic an­alyzers can use either representation. However, many lan­guages have only one type of parser as for Danish or Czech where annotated corpora only use dependencies. We hope these experiments will help clarify the design of seman­tic parsers by itemizing the available features and outlining their contribution.</p><p>The most significant difference seems to be whether the output syntactic structure contains information about gram­matical functions or not. In this study, we compared a de­pendency grammar that had a rich set of functions (39 la­bels) for verb dependents with one that had a small set (five labels), and showed that the richer set leads to a significant improvement in argument classification accuracy for verbs. For noun and adjective modifiers on the other hand, there was no difference in the set of grammatical functions, and consequently no difference in classification performance.</p><table caption="Table 5: Dependency-based role classification accuracy by feature set." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Feature set</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>D-Path Function</p></td><td class="cell"><p>All targets</p></td><td class="cell"><p>Verb targets</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>++</p></td><td class="cell"><p>69.9</p></td><td class="cell"><p>74.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>-+</p></td><td class="cell"><p>7G.G</p></td><td class="cell"><p>75.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>+-</p></td><td class="cell"><p>69.4</p></td><td class="cell"><p>74.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>-</b></p></td><td class="cell"><p>68.5*</p></td><td class="cell"><p>72.3*</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></tr></table><table caption="Table 3: Semantic argument detection performance." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Parser</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>Fl</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>Fl</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>MaltyP2M</p></td><td class="cell"><p>62.1</p></td><td class="cell"><p>52.0</p></td><td class="cell"><p>56.6</p></td><td class="cell"><p>64.5</p></td><td class="cell"><p>57.5</p></td><td class="cell"><p>60.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Malt/LTH</p></td><td class="cell"><p>65.6</p></td><td class="cell"><p>53.1</p></td><td class="cell"><p>58.7</p></td><td class="cell"><p>7G.2</p></td><td class="cell"><p>58.8</p></td><td class="cell"><p>64.G</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>MST/LTH</p></td><td class="cell"><p>57.6</p></td><td class="cell"><p>51.2</p></td><td class="cell"><p>54.2</p></td><td class="cell"><p>58.4</p></td><td class="cell"><p>54.9</p></td><td class="cell"><p>56.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Charniak</p></td><td class="cell"><p>65.8</p></td><td class="cell"><p>51.7</p></td><td class="cell"><p>57.9</p></td><td class="cell"><p>73.9</p></td><td class="cell"><p>61.7</p></td><td class="cell"><p>67.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Collins</p></td><td class="cell"><p>63.4</p></td><td class="cell"><p>53.G</p></td><td class="cell"><p>57.7</p></td><td class="cell"><p>73.5</p></td><td class="cell"><p>61.1</p></td><td class="cell"><p>66.7</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><table caption="Table 6: Constituent-based role classification accuracy by feature set." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Feature set</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>C-Path GovCat</p></td><td class="cell"><p>All targets</p></td><td class="cell"><p>Verb targets</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>++</p></td><td class="cell"><p>67.8</p></td><td class="cell"><p>69.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>-+</p></td><td class="cell"><p>66.9</p></td><td class="cell"><p>7G.1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>+-</p></td><td class="cell"><p>66.9</p></td><td class="cell"><p>69.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>-</b></p></td><td class="cell"><p>66.8</p></td><td class="cell"><p>68.5*</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></tr></table><table caption="Table 4: Semantic role classification accuracy." 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Parser</p></td><td class="cell"><p>All targets</p></td><td class="cell"><p>Verb targets</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>MaltyP2M</p></td><td class="cell"><p>69.5</p></td><td class="cell"><p>70.5*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Malt/LTH</p></td><td class="cell"><p>69.9</p></td><td class="cell"><p>74.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>MST/LTH</p></td><td class="cell"><p>7G.4</p></td><td class="cell"><p>73.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Charniak</p></td><td class="cell"><p>67.8*</p></td><td class="cell"><p>69.8*</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Collins</p></td><td class="cell"><p>68.9</p></td><td class="cell"><p>72.5</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></tr></table></section><references><p>Collin F. Baker, Charles J. Fillmore, and John B. Lowe. 1998. The Berkeley FrameNet Project. In <i>Proceedings of COLING-ACL.</i></p><p>Collin Baker. 2007. SemEval task 19: Frame semantic structure extraction. In <i>Proceedings of SemEval.</i></p><p>Aljoscha Burchardt, Katrin Erk, Anette Frank, Andrea Kowalski, Sebastian Pado, and Manfred Pinkal. 2006. The SALSA cor­pus: a German corpus resource for lexical semantics. In <i>Pro­ceedings ofLREC.</i></p><p>Xavier Carreras and Llufs Marquez. 2005. Introduction to the CoNLL-2005 shared task: Semantic role labeling. In <i>Proceed­ings of CoNLL-2005.</i></p><p>Eugene Charniak. 2000. A maximum-entropy-inspired parser. In <i>Proceedings ofNAACL.</i></p><p>Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In <i>Proceedings ofACL-EACL.</i></p><page local="5"/><p>Charles J. Fillmore. 1976. Frame semantics and the nature of lan­guage. <i>Annals ofthe New York Academy ofSciences: Confer­ence on the Origin and Development of Language, </i>280:20-32.</p><p>Daniel Gildea and Daniel Jurafsky. 2002. Automatic labeling of semantic roles. <i>Computational Linguistics, </i>28(3):245-288.</p><p>Daniel Gildea and Martha Palmer. 2002. The necessity of syntac­tic parsing for predicate argument recognition. In <i>Proceedings</i> <i>ofACL.</i><i></i></p><p>Jan Hajic. 1998. Building a syntactically annotated corpus: The Prague Dependency Treebank. In <i>Issues ofValency and Mean­ing, </i>pages 106-132.</p><p>Richard Johansson and Pierre Nugues. 2007a. Extended constituent-to-dependency conversion for English. In <i>Proceed­ings ofNODALIDA.</i></p><p>Richard Johansson and Pierre Nugues. 2007b. Semantic structure extraction using nonprojective dependency tress. In <i>Proceed­ings of SemEval-2007.</i></p><p>Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In <i>Proceedings</i> <i>ofEACL.</i><i></i></p><p>Joakim Nivre, Johan Hall, Jens Nilsson, Atanas Chanev, Gulsen Eryigit, Sandra Kubler, Svetoslav Marinov, and Erwin Marsi. 2007. MaltParser: A language-independent system for data-driven dependency parsing. <i>Natural Language Engineering, </i>13(2):95-135.</p><p>Vasin Punyakanok, Dan Roth, and Wen-tau Yih. 2005. The ne­cessity of syntactic parsing for semantic role labeling. In <i>Pro­ceedings ofIJCAI.</i></p><p>Nianwen Xue and Martha Palmer. 2004. Calibrating features for semantic role labeling. In <i>Proceedings ofEMNLP.</i></p></references></body></article>