Finite-State Methods and Natural Language Processing

5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers

  • Anssi Yli-Jyrä
  • Lauri Karttunen
  • Juhani Karhumäki
Conference proceedings FSMNLP 2005

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

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

Table of contents

  1. Front Matter
  2. Invited Lectures

    1. Tero Harju
      Pages 1-8
    2. Lauri Karttunen
      Pages 9-10
  3. Contributed Papers

    1. François Barthélemy
      Pages 11-20
    2. Tamás Bíró
      Pages 21-31
    3. Jorge Civera, Juan M. Vilar, Elsa Cubel, Antonio L. Lagarda, Sergio Barrachina, Francisco Casacuberta et al.
      Pages 32-42
    4. Yael Cohen-Sygal, Shuly Wintner
      Pages 43-54
    5. Mans Hulden
      Pages 86-96
    6. Martin Jansche
      Pages 97-109
    7. A. Kempe, J. -M. Champarnaud, F. Guingne, F. Nicart
      Pages 120-131
    8. Takashi Miyata, Kôiti Hasida
      Pages 144-155
    9. Kemal Oflazer, Mehmet Dinçer Erbaş, Müge Erdoǧmuş
      Pages 191-202

About these proceedings

Keywords

Pattern Matching algorithms automata cognition finite automata grammar grammars learning machine translation modeling natural language natural language processing proving regular expressions semantics

Editors and affiliations

  • Anssi Yli-Jyrä
    • 1
  • Lauri Karttunen
    • 2
  • Juhani Karhumäki
    • 3
  1. 1.Language Research ServiceCSC Scientific Computing Ltd.Finland
  2. 2.Palo Alto Research CenterStanford UniversityUSA
  3. 3.Department of Mathematics and Turku Centre for Computer Science TUCSUniversity of TurkuTurkuFinland

Bibliographic information

  • DOI https://doi.org/10.1007/11780885
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-35467-3
  • Online ISBN 978-3-540-35469-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book