229
Voted
ICGI
16 years 23 days 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...
226
click to vote
ICGI
16 years 23 days 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 ...
219
Voted
ICGI
16 years 23 days 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...
212
click to vote
ICGI
16 years 23 days ago
2004 Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
209
Voted
ICGI
16 years 23 days 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 ...
|
Natural Language Processing