We propose a top-down algorithm for extracting k-best lists from a parser. Our algorithm, TKA is a variant of the kbest A (KA) algorithm of Pauls and Klein (2009). In contrast to ...
The Brown and the Berkeley parsers are two state-of-the-art generative parsers. Since both parsers produce n-best lists, it is possible to apply reranking techniques to the output...
An important initiative in the automotive domain is the development of the ISO 26262 standard for functional safety of road vehicles. The standard introduces numerous techniques f...
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
We present an approach to multilingual grammar induction that exploits a phylogeny-structured model of parameter drift. Our method does not require any translated texts or token-l...