Sciweavers

4095 search results - page 696 / 819
» How to test a tree
Sort
View
TREC
2007
13 years 9 months ago
Lucene and Juru at TREC 2007: 1-Million Queries Track
Lucene is an increasingly popular open source search library. However, our experiments of search quality for TREC data and evaluations for out-of-the-box Lucene indicated inferior...
Doron Cohen, Einat Amitay, David Carmel
AAIP
2009
13 years 9 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
CSL
2010
Springer
13 years 9 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis
CLEF
2009
Springer
13 years 9 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....
LDTA
2010
13 years 8 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju