Computational Structures for RE | We will use this gold information also in Section 6.1 to show that our system aligns well to the state of the art on the ACE 2004 benchmark. |
Experimental Setup | To compare our model against the state of the art we use the ACE 2004 data. |
Introduction | We first show that our system aligns well with the state of the art on the ACE 2004 benchmark. |
Results | Table 3 shows that our system (bottom) aligns well with the state of the art . |
Abstract | PARMA achieves state of the art results on an existing and a new dataset. |
Conclusion | PARMA achieves state of the art performance on three datasets for predicate argument alignment. |
Introduction | We demonstrate the effectiveness of this approach by achieving state of the art performance on the data of Roth and Frank despite having little relevant training data. |
Results | On RF, compared to Roth and Frank, the best published method for this task, we also improve, making PARMA the state of the art system for this task. |
Abstract | In addition, we present results for a full system using additional features which achieves close to state of the art performance without resorting to gold syntactic parses or to context outside the relation. |
Conclusion | (2009), who used mostly similar features, for comparison and temporal and is competitive with the most recent state of the art systems for contingency and expansion without using any syntactic or context features. |
Introduction | In addition, we present a system which combines these word pairs with additional features to achieve near state of the art performance without the use of syntactic parse features and of context outside the arguments of the relation. |
Experiments | — Overall, our models compare favourably with the state of the art . |
Experiments | With an additional, unsupervised training step we achieved results beyond the current state of the art on this task, too. |
Introduction | We show that this combination of state of the art machine learning and an advanced linguistic formalism translates into concise models with competitive performance on a variety of tasks. |