An Efficient Compiler for Weighted Rewrite Rules

Details An Efficient Compiler for Weighted Rewrite Rules An Efficient Compiler for Weighted Rewrite Rules

1996-06-20

arxiv.org/abs/cmp-lg/9606026v1

34th Annual Meeting of the ACL

Computer Science

Computation and Language

Scientific paper

Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorithms. Further, many of our applications demand the ability to compile weighted rules into weighted FSTs, transducers generalized by providing transitions with weights. We have extended the algorithm to allow for this.

Affiliated with

Also associated with

No associations

Rating

An Efficient Compiler for Weighted Rewrite 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 An Efficient Compiler for Weighted Rewrite Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Compiler for Weighted Rewrite Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240967