203
click to vote
ICGI
16 years 2 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 ...
202
click to vote
ICGI
16 years 2 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...
191
click to vote
ICGI
16 years 2 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...
189
click to vote
ICGI
16 years 2 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 ...
187
click to vote
ICGI
16 years 2 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...
|
Natural Language Processing