default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. ICGI 2004: Athens, Greece
- Georgios Paliouras, Yasubumi Sakakibara:
Grammatical Inference: Algorithms and Applications, 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004, Proceedings. Lecture Notes in Computer Science 3264, Springer 2004, ISBN 3-540-23410-1
Invited Papers
- Dana Angluin:
Learning and Mathematics. 1-2 - Enrique Vidal, Francisco Casacuberta:
Learning Finite-State Models for Machine Translation. 3-15 - Bradford Starkie, François Coste, Menno van Zaanen
:
The Omphalos Context-Free Grammar Learning Competition. 16-27
Regular Papers
- John Abela, François Coste, Sandro Spina:
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA. 28-39 - Pantelis G. Bagos, Theodore Liakopoulos, Stavros J. Hamodrakas:
Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation. 40-52 - Leonor Becerra-Bonache, Takashi Yokomori:
Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning. 53-64 - Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. 65-76 - Jérôme Callut, Pierre Dupont:
A Markovian Approach to the Induction of Regular String Distributions. 77-90 - Julien Carme, Aurélien Lemay, Joachim Niehren:
Learning Node Selecting Tree Transducer from Completely Annotated Examples. 91-102 - John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. 103-114 - François Coste, Daniel Fredouille, Christopher Kermorvant, Colin de la Higuera:
Introducing Domain and Typing Bias in Automata Inference. 115-126 - Arnaud Delhay, Laurent Miclet:
Analogical Equations in Sequences: Definition and Resolution. 127-138 - Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet:
Representing Languages by Learnable Rewriting Systems. 139-150 - Pablo Gamallo, Gabriel Pereira Lopes, Joaquim Ferreira da Silva:
A Divide-and-Conquer Approach to Acquire Syntactic Categories. 151-162 - Jeroen Geertzen, Menno van Zaanen:
Grammatical Inference Using Suffix Trees. 163-174 - Colin de la Higuera, José Oncina:
Learning Stochastic Finite Automata. 175-186 - Nikolaos Karampatziakis, Georgios Paliouras, Dimitrios Pierrakos, Panagiotis Stamatopoulos:
Navigation Pattern Discovery Using Grammatical Inference. 187-198 - Hans-Ulrich Krieger:
A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar. 199-210 - Erwan Moreau:
Partial Learning Using Link Grammars Data. 211-222 - Georgios Petasis, Georgios Paliouras, Constantine D. Spyropoulos, Constantine Halatsis:
eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search. 223-234 - Bradford Starkie, Henning Fernau:
The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data. 235-247 - Franck Thollard, Alexander Clark:
Learning Stochastic Deterministic Regular Languages. 248-259 - Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita:
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. 260-272
Poster Papers
- David Brooks, Mark Lee:
Learning Syntax from Function Words. 273-274 - Antonio Cano, José Ruiz, Pedro García:
Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages. 275-276 - Henning Fernau:
Extracting Minimum Length Document Type Definitions Is NP-Hard. 277-278 - J. A. Laxminarayana, José M. Sempere, G. Nagaraja:
Learning Distinguishable Linear Grammars from Positive Data. 279-280 - Katsuhiko Nakamura:
Extending Incremental Learning of Context Free Grammars in Synapse. 281-282 - Jorge Calera-Rubio, José Oncina:
Identifying Left-Right Deterministic Linear Languages. 283-284 - Shinnosuke Seki, Satoshi Kobayashi:
Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples. 285-287 - Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada:
An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. 288-289
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-30 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
