Reduction of Intermediate Alphabets in Finite-State Transducer Cascades

Details Reduction of Intermediate Alphabets in Finite-State Transducer Cascades Reduction of Intermediate Alphabets in Finite-State Transducer Cascades

2000-10-23

arxiv.org/abs/cs/0010030v1

Proc. TALN 2000, pp. 207-215, Lausanne, Switzerland. October 16-18

Computer Science

Computation and Language

9 pages, 7 figures, LaTeX (+ eps)

Scientific paper

This article describes an algorithm for reducing the intermediate alphabets in cascades of finite-state transducers (FSTs). Although the method modifies the component FSTs, there is no change in the overall relation described by the whole cascade. No additional information or special algorithm, that could decelerate the processing of input, is required at runtime. Two examples from Natural Language Processing are used to illustrate the effect of the algorithm on the sizes of the FSTs and their alphabets. With some FSTs the number of arcs and symbols shrank considerably.

Affiliated with

Also associated with

No associations

Rating

Reduction of Intermediate Alphabets in Finite-State Transducer Cascades 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 Reduction of Intermediate Alphabets in Finite-State Transducer Cascades, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduction of Intermediate Alphabets in Finite-State Transducer Cascades will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-45965