2018
DOI: 10.1007/978-3-030-01081-2_37
|View full text |Cite
|
Sign up to set email alerts
|

Case-Based Translation: First Steps from a Knowledge-Light Approach Based on Analogy to a Knowledge-Intensive One

Abstract: This paper deals with case-based machine translation. It is based on a previous work using a proportional analogy on strings, i.e., a quaternary relation expressing that "String A is to string B as string C is to string D". The first contribution of this paper is the rewording of this work in terms of case-based reasoning: a case is a problem-solution pair (A, A) where A is a sentence in an origin language and A , its translation in the destination language. First, three cases (A, A), (B, B), (C, C) such that … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…The rst application of the analogy on strings dened in [4] is case-based machine translation: a case is a pair (x s , y s ), where x s is a sentence in a natural language and y s is a translation of x s in another natural language. The approach proposed in [4] and studied in [5] at the light of the CBR methodology consists rst in nding 3 source cases (x a , y a ), (x b , y b ) and (x c , y c ) such that x a :x b ::x c :x tgt holds and then in solving the analogical equation y a :y b ::y c :y: a solution y of this equation is a candidate solution y tgt of x tgt . Now, this idea could be reused for TFC: this would mean that the problems would be sentences in an incorrect French language and the solutions would be sentences in a correct French language.…”
Section: Resultsmentioning
confidence: 99%
“…The rst application of the analogy on strings dened in [4] is case-based machine translation: a case is a pair (x s , y s ), where x s is a sentence in a natural language and y s is a translation of x s in another natural language. The approach proposed in [4] and studied in [5] at the light of the CBR methodology consists rst in nding 3 source cases (x a , y a ), (x b , y b ) and (x c , y c ) such that x a :x b ::x c :x tgt holds and then in solving the analogical equation y a :y b ::y c :y: a solution y of this equation is a candidate solution y tgt of x tgt . Now, this idea could be reused for TFC: this would mean that the problems would be sentences in an incorrect French language and the solutions would be sentences in a correct French language.…”
Section: Resultsmentioning
confidence: 99%
“…An analogy on S can be defined likewise. Therefore, using the problem variation space and the solution variation space, an analogy on P and an analogy on S can be built, and thus, the approach to CBR based on the following principle (called extrapolation in [13] and used in [12] and [10]) can be applied:…”
Section: Variation-based Analogiesmentioning
confidence: 99%
“…However, the principle of the approach still holds. These applications show how case-based translation [10] can be actually performed thanks to the approach of local enrichment of the case base. The results are demonstrative and promising.…”
Section: Introductionmentioning
confidence: 99%