81 search results - page 7 / 17 » Decision Tree Parsing using a Hidden Derivation Model |
146
Voted
SODA
2010
ACM
16 years 25 days ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
133
Voted
EMNLP
2009
15 years 1 months ago
2009
We present a scalable joint language model designed to utilize fine-grain syntactic tags. We discuss challenges such a design faces and describe our solutions that scale well to l...
119
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
152
Voted
TSD
2007
Springer
15 years 9 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...
126
Voted
EMNLP
2004
15 years 4 months ago
2004
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...