Skip to main content
  • Conference proceedings
  • © 2000

Grammatical Inference: Algorithms and Applications

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

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)

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

  2. Computational Complexity of Problems on Probabilistic Grammars and Transducers

    • Francisco Casacuberta, Colin de la Higuera
    Pages 15-24
  3. Efficient Ambiguity Detection in C-NFA

    • François Coste, Daniel Fredouille
    Pages 25-38
  4. Learning Regular Languages Using Non Deterministic Finite Automata

    • François Denis, Aurélien Lemay, Alain Terlutte
    Pages 39-50
  5. Smoothing Probabilistic Automata: An Error-Correcting Approach

    • Pierre Dupont, Juan-Carlos Amengual
    Pages 51-64
  6. Inferring Subclasses of Contextual Languages

    • J. D. Emerald, K. G. Subramanian, D. G. Thomas
    Pages 65-74
  7. Permutations and Control Sets for Learning Non-regular Language Families

    • Henning Fernau, José M. Sempere
    Pages 75-88
  8. A Comparative Study of Two Algorithms for Automata Identification

    • P. García, A. Cano, J. Ruiz
    Pages 115-126
  9. 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
  10. Probabilistic k-Testable Tree Languages

    • Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
    Pages 221-228
  11. Learning Context-Free Grammars from Partially Structured Examples

    • Yasubumi Sakakibara, Hidenori Muramatsu
    Pages 229-240

Keywords

  • Automat
  • Natural
  • algorithms
  • automata
  • computational linguistics
  • learning
  • linguistics
  • machine learning
  • pattern recognition
  • algorithm analysis and problem complexity

Editors and Affiliations

  • INESC-ID/IST, Lisboa, Portugal

    Arlindo L. Oliveira

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions