| A00-2040 | doing the segmentation step of the | finite state transducer | only . The corresponding phoneme |
| A00-2040 | the output of the hand-crafted | finite state transducer | with the correct phoneme strings |
| C80-1088 | . 4 . SYGMOR - a deterministic | finite state transducer | used for morphological generation |
| C02-1127 | patterns are implemented in our | finite state transducer | formalism . 4 Maximum Spanning |
| C80-1088 | i. ATEF " a non-deterministic | finite state transducer | which is used for generating |
| A00-2040 | which combines a hand-crafted | finite state transducer | with rules induced by a transformation-based |
| C00-2110 | mnnber of research efforts using | Finite State Transducers | ( FST ) have been reported . |
| C88-1043 | generation of word forms based on | Finite State Transducers | ( FSTs ) . It has been completely |
| A00-2040 | which are compiled into a weighted | finite state transducer | ) for the graphemeto-phoneme |
| A00-1023 | of machine learning and FST ( | finite state transducer | ) rule-based system -LSB- Roche |
| C86-1076 | algorithm is applied . We adopt a | finite state transducer | as a computing model which governs |
| C00-2138 | extracted fiom corlms and the | finite state transducer | . By ex - periments , it ; turns |
| C88-1069 | for converting these rules into | finite state transducers | ( Karttunen , Koskenniemi , and |
| A00-1034 | The pattern matcher is based on | Finite State Transducer | ( FST ) technology -LSB- Roches |
| A97-1031 | patterns which are expressed as | finite state transducers | ( FST ) and which are compiled |
| C00-2110 | Sekine Abstract A deternfinistic | finite state transducer | is a fast device fbr analyzing |
| C00-2138 | relivesented with a deterministic | finite state transducer | O t ' / : " H - ( ) 0 I wl / |
| A00-1034 | attractive feature of the FST ( | Finite State Transducer | ) formalism lies in its superior |
| C88-1023 | deptl > first nondeterministi.c | finite state transducer | . That is to say , the phonotacUc |
| C88-2113 | semantics for quasi-deterministic | finite state transducers | ( FSTS ) used as acceptors . |
