163
click to vote
ICGI
15 years 9 months ago
2004 Springer 
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
161
click to vote
ICGI
15 years 9 months ago
2004 Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
152
click to vote
ICGI
15 years 9 months ago
2004 Springer
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
152
click to vote
ICGI
15 years 9 months ago
2004 Springer
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
151
click to vote
ICGI
15 years 9 months ago
2004 Springer
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
|
Natural Language Processing