Advertisement

Grammatical Inference: Algorithms and Applications

5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000. Proceedings

  • Arlindo L. Oliveira
Conference proceedings ICGI 2000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1891)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 1891)

Table of contents

  1. Front Matter
    PDF
  2. Inference of Finite-State Transducers by Using Regular Grammars and Morphisms
    Francisco Casacuberta
    Pages 1-14
  3. Computational Complexity of Problems on Probabilistic Grammars and Transducers
    Francisco Casacuberta, Colin de la Higuera
    Pages 15-24
  4. Efficient Ambiguity Detection in C-NFA
    François Coste, Daniel Fredouille
    Pages 25-38
  5. Learning Regular Languages Using Non Deterministic Finite Automata
    François Denis, Aurélien Lemay, Alain Terlutte
    Pages 39-50
  6. Smoothing Probabilistic Automata: An Error-Correcting Approach
    Pierre Dupont, Juan-Carlos Amengual
    Pages 51-64
  7. Inferring Subclasses of Contextual Languages
    J. D. Emerald, K. G. Subramanian, D. G. Thomas
    Pages 65-74
  8. Permutations and Control Sets for Learning Non-regular Language Families
    Henning Fernau, José M. Sempere
    Pages 75-88
  9. On the Complexity of Consistent Identification of Some Classes of Structure Languages
    Christophe Costa Florêncio
    Pages 89-102
  10. Computation of Substring Probabilities in Stochastic Grammars
    Ana L. N. Fred
    Pages 103-114
  11. A Comparative Study of Two Algorithms for Automata Identification
    P. García, A. Cano, J. Ruiz
    Pages 115-126
  12. The Induction of Temporal Grammatical Rules from Multivariate Time Series
    G. Guimarães
    Pages 127-140
  13. Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
    Colin de la Higuera, Franck Thollard
    Pages 141-156
  14. Iterated Transductions and Efficient Learning from Positive Data: A Unifying View
    Satoshi Kobayashi
    Pages 157-170
  15. An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit
    Pavel Martinek
    Pages 171-185
  16. Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm
    Katsuhiko Nakamura, Takashi Ishiwata
    Pages 186-195
  17. Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars
    Francisco Nevado, Joan-Andreu Sánchez, José-Miguel Benedí
    Pages 196-206
  18. On the Relationship between Models for Learning in Helpful Environments
    Rajesh Parekh, Vasant Honavar
    Pages 207-220
  19. Probabilistic k-Testable Tree Languages
    Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
    Pages 221-228
  20. Learning Context-Free Grammars from Partially Structured Examples
    Yasubumi Sakakibara, Hidenori Muramatsu
    Pages 229-240
  21. Identification of Tree Translation Rules from Examples
    Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
    Pages 241-255
  22. Counting Extensional Differences in BC-Learning
    Frank Stephan, Sebastiaan A. Terwijn
    Pages 256-269
  23. Constructive Learning of Context-Free Languages with a Subpansive Tree 
    Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
    Pages 270-283
  24. A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample
    Yasuhiro Tajima, Etsuji Tomita
    Pages 284-297
  25. Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries
    Juan Miguel Vilar
    Pages 298-311
  26. Back Matter
    PDF

About these proceedings

Keywords

Automat Natural algorithms automata computational linguistics learning linguistics machine learning pattern recognition

Editors and affiliations

  • Arlindo L. Oliveira
    • 1
  1. 1.INESC-ID/ISTLisboaPortugal

Bibliographic information

  • DOI https://doi.org/10.1007/b75249
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41011-9
  • Online ISBN 978-3-540-45257-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site