Reduction of Intermediate Alphabets in Finite-State Transducer Cascades
| dc.creator | Kempe, Andre | |
| dc.date | 2000-10-23 | |
| dc.date.accessioned | 2026-07-07T03:16:39Z | |
| dc.date.available | 2026-07-07T03:16:39Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 7 figures, LaTeX (+ eps) | |
| dc.identifier | https://arxiv.org/abs/cs/0010030 | |
| dc.identifier | http://arxiv.org/abs/cs/0010030 | |
| dc.identifier | Proc. TALN 2000, pp. 207-215, Lausanne, Switzerland. October 16-18 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30431 | |
| dc.subject | Computation and Language | |
| dc.subject | F.1.1; I.2.7 | |
| dc.title | Reduction of Intermediate Alphabets in Finite-State Transducer Cascades | |
| dc.type | text |