Abstract is missing.
- Learning and MathematicsDana Angluin. 1-2 [doi]
- Learning Finite-State Models for Machine TranslationEnrique Vidal, Francisco Casacuberta. 3-15 [doi]
- The Omphalos Context-Free Grammar Learning CompetitionBradford Starkie, François Coste, Menno van Zaanen. 16-27 [doi]
- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFAJohn Abela, François Coste, Sandro Spina. 28-39 [doi]
- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate AdaptationPantelis G. Bagos, Theodore Liakopoulos, Stavros J. Hamodrakas. 40-52 [doi]
- Learning Mild Context-Sensitiveness: Toward Understanding Children s Language LearningLeonor Becerra-Bonache, Takashi Yokomori. 53-64 [doi]
- Learnability of Pregroup GrammarsDenis Béchet, Annie Foret, Isabelle Tellier. 65-76 [doi]
- A Markovian Approach to the Induction of Regular String DistributionsJérôme Callut, Pierre Dupont. 77-90 [doi]
- Learning Node Selecting Tree Transducer from Completely Annotated ExamplesJulien Carme, Aurélien Lemay, Joachim Niehren. 91-102 [doi]
- Identifying Clusters from Positive DataJohn Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan. 103-114 [doi]
- Introducing Domain and Typing Bias in Automata InferenceFrançois Coste, Daniel Fredouille, Christopher Kermorvant, Colin de la Higuera. 115-126 [doi]
- Analogical Equations in Sequences: Definition and ResolutionArnaud Delhay, Laurent Miclet. 127-138 [doi]
- Representing Languages by Learnable Rewriting SystemsRémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet. 139-150 [doi]
- A Divide-and-Conquer Approach to Acquire Syntactic CategoriesPablo Gamallo, Gabriel P. Lopes, Joaquim F. Da Silva. 151-162 [doi]
- Grammatical Inference Using Suffix TreesJeroen Geertzen, Menno van Zaanen. 163-174 [doi]
- Learning Stochastic Finite AutomataColin de la Higuera, José Oncina. 175-186 [doi]
- Navigation Pattern Discovery Using Grammatical InferenceNikolaos Karampatziakis, Georgios Paliouras, Dimitrios Pierrakos, Panagiotis Stamatopoulos. 187-198 [doi]
- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure GrammarHans-Ulrich Krieger. 199-210 [doi]
- Partial Learning Using Link Grammars DataErwan Moreau. 211-222 [doi]
- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic SearchGeorgios Petasis, Georgios Paliouras, Constantine D. Spyropoulos, Constantine Halatsis. 223-234 [doi]
- The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive DataBradford Starkie, Henning Fernau. 235-247 [doi]
- Learning Stochastic Deterministic Regular LanguagesFranck Thollard, Alexander Clark. 248-259 [doi]
- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive DataMitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita. 260-272 [doi]
- Learning Syntax from Function WordsDavid Brooks, Mark Lee. 273-274 [doi]
- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable LanguagesAntonio Cano, José Ruiz, Pedro Garcia. 275-276 [doi]
- Extracting Minimum Length Document Type Definitions Is NP-HardHenning Fernau. 277-278 [doi]
- Learning Distinguishable Linear Grammars from Positive DataJ. A. Laxminarayana, José M. Sempere, G. Nagaraja. 279-280 [doi]
- Extending Incremental Learning of Context Free Grammars in SynapseKatsuhiko Nakamura. 281-282 [doi]
- Identifying Left-Right Deterministic Linear LanguagesJorge Calera-Rubio, José Oncina. 283-284 [doi]
- Efficient Learning of ::::k::::-Reversible Context-Free Grammars from Positive Structural ExamplesShinnosuke Seki, Satoshi Kobayashi. 285-287 [doi]
- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership QueriesYasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada. 288-289 [doi]