A Generic Finite State Compiler for Tagging Rules

  • Authors:
  • Wojciech Skut;Stefan Ulrich;Kathrine Hammervold

  • Affiliations:
  • Rhetorical Systems Ltd., Edinburgh, Scotland EH8 8DT;Rhetorical Systems Ltd., Edinburgh, Scotland EH8 8DT;Rhetorical Systems Ltd., Edinburgh, Scotland EH8 8DT

  • Venue:
  • Machine Translation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.