5699 search results - page 73 / 1140 » Alternating model trees |
123
click to vote
NAACL
2003
15 years 5 months ago
2003
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
162
click to vote
ACL
1996
15 years 5 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
146
click to vote
JCSS
2007
15 years 4 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
137
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
157
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Rule extraction is a technique aimed at transforming highly accurate opaque models like neural networks into comprehensible models without losing accuracy. G-REX is a rule extract...