Computer Science – Computation and Language
Scientific paper
2004-06-02
Computer Science
Computation and Language
28 pages, 7 figures, LaTeX (+ .eps)
Scientific paper
This report defines various operations for weighted multi-tape automata (WMTAs) and describes algorithms that have been implemented for those operations in the WFSC toolkit. Some algorithms are new, others are known or similar to known algorithms. The latter will be recalled to make this report more complete and self-standing. We present a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA. In our approach, multi-tape intersection is not considered as an atomic operation but rather as a sequence of more elementary ones, which facilitates its implementation. We show an example of multi-tape intersection, actually transducer intersection, that can be compiled with our approach but not with several other methods that we analysed. To show the practical relavance of our work, we include an example of application: the preservation of intermediate results in transduction cascades.
Guingne Franck
Kempe André
Nicart Florent
No associations
LandOfFree
Algorithms for weighted multi-tape automata 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 Algorithms for weighted multi-tape automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for weighted multi-tape automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348517