Abstract
We describe a novel method of compiling ranked tagging rules into a “bimachine”, i.e. a deterministic finite state device composed of two finite automata: a left-to-right one and a right-to-left one. The actual compilation is based on algorithms for finite state acceptors rather than transducers, which guarantees determinizability and the efficiency of compilation. The compiler has been used in a number of applications within a speech synthesis system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Berstel (1979) Transductions and Context-Free Language Teubner Studienbücher Stuttgart
E. Brill (1995) ArticleTitle‘Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging’ Computational Linguistics 21 543–565
Hetherington, I. L. (2001). ‘An Efficient Implementation of Phonological Rules using Finite-State Transducers’, in Proceedings of EUROSPEECH-2001: Seventh European Conference on Speech Communication and Technology, Aalborg, Denmark, pp. 1599–1602.
R.M. Kaplan M. Kay (1994) ArticleTitle‘Regular Models of Phonological Rule Systems’ Computational Linguistics 20 331–378
Karttunen. L. (1995). ‘The Replace Operator’, in 33rd Meeting of the Association for Computational Linguistics, Cambridge, Massachusetts, pp. 16–23.
Kempe, A. (2000). ‘Part-of-Speech Tagging with Two Sequential Transducers’, in CLIN 2000: Eleventh CLIN Meeting (Computational Linguistics in the Netherlands). Tilburg, Netherlands, pp. 88–96.
E. Laporte (1997) ‘Rational Transductions for Phonetic Conversion and Phonology’ E. Roche Y. Schabes (Eds) Finite-State Language Processing MIT Press Cambridge Mass 407–428
M. Mohri (1997) ArticleTitle‘Finite-State Transducers in Language and Speech Processing’ Computational Linguistics 23 269–311
Mohri, M. and R. Sproat: (1996). ‘An Efficient Compiler for Weighted Rewrite Rules’, in 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, California, pp. 231–238.
Neumann, G., R. Backofen, J. Baur, M. Becker and C. Braun: (1997). ‘An Information Extraction Core System for Real World German Text Processing’, in Fifth Conference on Applied Natural Language Processing, Washington, DC, pp. 209–216.
Neumann G., C. Braun and Piskorski: (2000). ‘A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts’, in Sixth Applied Natural Language Processing Conference, Seattle, Washington, pp. 239–246.
T. Poibeau (2001) ArticleTitle‘Parsing Natural Language Idioms with Bidirectional Finite-State Machines’ Theoretical Computer Science 267 131–140 Occurrence Handle10.1016/S0304-3975(00)00300-5
E. Roche Y. Schabes (1995) ArticleTitle‘Deterministic Part-of-Speech Tagging with Finite-State Transducers’ Computational Linguistics 21 227–253
Roche, E. and Y. Schabes: (1996). ‘Introductions to Finite-State Devices in Natural Language Processing’, Technical report TR-96-13, Mitsubishi Electric Research Laboratories, Cambrisge, Massachusetts.
W. Skut S. Ulrich K. Hammervold (2004) ‘A Flexible Rule Compiler for Speech Synthesis’ M.A. Klopotek S.T. Wierzchon K. Trojanowski (Eds) Intelligent Information Processing and Web Mining Springer Berlin 257–266
P. Taylor A.W. Black R. Caley (2001) ArticleTitle‘Heterogeneous Relation Graphs as a Formalism for Representing Linguistic Information’ Speech Communciation 33 153–174 Occurrence Handle10.1016/S0167-6393(00)00074-1
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Skut, W., Ulrich, S. & Hammervold, K. A Generic Finite State Compiler for Tagging Rules. Mach Translat 18, 239–250 (2003). https://doi.org/10.1007/s10590-004-2479-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10590-004-2479-2