A Bimachine Compiler for Ranked Tagging Rules

Details A Bimachine Compiler for Ranked Tagging Rules A Bimachine Compiler for Ranked Tagging Rules

2004-07-19

arxiv.org/abs/cs/0407046v1

Computer Science

Computation and Language

7 pages, 3 figures Proceedings of COLING 2004 (to appear)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Bimachine Compiler for Ranked Tagging Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Bimachine Compiler for Ranked Tagging Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Bimachine Compiler for Ranked Tagging Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535607