


default search action
6. ICGI 2002: Amsterdam, The Netherlands
- Pieter W. Adriaans, Henning Fernau, Menno van Zaanen:

Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings. Lecture Notes in Computer Science 2484, Springer 2002, ISBN 3-540-44239-1
Contributions
- Cláudia Antunes, Arlindo L. Oliveira

:
Inference of Sequential Association Rules Guided by Context-Free Grammars. 1-13 - Anja Belz

:
PCFG Learning by Nonterminal Partition Search. 14-27 - Antonio Cano, José Ruiz, Pedro García:

Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations. 28-36 - Orlando Cicchello, Stefan C. Kremer:

Beyond EDSM. 37-48 - Christophe Costa Florêncio:

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. 49-62 - François Denis, Aurélien Lemay, Alain Terlutte:

Some Classes of Regular Languages Identifiable in the Limit from Positive Data. 63-76 - Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont:

Learning Probabilistic Residual Finite State Automata. 77-91 - Henning Fernau

:
Fragmentation: Enhancing Identifiability. 92-105 - Annie Foret, Yannick Le Nir:

On Limit Points for Some Variants of Rigid Lambek Grammars. 106-119 - Amaury Habrard, Marc Bernard, François Jacquenet:

Generalized Stochastic Tree Automata for Multi-relational Data Mining. 120-133 - Colin de la Higuera

, José Oncina
:
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data. 134-148 - Christopher Kermorvant, Pierre Dupont:

Stochastic Grammatical Inference with Multinomial Tests. 149-160 - Christopher Kermorvant, Colin de la Higuera

:
Learning Languages with Help. 161-173 - Katsuhiko Nakamura, Masashi Matsumoto:

Incremental Learning of Context Free Grammars. 174-184 - Tim Oates, Brent Heeringa:

Estimating Grammar Parameters Using Bounded Memory. 185-198 - Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco:

Stochastic k-testable Tree Languages and Applications. 199-212 - Yoav Seginer:

Fast Learning from Strings of 2-Letter Rigid Grammars. 213-224 - José M. Sempere, Pedro García:

Learning Locally Testable Even Linear Languages from Positive Data. 225-236 - Bradford Starkie:

Inferring Attribute Grammars with Structured Data for Natural Language Processing. 237-248 - Yasuhiro Tajima, Matsuaki Terada:

A PAC Learnability of Simple Deterministic Languages. 249-260 - Sebastiaan Terwijn:

On the Learnability of Hidden Markov Models. 261-268 - Franck Thollard, Alexander Clark:

Shallow Parsing Using Probabilistic Grammatical Inference. 269-282 - D. Gnanaraj Thomas, M. Humrosia Begam, K. G. Subramanian, S. Gnanasekaran:

Learning of Regular Bi-omega Languages. 283-292
Software Descriptions
- Pieter W. Adriaans, Marco Vervoort:

The EMILE 4.1 Grammar Induction Toolbox. 293-295 - Stephan K. Chalup, Alan D. Blair

:
Software for Analysing Recurrent Neural Nets That Learn to Predict Non-regular Languages. 296-298 - Liviu-Virgil Ciortuz

:
A Framework for Inductive Learning of Typed-Unification Grammars. 299-302 - Daniela Dudau Sofronie, Isabelle Tellier, Marc Tommasi:

A Tool for Language Learning Based on Categorial Grammars and Semantic Information. 303-305 - Sam Lievesley, Eric Atwell

:
'NAIL': Artificial Intelligence Software for Learning Natural Language. 306-308 - Bradford Starkie, Greg Findlow, Khanh Ho, Alvaro Hui, Lawrence Law, Liron Lightwood, Simon Michnowicz, Christian J. Walder:

LyrebirdTM: Developing Spoken Dialog Systems Using Examples. 309-311 - Menno van Zaanen

:
Implementing Alignment-Based Learning. 312-314

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














