Compilation of Weighted Finite-State Transducers from Decision Trees

Details Compilation of Weighted Finite-State Transducers from Decision Trees Compilation of Weighted Finite-State Transducers from Decision Trees

1996-06-14

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

34th Annual Meeting of the ACL

Computer Science

Computation and Language

Scientific paper

We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string. Each leaf node can then be treated as a separate rule where the left and right contexts are constructable from the decisions made traversing the tree from the root to the leaf. These rules are compiled into transducers using the weighted rewrite-rule rule-compilation algorithm described in (Mohri and Sproat, 1996).

Affiliated with

Also associated with

No associations

Rating

Compilation of Weighted Finite-State Transducers from Decision Trees 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 Compilation of Weighted Finite-State Transducers from Decision Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compilation of Weighted Finite-State Transducers from Decision Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189519