Sciweavers

342 search results - page 1 / 69
» Using Decision Trees to Construct a Practical Parser
Sort
View
ACL
1998
13 years 6 months ago
Using Decision Trees to Construct a Practical Parser
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
Masahiko Haruno, Satoshi Shirai, Yoshifumi Ooyama
ACL
2006
13 years 6 months ago
From Prosodic Trees to Syntactic Trees
This paper describes an ongoing effort to parse the Hebrew Bible. The parser consults the bracketing information extracted from the cantillation marks of the Masoetic text. We fir...
Andi Wu, Kirk Lowery
ENTCS
2000
103views more  ENTCS 2000»
13 years 4 months ago
Combinator Parsers - From Toys to Tools
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
S. Doaitse Swierstra
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 2 months ago
A Practical Differentially Private Random Decision Tree Classifier
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
ACL
2006
13 years 6 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura