Dependency-based syntactic-semantic analysis with PropBank and NomBank
Published 1 January 2008Open access
Richard Johansson, Pierre Nugues
Citations150
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents the contribution in the closed track of the 2008 CoNLL Shared Task (Surdeanu et al., 2008), to tackle the problem of joint syntactic--semantic analysis, which relies on a syntactic and a semantic subcomponent.
Abstract
This paper presents our contribution in the closed track of the 2008 CoNLL Shared Task (Surdeanu et al., 2008). To tackle the problem of joint syntactic--semantic analysis, the system relies on a syntactic and a semantic subcomponent. The syntactic model is a bottom-up projective parser using pseudo-projective transformations, and the semantic model uses global inference mechanisms on top of a pipeline of classifiers. The complete syntactic--semantic output is selected from a candidate pool generated by the subsystems.
Keywords
Computer Science
Machine LearningLearning Bayesian networks: The combination of knowledge and statistical data
2,043 Citations1995David Heckerman, Dan Geiger +1 more
It is shown that likelihood equivalence when combined with previously made assumptions implies that the user's priors for network parameters can be encoded in a single Bayesian network for the next case to be seen—aprior network—and a single measure of confidence for that network.
Online Passive-Aggressive Algorithms
1,449 Citations2006Koby Crammer, Ofer Dekel +3 more
Max-Margin Markov Networks
1,251 Citations2003Ben Taskar, Carlos Guestrin +1 more
Maximum margin Markov (M3) networks incorporate both kernels, which efficiently deal with high-dimensional features, and the ability to capture correlations in structured data, and a new theoretical bound for generalization in structured domains is provided.
Journal of Machine Learning ResearchOnline Passive-Aggressive Algorithms
899 Citations2006CrammerKoby, DekelOfer +3 more
Three new probabilistic models for dependency parsing
630 Citations1996Jason Eisner
Preliminary empirical results from evaluating the three models' parsing performance on annotated Wall Street Journal training text (derived from the Penn Treebank) suggest the generative model performs significantly better than the others, and does about equally well at assigning part-of-speech tags.
The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies
499 Citations2008Mihai Surdeanu, Richard Johansson +3 more
This shared task not only unifies the shared tasks of the previous four years under a unique dependency-based formalism, but also extends them significantly: this year's syntactic dependencies include more information such as named-entity boundaries; the semantic dependencies model roles of both verbal and nominal predicates.
Online Learning of Approximate Dependency Parsing Algorithms.
479 Citations2006Ryan McDonald, Fernando C. N. Pereira
This paper extends the maximum spanning tree dependency parsing framework to incorporate higher-order feature representations and allow dependency structures with multiple parents per word, and shows that those extensions can make the MST framework computationally intractable, but that the intractability can be circumvented with new approximate parsing algorithms.
Pseudo-projective dependency parsing
291 Citations2005Joakim Nivre, Jens Nilsson
Experiments show that the combined system can handle non-projective constructions with a precision sufficient to yield a significant improvement in overall parsing accuracy, leading to the best reported performance for robust non- projective parsing of Czech.
Trust region Newton methods for large-scale logistic regression
287 Citations2007Chih‐Jen Lin, Ruby C. Weng +1 more
This paper applies a trust region Newton method to maximize the log-likelihood of the logistic regression model, which uses only approximate Newton steps in the beginning, but achieves fast convergence in the end.
Journal of Machine Learning ResearchTrust Region Newton Method for Logistic Regression
287 Citations2008Chih‐Jen Lin, Ruby C. Weng +1 more
This paper applies a trust region Newton method to maximize the log-likelihood of the logistic regression model, and extends the proposed method to large-scale L2-loss linear support vector machines (SVM).
Elsevier eBooksLearning Bayesian Networks: The Combination of Knowledge and Statistical Data
259 Citations1994David Heckerman, Dan Geiger +1 more
Experiments with a Higher-Order Projective Dependency Parser
238 Citations2007Xavier Carreras
In the multilingual exercise of the CoNLL-2007 shared task (Nivre et al., 2007), the system obtains the best accuracy for English, and the second best accuracies for Basque and Czech.
Joint learning improves semantic role labeling
182 Citations2005Kristina Toutanova, Aria Haghighi +1 more
This work shows how to build a joint model of argument frames, incorporating novel features that model these interactions into discriminative log-linear models, achieving error reduction of 22% on all arguments and 32% on core arguments over a state-of-the art independent classifier for gold-standard parse trees on PropBank.
arXiv (Cornell University)Three New Probabilistic Models for Dependency Parsing: An Exploration
165 Citations1997Jason Eisner