47 search results - page 4 / 10 » Tree Sequence Kernel for Natural Language |
137
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
168
click to vote
JMLR
2008
15 years 4 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...
144
click to vote
ACL
2012
13 years 6 months ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
137
click to vote
EMNLP
2009
15 years 1 months ago
2009
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
125
click to vote
COLING
2008
15 years 5 months ago
2008
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...