Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Finite-State Methods and Natural Language Processing

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Anssi Yli-Jyrä

    1. Language Research Service, CSC Scientific Computing Ltd., Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Lauri Karttunen

    1. Palo Alto Research Center, Stanford University, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Juhani Karhumäki

    1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, Turku, Finland

    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 4002)

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

Included in the following conference series:

Conference proceedings info: FSMNLP 2005.

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 (39 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures

    1. Characterizations of Regularity

      • Tero Harju
      Pages 1-8

    2. Finnish Optimality-Theoretic Prosody

      • Lauri Karttunen
      Pages 9-10

  3. Contributed Papers

    1. Partitioning Multitape Transducers

      • François Barthélemy
      Pages 11-20

    2. Squeezing the Infinite into the Finite

      • Tamás Bíró
      Pages 21-31

    3. A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers

      • Jorge Civera, Juan M. Vilar, Elsa Cubel, Antonio L. Lagarda, Sergio Barrachina, Francisco Casacuberta et al.
      Pages 32-42

    4. Finite-State Registered Automata and Their Uses in Natural Languages

      • Yael Cohen-Sygal, Shuly Wintner
      Pages 43-54

    5. TAGH: A Complete Morphology for German Based on Weighted Finite State Automata

      • Alexander Geyken, Thomas Hanneforth
      Pages 55-66

    6. Klex: A Finite-State Transducer Lexicon of Korean

      • Na-Rae Han
      Pages 67-77

    7. Longest-Match Pattern Matching with Weighted Finite State Automata

      • Thomas Hanneforth
      Pages 78-85

    8. Finite-State Syllabification

      • Mans Hulden
      Pages 86-96

    9. Algorithms for Minimum Risk Chunking

      • Martin Jansche
      Pages 97-109

    10. Collapsing ε-Loops in Weighted Finite-State Machines

      • J. Howard Johnson
      Pages 110-119

    11. WFSM Auto-intersection and Join Algorithms

      • A. Kempe, J. -M. Champarnaud, F. Guingne, F. Nicart
      Pages 120-131

    12. Further Results on Syntactic Ambiguity of Internal Contextual Grammars

      • Lakshmanan Kuppusamy
      Pages 132-143

    13. Error-Driven Learning with Bracketing Constraints

      • Takashi Miyata, Kôiti Hasida
      Pages 144-155

    14. Parsing with Lexicalized Probabilistic Recursive Transition Networks

      • Alexis Nasr, Owen Rambow
      Pages 156-166

    15. Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines

      • Alexis Nasr, Alexandra Volanschi
      Pages 167-178

    16. Modelling the Semantics of Calendar Expressions as Extended Regular Expressions

      • Jyrki Niemi, Lauri Carlson
      Pages 179-190

    17. Using Finite State Technology in a Tool for Linguistic Exploration

      • Kemal Oflazer, Mehmet Dinçer Erbaş, Müge Erdoǧmuş
      Pages 191-202
Back to top

Other volumes

  1. Finite-State Methods and Natural Language Processing

Keywords

Editors and Affiliations

  • Language Research Service, CSC Scientific Computing Ltd., Finland

    Anssi Yli-Jyrä

  • Palo Alto Research Center, Stanford University, USA

    Lauri Karttunen

  • Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, Turku, Finland

    Juhani Karhumäki

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation