118 search results - page 17 / 24 » Japanese Dependency Parsing Using a Tournament Model |
NIPS
2000
13 years 9 months ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
TSD
2007
Springer
14 years 1 months ago
2007
Springer
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
ACL
2010
13 years 5 months ago
2010
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...