Sciweavers

667 search results - page 18 / 134
» Total parser combinators
Sort
View
MT
2006
116views more  MT 2006»
13 years 8 months ago
Dependency treelet translation: the convergence of statistical and example-based machine-translation?
We describe a novel approach to machine translation that combines the strengths of the two leading corpus-based approaches: Phrasal SMT and EBMT. We use a syntactically informed d...
Christopher Quirk, Arul Menezes
COLING
2010
13 years 3 months ago
Informed ways of improving data-driven dependency parsing for German
We investigate a series of targeted modifications to a data-driven dependency parser of German and show that these can be highly effective even for a relatively well studied langu...
Wolfgang Seeker, Bernd Bohnet, Lilja Øvreli...
ENTCS
2007
72views more  ENTCS 2007»
13 years 8 months ago
Observational Equivalence for the Interaction Combinators and Internal Separation
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Damiano Mazza
DAC
2005
ACM
14 years 9 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
ICDAR
2003
IEEE
14 years 2 months ago
Parsing N-Best Lists of Handwritten Sentences
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
Matthias Zimmermann, Jean-Cédric Chappelier...