759 search results - page 51 / 152 » Overlap-Free Regular Languages |
145
click to vote
MEMOCODE
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...
116
Voted
ICGI
2010
Springer
15 years 3 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
MST
2006
15 years 1 months ago
2006
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
150
click to vote
WIA
2000
Springer
15 years 5 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
138
click to vote
CSL
2007
Springer
15 years 1 months ago
2007
Springer
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...