Sciweavers

212 search results - page 24 / 43
» Second-Order Simple Grammars
Sort
View
173
Voted
AIIA
1995
Springer
15 years 7 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
126
Voted
ACL
1994
15 years 4 months ago
A Psycholinguistically Motivated Parser for CCG
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
Michael Niv
125
Voted
JCB
2008
108views more  JCB 2008»
15 years 3 months ago
Asymptotics of RNA Shapes
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...
W. A. Lorenz, Yann Ponty, Peter Clote
134
Voted
CSL
2002
Springer
15 years 3 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
127
Voted
CORR
1999
Springer
120views Education» more  CORR 1999»
15 years 3 months ago
A Machine-Independent Debugger--Revisited
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
David R. Hanson