Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2007: Implementation and Application of Automata pp 320–321Cite as

A New Method for Compiling Parallel Replacement Rules

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4783))

Abstract

Kempe and Karttunen [1] have presented a method that compiles a set of parallel conditional replacement (rewriting) rules into a finite-state transducer. Other, simpler methods exist for single rules or for rules of a restricted type, but they can be used only in restricted situations.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Kempe, A., Karttunen, L.: Parallel replacement in finite state calculus. In: 16th COLING 1996, Proc. Conference, Copenhagen, Denmark, vol. 2, pp. 622–627 (1996)

    Google Scholar 

  2. Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20, 331–378 (1994)

    Google Scholar 

  3. Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: 34th ACL 1996, Proc. Conference, Santa Cruz, CA, USA, pp. 231–238 (1996)

    Google Scholar 

  4. Karttunen, L.: The replace operator. In: 33th ACL 1995, Proceedings of the Conference, Cambridge, MA, USA, pp. 16–23 (1995)

    Google Scholar 

  5. Gerdemann, D., van Noord, G.: Transducers from rewrite rules with backreferences. In: 9th EACL 1999, Proceedings of the Conference, pp. 126–133 (1999)

    Google Scholar 

  6. Yli-Jyrä, A., Koskenniemi, K.: Compiling generalized two-level rules and grammars. In: Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. (eds.) FinTAL 2006. LNCS (LNAI), vol. 4139, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Gerdemann, D., van Noord, G.: Approximation and exactness in Finite-State Optimality Theory. In: Eisner, J., Karttunen, L., Thériault, A. (eds.) SIGPHON 2000, Finite State Phonology (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Anssi Yli-Jyrä

  2. Department of General Linguistics, University of Helsinki, Finland

    Kimmo Koskenniemi

Authors
  1. Anssi Yli-Jyrä
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kimmo Koskenniemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Holub Jan Žďárek

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yli-Jyrä, A., Koskenniemi, K. (2007). A New Method for Compiling Parallel Replacement Rules. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76336-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76335-2

  • Online ISBN: 978-3-540-76336-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation