Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICGI
2004
Springer
10 years 9 months ago
Learning Finite-State Models for Machine Translation
Enrique Vidal, Francisco Casacuberta
ICGI
2004
Springer
10 years 9 months ago
The Omphalos Context-Free Grammar Learning Competition
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 ...
Bradford Starkie, François Coste, Menno van...
ICGI
2004
Springer
10 years 9 months ago
Representing Languages by Learnable Rewriting Systems
Rémi Eyraud, Colin de la Higuera, Jean-Chri...
ICGI
2004
Springer
10 years 9 months ago
Partial Learning Using Link Grammars Data
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...
Erwan Moreau
ICGI
2004
Springer
10 years 9 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
ICGI
2004
Springer
10 years 9 months ago
Navigation Pattern Discovery Using Grammatical Inference
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...
Nikolaos Karampatziakis, Georgios Paliouras, Dimit...
ICGI
2004
Springer
10 years 9 months ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
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 ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
ICGI
2004
Springer
10 years 9 months ago
Learning Stochastic Finite Automata
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...
Colin de la Higuera, José Oncina
ICGI
2004
Springer
10 years 9 months ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina
ICGI
2004
Springer
10 years 9 months ago
Learnability of Pregroup Grammars
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 ...
Denis Béchet, Annie Foret, Isabelle Tellier
books