2467 search results - page 175 / 494 » Finite State Machines |
167
click to vote
EACL
2003
ACL Anthology
15 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
146
click to vote
UAI
2001
15 years 8 months ago
2001
We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finit...
154
click to vote
ACL
1998
15 years 8 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
144
click to vote
COLING
1996
15 years 8 months ago
1996
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
190
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...