


default search action
3. ICGI 1996: Montpellier, France
- Laurent Miclet, Colin de la Higuera

:
Grammatical Inference: Learning Syntax from Sentences, 3rd International Colloquium, ICGI-96, Montpellier, France, September 25-27, 1996, Proceedings. Lecture Notes in Computer Science 1147, Springer 1996, ISBN 3-540-61778-7
Invited Talks
- David M. Magerman:

Learning grammatical stucture using statistical decision-trees. 1-21 - Timo Knuutila:

Inductive inference from positive data: from heuristic to characterizing methods. 22-47
Session: Algebraic Methods and Algorithms 1
- Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs

:
Unions of identifiable families of languages. 48-58 - Colin de la Higuera

:
Characteristic sets for polynominal grammatical inference. 59-71 - Juan Miguel Vilar

:
Query learning of subsequential transducers. 72-83
Session: Natural Language and Pattern Recognition
- Michael R. Brent, Timothy A. Cartwright:

Lexical categorization: fitting template grammars by incremental MDL optimization. 84-94 - Christoph Tillmann, Hermann Ney:

Selection criteria for word trigger pairs in language modelling. 95-106 - Ana L. N. Fred

:
Clustering of sequences using minimum grammar compexity criterion. 107-116
Session: Algebraic Methods and Algorithms 2
- Yuji Takada, Taishin Y. Nishida

:
A note on grammatical inference of slender context-free languages. 117-125 - José M. Sempere

, Antonio Fos:
Learning linear grammars from structural information. 126-133 - René Alquézar, Alberto Sanfeliu

, Jordi Cueva:
Learning of context-sensitive language acceptors through regular inference and constrained induction. 134-145 - Christer Samuelsson, Pasi Tapanainen, Atro Voutilainen:

Inducing constraint grammars. 146-155
Session: Inference of Stochastic Models 1
- Sabine Deligne, François Yvon

, Frédéric Bimbot:
Introducing statistical dependencies and structural constraints in variable-length sequence models. 156-167 - Jens Gregor, Michael G. Thomason:

A disagreement count scheme for inference of constrained Markov networks. 168-178 - Enrique Vidal, David Llorens:

Using knowledge to improve N-gram language modelling through the MGGI methodology. 179-190 - Reinhard Blasig:

Discrete sequence prediction with commented Markov models. 191-202
Session: Algebraic Methods and Algorithms 3
- José Ruiz, Pedro García:

Learning k-piecewise testable languages from positive data. 203-210 - J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas:

Learning code regular and code linear languages. 211-221
Session: Incremental Methods and Inductive Logic Programming
- Pierre Dupont:

Incremental regular inference. 222-237 - Rajesh Parekh, Vasant G. Honavar:

An incremental interactive algorithm for grammar inference. 238-249 - David Lorenzo:

Inductive logic programming for discrete event systems. 250-261
Session: Inference of Stochastic Models 2
- Mostefa Golea, Masahiro Matsuoka, Yasubumi Sakakibara:

Stochastic simple recurrent neural networks. 262-273 - Rafael C. Carrasco

, Mikel L. Forcada, Laureano Santamaría:
Inferring stochastic regular grammars with recurrent neural networks. 274-281 - Francisco Casacuberta:

Maximum mutual information and conditional maximum likelihood estimation of stochastic regular syntax-directed translation schemes. 282-291
Session: Operational Issues
- Jean-Yves Giordano:

Grammatical inference using tabu search. 292-300 - José Oncina

, Miguel Angel Varó:
Using domain information during the learning of a subsequential transducer. 301-312 - Colin de la Higuera

, José Oncina
, Enrique Vidal:
Identification of DFA: data-dependent vs data-independent algorithms. 313-325

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














