Skip to main content
SpringerLink
Log in

Grammatical Inference: Algorithms and Applications

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

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Arlindo L. Oliveira

    1. INESC-ID/IST, Lisboa, Portugal

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter 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
Back to top

Keywords

Editors and Affiliations

  • INESC-ID/IST, Lisboa, Portugal

    Arlindo L. Oliveira

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation