Sciweavers

81 search results - page 7 / 17
» Decision Tree Parsing using a Hidden Derivation Model
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 9 months ago
Fully-Functional Succinct Trees
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...
Kunihiko Sadakane, Gonzalo Navarro
EMNLP
2009
14 years 9 months ago
A Joint Language Model With Fine-grain Syntactic Tags
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...
Denis Filimonov, Mary P. Harper
EDBT
2006
ACM
130views Database» more  EDBT 2006»
15 years 11 months ago
Querying and Updating Probabilistic Information in XML
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...
Serge Abiteboul, Pierre Senellart
TSD
2007
Springer
15 years 5 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
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...
Reut Tsarfaty, Khalil Sima'an
EMNLP
2004
15 years 1 months ago
Induction of Greedy Controllers for Deterministic Treebank Parsers
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 ...
Tom Kalt