Advertisement

Finite-State Methods and Natural Language Processing

8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers

  • Anssi Yli-Jyrä
  • András Kornai
  • Jacques Sakarovitch
  • Bruce Watson
Conference proceedings FSMNLP 2009

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

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

Table of contents

  1. Front Matter
    PDF

  2. Tutorials

    1. Learning Finite State Machines
      Colin de la Higuera
      Pages 1-10

  3. Special Theme Tutorials

    1. Developing Computational Morphology for Low- and Middle-Density Languages
      Kemal Oflazer
      Pages 11-12

  4. Invited Papers

    1. fsm2 – A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata
      Thomas Hanneforth
      Pages 13-30
    2. Selected Operations and Applications of n-Tape Weighted Finite-State Machines
      André Kempe
      Pages 31-46
    3. OpenFst
      Johan Schalkwyk
      Pages 47-47

  5. Special Theme Invited Talks

    1. Morphological Analysis of Tone Marked Kinyarwanda Text
      Jackson Muhirwe
      Pages 48-55

  6. Regular Papers

    1. Minimizing Weighted Tree Grammars Using Simulation
      Andreas Maletti
      Pages 56-68
    2. Compositions of Top-Down Tree Transducers with ε-Rules
      Andreas Maletti, Heiko Vogler
      Pages 69-80
    3. Reducing Nondeterministic Finite Automata with SAT Solvers
      Jaco Geldenhuys, Brink van der Merwe, Lynette van Zijl
      Pages 81-92
    4. Joining Composition and Trimming of Finite-State Transducers
      Johannes Bubenzer, Kay-Michael Würzner
      Pages 93-104

  7. Special Theme Extended Abstracts

    1. Porting Basque Morphological Grammars to foma, an Open-Source Tool
      Iñaki Alegria, Izaskun Etxeberria, Mans Hulden, Montserrat Maritxalar
      Pages 105-113
    2. Describing Georgian Morphology with a Finite-State System
      Oleg Kapanadze
      Pages 114-122
    3. Finite State Morphology of the Nguni Language Cluster: Modelling and Implementation Issues
      Laurette Pretorius, Sonja Bosch
      Pages 123-130
    4. A Finite State Approach to Setswana Verb Morphology
      Laurette Pretorius, Biffie Viljoen, Rigardt Pretorius, Ansu Berg
      Pages 131-138

  8. Competition Announcements

    1. Zulu: An Interactive Learning Competition
      David Combe, Colin de la Higuera, Jean-Christophe Janodet
      Pages 139-146
  9. Back Matter
    PDF

About these proceedings

Keywords

Natural Processing SAT solvers computational linguistics finite automata finite state machines morphological analysis natural language

Editors and affiliations

  • Anssi Yli-Jyrä
    • 1
  • András Kornai
    • 2
  • Jacques Sakarovitch
    • 3
  • Bruce Watson
    • 4
  1. 1.Department of Modern LanguagesUniversity of HelsinkiFinland
  2. 2.Institute for Quantitative Social ScienceHarvard UniversityCambridgeUSA
  3. 3.Laboratoire Traitement et Communication de L’Informations, Département Infoamtique et RéseauxCNRSParis Cedex 13France
  4. 4.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14684-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14683-1
  • Online ISBN 978-3-642-14684-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Biotechnology
Electronics
IT & Software
Telecommunications
Aerospace
Engineering