|
Conferences in DBLP
- Dana Angluin
Learning and Mathematics. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:1-2 [Conf]
- Enrique Vidal, Francisco Casacuberta
Learning Finite-State Models for Machine Translation. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:3-15 [Conf]
- Bradford Starkie, François Coste, Menno van Zaanen
The Omphalos Context-Free Grammar Learning Competition. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:16-27 [Conf]
- John Abela, François Coste, Sandro Spina
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:28-39 [Conf]
- Pantelis G. Bagos, Theodore Liakopoulos, Stavros J. Hamodrakas
Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:40-52 [Conf]
- Leonor Becerra-Bonache, Takashi Yokomori
Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:53-64 [Conf]
- Denis Bechet, Annie Foret, Isabelle Tellier
Learnability of Pregroup Grammars. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:65-76 [Conf]
- Jérôme Callut, Pierre Dupont
A Markovian Approach to the Induction of Regular String Distributions. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:77-90 [Conf]
- Julien Carme, Aurélien Lemay, Joachim Niehren
Learning Node Selecting Tree Transducer from Completely Annotated Examples. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:91-102 [Conf]
- John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan
Identifying Clusters from Positive Data. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:103-114 [Conf]
- François Coste, Daniel Fredouille, Christopher Kermorvant, Colin de la Higuera
Introducing Domain and Typing Bias in Automata Inference. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:115-126 [Conf]
- Arnaud Delhay, Laurent Miclet
Analogical Equations in Sequences: Definition and Resolution. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:127-138 [Conf]
- Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet
Representing Languages by Learnable Rewriting Systems. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:139-150 [Conf]
- Pablo Gamallo, Gabriel P. Lopes, Joaquim F. Da Silva
A Divide-and-Conquer Approach to Acquire Syntactic Categories. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:151-162 [Conf]
- Jeroen Geertzen, Menno van Zaanen
Grammatical Inference Using Suffix Trees. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:163-174 [Conf]
- Colin de la Higuera, José Oncina
Learning Stochastic Finite Automata. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:175-186 [Conf]
- Nikolaos Karampatziakis, Georgios Paliouras, Dimitrios Pierrakos, Panagiotis Stamatopoulos
Navigation Pattern Discovery Using Grammatical Inference. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:187-198 [Conf]
- Hans-Ulrich Krieger
A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:199-210 [Conf]
- Erwan Moreau
Partial Learning Using Link Grammars Data. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:211-222 [Conf]
- Georgios Petasis, Georgios Paliouras, Constantine D. Spyropoulos, Constantine Halatsis
eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:223-234 [Conf]
- Bradford Starkie, Henning Fernau
The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:235-247 [Conf]
- Franck Thollard, Alexander Clark
Learning Stochastic Deterministic Regular Languages. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:248-259 [Conf]
- Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:260-272 [Conf]
- David Brooks, Mark Lee
Learning Syntax from Function Words. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:273-274 [Conf]
- Antonio Cano, José Ruiz, Pedro García
Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:275-276 [Conf]
- Henning Fernau
Extracting Minimum Length Document Type Definitions Is NP-Hard. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:277-278 [Conf]
- J. A. Laxminarayana, José M. Sempere, G. Nagaraja
Learning Distinguishable Linear Grammars from Positive Data. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:279-280 [Conf]
- Katsuhiko Nakamura
Extending Incremental Learning of Context Free Grammars in Synapse. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:281-282 [Conf]
- Jorge Calera-Rubio, José Oncina
Identifying Left-Right Deterministic Linear Languages. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:283-284 [Conf]
- Shinnosuke Seki, Satoshi Kobayashi
Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:285-287 [Conf]
- Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada
An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:288-289 [Conf]
|