643 search results - page 9 / 129 » Parsing And Derivational Equivalence |
COLT
2008
Springer
14 years 11 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
82
Voted
ENTCS
2006
14 years 9 months ago
2006
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
102
click to vote
ACL
1990
14 years 10 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
ACL
2004
14 years 11 months ago
2004
We present a technique that improves the efficiency of word-lattice parsing as used in speech recognition language modeling. Our technique applies a probabilistic parser iterative...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper considers discrete-time periodic linear systems and their Floquet transformations, by which the periodic systems can be equivalently transformed to time-invariant on...