35 search results - page 5 / 7 » Making Tree Kernels Practical for Natural Language Learning |
EACL
2006
ACL Anthology
14 years 11 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
77
Voted
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
ECML
2003
Springer
15 years 2 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
ACL
2010
14 years 7 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
103
click to vote
JMLR
2008
14 years 9 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...