A Bimachine Compiler for Ranked Tagging Rules

This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.

• Publication year

  2004

• Venue

  International Conference on Computational Linguistics

• Publication date

  2004-07-19

• Fields of study

  Linguistics, Computer Science

• Identifiers
  DOI 10.48550/arXiv.cs/0407046arXiv cs/0407046
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Flexible Rule Compiler for Speech Synthesis

  2004cited by this paper
• Heterogeneous relation graphs as a formalism for representing linguistic information

  2001cited by this paper
• An efficient implementation of phonological rules using finite-state transducers

  2001cited by this paper
• Transducers from Rewrite Rules with Backreferences

  1999cited by this paper
• The Proper Treatment of Optimality in Computational Phonology

  1998cited by this paper
• Rational Transductions for Phonetic Conversion and Phonology

  1997cited by this paper
• Finite-State Transducers in Language and Speech Processing

  1997cited by this paper
• An Eecient Compiler for Weighted Rewrite Rules

  1996cited by this paper
• An Efficient Compiler for Weighted Rewrite Rules

  1996cited by this paper
• Introduction to Finite-State Devices in Natural Language Processing

  1996cited by this paper
• Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging

  1995cited by this paper
• Regular Models of Phonological Rule Systems

  1994cited by this paper
• Transductions and context-free languages

  1979cited by this paper
• Efficient string matching

  1975cited by this paper
• MITSUBISHI ELECTRIC RESEARCH LABORATORIES CAMBRIDGE RESEARCH CENTER Deterministic Part-Of-Speech Tagging with Finite State Transducers

  year unknowninfluential reference
• An Efficient Compiler for Weighted Rewrite Rules

  year unknowncited by this paper

• Space-Efficient Bimachine Construction Based on the Equalizer Accumulation Principle

  2018cites this paper
• The Power of Constraint Grammars Revisited

  2017cites this paper
• Proceedings of the NoDaLiDa 2017 Workshop on Constraint Grammar-Methods , Tools and Applications

  2017cites this paper
• The Kestrel TTS text normalization system

  2014cites this paper
• Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing

  2011cites this paper
• Compiling Simple Context Restrictions with Nondeterministic Automata

  2011cites this paper
• An Efficient Constraint Grammar Parser based on Inward Deterministic Automata

  2011cites this paper
• Proceedings of the NODALIDA 2011 workshop Constraint Grammar Applications

  2011cites this paper
• Rule Definition Language and a Bimachine Compiler

  2007cites this paper