Sciweavers

3166 search results - page 20 / 634
» Translation By Structural Correspondences
Sort
View
TCS
2010
13 years 2 months ago
An exact correspondence between a typed pi-calculus and polarised proof-nets
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
Kohei Honda, Olivier Laurent
IJCNLP
2004
Springer
14 years 23 days ago
Example-Based Machine Translation Without Saying Inferable Predicate
For natural translations, a human being does not express predicates that are inferable from the context in a target language. This paper proposes a method of machine translation w...
Eiji Aramaki, Sadao Kurohashi, Hideki Kashioka, Hi...
ICPR
2008
IEEE
14 years 8 months ago
A coordinate system for articulated 2D shape point correspondences
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
Adrian Ion, Salvador B. López Mármol...
LREC
2010
160views Education» more  LREC 2010»
13 years 8 months ago
Contrastive Lexical Evaluation of Machine Translation
This paper advocates a complementary measure of translation performance that focuses on the constrastive ability of two or more systems or system versions to adequately translate ...
Aurélien Max, Josep Maria Crego, Fran&ccedi...
EACL
2003
ACL Anthology
13 years 8 months ago
Automatic Construction of Machine Translation Knowledge Using Translation Literalness
When machine translation (MT) knowledge is automatically constructed from bilingual corpora, redundant rules are acquired due to translation variety. These rules increase ambiguit...
Kenji Imamura, Eiichiro Sumita, Yuji Matsumoto