D08-1113 compute equation ( 1 ) using a finite-state machine . We define a WFSA , Uθ
A00-1008 . Cook ( 1998 ) uses levels of finite-state machines . None of these systems provides
A92-1018 rule-based approach implemented with finite-state machines -LSB- Kosken - niemi , 1990 -RSB-
C92-1027 It is based on the calculus of finite-state machines . The compiler transforms rules
C90-3030 grammar parsing would be in terms of finite-state machines ( cf. Kimmo Koskenniemi , COLING-90
A00-1008 ITSs have been implemented with finite-state machines , either simple or augmented
C90-2040 are ultimately implemented as finite-state machines which discard he corresponding
C90-2040 Each sentence is represented as a finite-state machine ( fsm ) that accepts all possible
A88-1031 synthesis , and correspond to finite-state machines , hence they appear to enjoy
D09-1011 potential function ) is a weighted finite-state machine , typically a transducer that
C96-1047 has somewhat less power than a finite-state machine , and yet achieves high accuracy
C94-2211 to its limits , the resulting finite-state machines are extremely t2qst . If we consider
C88-1060 gained by saving the derivative finite-state machines in a cache associated with the
A00-1008 that previous models based on finite-state machines are insufficient to handle the
A97-1009 1995 ) , a toolkit for creating finite-state machines from linguistic descriptions
A94-1024 based approach implemented with finite-state machines ( Koskenniemi et al. , 1992 ;
C88-1060 states are enmnerated and the finite-state machines tire represented with partial
D09-1005 2002 ) , originally proposed for finite-state machines , is one such " training " semiring
A00-3002 preprocessing step that uses a finite-state machine to identify potential chunks
C88-1060 satisfy an uncertainty . But a finite-state machine can be constructed that accepts
hide detail