| { |
| "paper_id": "D15-1006", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T16:29:13.201067Z" |
| }, |
| "title": "Syntax-based Rewriting for Simultaneous Machine Translation", |
| "authors": [ |
| { |
| "first": "He", |
| "middle": [], |
| "last": "He", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "University of Maryland", |
| "location": {} |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Alvin", |
| "middle": [], |
| "last": "Grissom", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "{Alvin.Grissom, Jordan.Boyd.Graber} @colorado.edu", |
| "institution": "University of Colorado", |
| "location": {} |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Jordan", |
| "middle": [], |
| "last": "Boyd-Graber", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "{Alvin.Grissom, Jordan.Boyd.Graber} @colorado.edu", |
| "institution": "University of Colorado", |
| "location": {} |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Hal", |
| "middle": [], |
| "last": "Daum\u00e9", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "UMIACS University of Maryland", |
| "location": {} |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Divergent word order between languages causes delay in simultaneous machine translation. We present a sentence rewriting method that generates more monotonic translations to improve the speedaccuracy tradeoff. We design grammaticality and meaning-preserving syntactic transformation rules that operate on constituent parse trees. We apply the rules to reference translations to make their word order closer to the source language word order. On Japanese-English translation (two languages with substantially different structure), incorporating the rewritten, more monotonic reference translation into a phrase-based machine translation system enables better translations faster than a baseline system that only uses gold reference translations.", |
| "pdf_parse": { |
| "paper_id": "D15-1006", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Divergent word order between languages causes delay in simultaneous machine translation. We present a sentence rewriting method that generates more monotonic translations to improve the speedaccuracy tradeoff. We design grammaticality and meaning-preserving syntactic transformation rules that operate on constituent parse trees. We apply the rules to reference translations to make their word order closer to the source language word order. On Japanese-English translation (two languages with substantially different structure), incorporating the rewritten, more monotonic reference translation into a phrase-based machine translation system enables better translations faster than a baseline system that only uses gold reference translations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Simultaneous interpretation is challenging because it demands both quality and speed. Conventional batch translation waits until the entire sentence is completed before starting to translate. This merely optimizes translation quality and often introduces undesirable lag between the speaker and the audience. Simultaneous interpretation instead requires a tradeoff between quality and speed. A common strategy is to translate independently translatable segments as soon as possible. Various segmentation methods (Fujita et al., 2013; Oda et al., 2014) reduce translation delay; they are limited, however, by the unavoidable word reordering between languages with drastically different word orders. We show an example of Japanese-English translation in Figure 1 . Consider the batch translation: in English, the verb change comes immediately after the subject We, whereas in Japanese it comes at the end of the sentence; therefore, to produce an intelligible English sentence, we must translate the object after the final verb is observed, resulting in one large and painfully delayed segment.", |
| "cite_spans": [ |
| { |
| "start": 512, |
| "end": 533, |
| "text": "(Fujita et al., 2013;", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 534, |
| "end": 551, |
| "text": "Oda et al., 2014)", |
| "ref_id": "BIBREF23" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 752, |
| "end": 760, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "To reduce structural discrepancy, we can apply syntactic transformations to make the word order of one language closer to the other. Consider the monotone translation in Figure 1 . By passivizing the English sentence, we can cache the subject and begin translating before observing the final verb. Furthermore, by using the English possessive, we mimic the order of the Japanese genitive construction. These transformations enable us to divide the input into shorter segments, thus reducing translation delay.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 170, |
| "end": 178, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "To produce such monotone translations, a straightforward approach is to incorporate interpretation data into the learning of a machine translation (MT) system, because human interpreters use a variety of strategies (Shimizu et al., 2014; Camayd-Freixas, 2011; Tohyama and Matsubara, 2006) to fine-tune the word order. Shimizu et al. (2013) shows that this approach improves the speed-accuracy tradeoff. However, existing parallel simultaneous interpretation corpora (Shimizu et al., 2014; Matsubara et al., 2002; Bendazzoli and Sandrelli, 2005) are often small, and collecting new data is expensive due to the inherent costs of recording and transcribing speeches (Paulik and Waibel, 2010) . In addition, due to the intense time pressure during interpretation, human interpretation has the disadvantage of simpler, less precise diction (Camayd-Freixas, 2011; Al-Khanji et al., 2000) compared to human translations done at the translator's leisure, allowing for more introspection and precise word choice.", |
| "cite_spans": [ |
| { |
| "start": 215, |
| "end": 237, |
| "text": "(Shimizu et al., 2014;", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 238, |
| "end": 259, |
| "text": "Camayd-Freixas, 2011;", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 260, |
| "end": 288, |
| "text": "Tohyama and Matsubara, 2006)", |
| "ref_id": "BIBREF29" |
| }, |
| { |
| "start": 318, |
| "end": 339, |
| "text": "Shimizu et al. (2013)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 466, |
| "end": 488, |
| "text": "(Shimizu et al., 2014;", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 489, |
| "end": 512, |
| "text": "Matsubara et al., 2002;", |
| "ref_id": "BIBREF20" |
| }, |
| { |
| "start": 513, |
| "end": 544, |
| "text": "Bendazzoli and Sandrelli, 2005)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 664, |
| "end": 689, |
| "text": "(Paulik and Waibel, 2010)", |
| "ref_id": "BIBREF25" |
| }, |
| { |
| "start": 836, |
| "end": 858, |
| "text": "(Camayd-Freixas, 2011;", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 859, |
| "end": 882, |
| "text": "Al-Khanji et al., 2000)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We aim to address the data scarcity problem and combine translators' lexical precision and interpreters' syntactic flexibility. We propose to rewrite the reference translation in a way that uses the original lexicon, obeys standard grammar rules of Monotone: Figure 1 : Divergent word order between language pairs can cause long delays in simultaneous translation: Segments (||) mark the portions of the sentence that can be translated together. (Case markers: topic (TOP), genitive (GEN), accusative (ACC), copula (COP).) the target language, preserves the original semantics, and yields more monotonic translations. We then train the MT system with the rewritten references so that it learns how to produce low-latency translations from the data. A data-driven approach to learning these rewriting rules is hampered by the dearth of parallel data: we have few examples of text that have been both interpreted and translated. Therefore, we design syntactic transformation rules based on linguistic analysis of the source and the target languages. We apply these rules to parsed text and decide whether to accept the rewritten sentence based on the amount of delay reduction. In this work, we focus on Japanese to English translation, because (i) Japanese and English have significantly different word orders (SOV vs. SVO); and consequently, (ii) the syntactic constituents required earlier by an English sentence often come late in the corresponding Japanese sentence.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 259, |
| "end": 267, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We evaluate our approach using standard machine translation data (the Reuters newsfeed Japanese-English corpus) in a simultaneous translation setting. Our experimental results show that including the rewritten references into the learning of a phrase-based MT system results in a better speed-accuracy tradeoff against both the original and the rewritten reference translations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Simultaneous interpretation has two goals: producing good translations and producing them promptly. However, most existing parallel corpora and MT systems do not address the issue of delay during translation. We explicitly adapt the training data by rewriting rules to reduce delay. We first define translation delay and describe-in general termsour rewriting rules. In the next section, we describe the rules in more detail.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Problem of Delay Reduction", |
| "sec_num": "2" |
| }, |
| { |
| "text": "While we are motivated by real-time interpretation, to simplify our problem, we assume that we have perfect text input. Given this constraint, a typical simultaneous interpretation system (Sridhar et al., 2013; Fujita et al., 2013; Oda et al., 2014) produces partial translations of consecutive segments in the source sentence and concatenates them to produce a complete translation. We define the translation delay of a sentence as the average number of tokens the system has to observe between translation of two consecutive segments (denoted by # words/seg). 1 For instance, the minimum delay of 1 word/seg is achieved when we translate immediately upon hearing a word. At test time, when the input is segmented, the delay is the average segment length. During the data preprocessing step of rewriting, we calculate delay from word alignments (Section 4).", |
| "cite_spans": [ |
| { |
| "start": 188, |
| "end": 210, |
| "text": "(Sridhar et al., 2013;", |
| "ref_id": "BIBREF28" |
| }, |
| { |
| "start": 211, |
| "end": 231, |
| "text": "Fujita et al., 2013;", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 232, |
| "end": 249, |
| "text": "Oda et al., 2014)", |
| "ref_id": "BIBREF23" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Problem of Delay Reduction", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Given a reference batch translation x, we apply a set of rewriting rules R to x to minimize its delay. A rewriting rule r \u2208 R is a mapping that takes the constituent parse tree of x as input and outputs a modified parse tree, which specifies a rewritten sentence x . The tree-editing operation includes node deletion, insertion, and swapping, as well as induced changes of word form and node label. A valid transformation rule should rearrange constituents in x to follow the word order of the input sentence as closely as possible, subject to grammatical constraints and preservation of the original meaning.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Problem of Delay Reduction", |
| "sec_num": "2" |
| }, |
| { |
| "text": "We design a variety of syntactic transformation rules for Japanese-English translation motivated by their structural differences. Our rules cover verb, noun, and clause reordering. While we specifically focus on Japanese to English, many rules are broadly applicable to SOV to SVO languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Transformation Rules", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The most significant difference between Japanese and English is that the head of a verb phrase comes at the end of Japanese sentences. In English, it occupies one of the initial positions. We now introduce rules that can postpone a head verb.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Verb Phrases", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Passivization and Activization In Japanese, the standard structure of a sentence is NP 1 NP 2 verb, where case markers following the verb indicate the voice of the sentence. However, in English, we have NP 1 verb NP 2 , where the form of the verb indicates its voice. Changing the voice is particularly useful when NP 2 (object in an active-voice sentence and subject in a passive-voice sentence) is long. By reversing positions of verb and NP 2 , we are not held back by the upcoming verb and can start to translate NP 2 immediately. Figure 1 shows an example in which passive voice can help make the target and source word orders more compatible, but it is not the case that passivizing every sentence would be a good idea; sometimes making a passive sentence active makes the word orders more compatible if the objects are relatively short: O: The talk was denied by the boycott group spokesman. R: The boycott group spokesman denied the talk.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 535, |
| "end": 543, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Verb Phrases", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Quotative Verbs Quotative verbs are verbs that, syntactically and semantically, resemble said and often start an independent clause. Such verbs are frequent, especially in news, and can be moved to the end of a sentence: O: They announced that the president will restructure the division. R: The president will restructure the division, they announced.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Verb Phrases", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "In addition to quotative verbs, candidates typically include factive (e.g., know, realize, observe), factive-like (e.g., announce, determine), belief (e.g., believe, think, suspect), and antifactive (e.g., doubt, deny) verbs. When these verbs are followed by a clause (S or SBAR), we move the verb and its subject to the end of the clause.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Verb Phrases", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "While some exploratory work automatically extracts factive verbs, to our knowledge, an exhaustive list does not exist. To obtain a list with reasonable coverage, we exploit the fact that Japanese has an unambiguous quotative particle, to, that precedes such verbs. 2 We identify all of the verbs in the Kyoto corpus (Neubig, 2011 ) marked by the quotative particle and translate them into English. We then use these as our quotative verbs. 3", |
| "cite_spans": [ |
| { |
| "start": 265, |
| "end": 266, |
| "text": "2", |
| "ref_id": null |
| }, |
| { |
| "start": 316, |
| "end": 329, |
| "text": "(Neubig, 2011", |
| "ref_id": "BIBREF21" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Verb Phrases", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Another difference between Japanese and English lies in the order of adjectives and the nouns they modify. We identify two situations where we can take advantage of the flexibility of English grammar to favor sentence structures consistent with positions of nouns in Japanese.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Genitive Reordering In Japanese, genitive constructions always occur in the form of X no Y, where Y belongs to X. In English, however, the order may be reversed through the of construction. Therefore, we transform constructions NP 1 of NP 2 to possessives using the apostrophe-s, NP 2 '(s) NP 1 (Figure 1 ). We use simple heuristics to decide if such a transformation is valid. For example, when X / Y contains proper nouns (e.g., the City of New York), numbers (e.g., seven pounds of sugar), or pronouns (e.g., most of them), changing them to the possessive case is not legal.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 295, |
| "end": 304, |
| "text": "(Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "that Clause In English, clauses are often modified through a pleonastic pronoun. E.g., It is ADJP to/that SBAR/S. In Japanese, however, the subject (clause) is usually put at the beginning. To be consistent with the Japanese word order, we move the modified clause to the start of the sentence: To S/SBAR is ADJP. The rewritten English sentence is still grammatical, although its structure is less frequent in common English usage. We new world the love Source:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Delay:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "We love the new world Target:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "1 4", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "We new world the love Source:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Delay:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "The new world is loved by us New target: 2 1 2 Figure 2 : An example of applying the passivization rule to create a translation reference that is more monotonic.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 47, |
| "end": 55, |
| "text": "Figure 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Noun Phrases", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "In Japanese, clausal conjunctions are often marked at the end of the initial clause of a compound sentence. In English, however, the order of clauses is more flexible. We can therefore reduce delay by reordering the English clauses to mirror how they typically appear in Japanese. Below we describe rules reversing the order of clauses connected by these conjunctions:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conjunction Clause", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "\u2022 Clausal conjunctions: because (of), in order to \u2022 Contrastive conjunctions: despite, even though, although \u2022 Conditionals: (even) if, as a result (of) \u2022 Misc: according to In standard Japanese, such conjunctions include no de, kara, de mo and so on. The sentence often appears in the form of S 2 conj, S 1 . In English, however, two common constructions are S 1 conj S 2 : We should march because winter is coming. conj S 2 , S 1 : Because winter is coming, we should march.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conjunction Clause", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "To follow the Japanese clause order, we adapt the above two constructions to S 2 , conj' S 1 : Winter is coming, because of this, we should march.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conjunction Clause", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "Here conj' represents the original conjunction word appended with simple pronouns/phrases to refer to S 2 . For example, because \u2192 because of this, even if \u2192 even if this is the case.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conjunction Clause", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "We now turn our attention to the implementation of the syntactic transformation rules described above. Applying a transformation consists of three steps: 1. Detection: Identify nodes in the parse tree for which the transformation is applicable; 2. Modification: Transform nodes and labels; 3. Evaluation: Compute delay reduction, and decide whether to accept the rewritten sentence. Figure 2 illustrates the process using passivization as an example. In the detection step, we find the subtree that satisfies the condition of applying a rule. In this case, we look for an S node whose children include an NP (denoted by NP 1 ), the subject, and a VP to its right, such that the VP node has a leaf VB*, the main verb, 4 followed by another NP (denoted by NP 2 ), the object. We allow the parent nodes (S and VP) to have additional children besides the matched ones. They are not affected during the transformation. In the modification step, we swap the subject node and object node; we add the verb be in its correct form by checking the tense of the verb and the form of NP 2 ; 5 and we add the preposition by before the subject. The process is executed recursively throughout the parse tree.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 383, |
| "end": 391, |
| "text": "Figure 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Although our rules are designed to minimize long range reordering, there are exceptions. 6 Thus applying a rule does not always reduce delay. In the evaluation step, we compare translation delay before and after applying the rule. We accept a rewritten sentence if its delay is reduced; otherwise, we revert to the input sentence. Since we do not segment sentences during rewriting, we must estimate the delay.", |
| "cite_spans": [ |
| { |
| "start": 89, |
| "end": 90, |
| "text": "6", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "To estimate the delay, we use word alignments. Figure 2c shows the source Japanese sentence in its word-for-word English translation and alignments from the target words to the source words. The first English word, We, is aligned to the first Japanese word; it can thus be treated as an independent segment and translated immediately. The second English word, love, is aligned to the last Japanese word, which means the system cannot start to translate until four more Japanese words are revealed. This alignment therefore forms a segment with delay of four words/seg. Alignments of the following words come before the source word aligned to love; hence, they are already translated in the previous segment and we do not double count their delay. In this example, the delay of the original sentence is 2.5 word/seg; after rewriting, it is reduced to 1.7 word/seg. Therefore, we accept the rewritten sentence. However, when the subject phrase is long and the object phrase is short, a swap may not reduce delay.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 47, |
| "end": 56, |
| "text": "Figure 2c", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We can now formally define the delay. Let e i be the ith target word in the input sentence x and a i be the maximum index among indices of source words that e i aligned to. We define the delay of e i as d", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "i = max(0, a i \u2212 max j<i a j ). The delay of x is then N i=1 d i /N", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": ", where the sum is over all aligned words except punctuation and stopwords.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "Given a set of rules, we need to decide which rules to apply and in what order. Fortunately, our rules have little interaction with each other, and the order of application has a negligible effect. We apply the rules, roughly, sequentially in order of complexity: if the output of current rule is not accepted, the sentence is reverted to the last accepted version. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence Rewriting Process", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We evaluate our method on the Reuters Japanese-English corpus of news articles (Utiyama and Isahara, 2003) . For training the MT system, we also include the EIJIRO dictionary entries and the accompanying example sentences. 7 Statistics of the dataset are shown in Table 1 . The rewritten translation is generally slightly longer than the gold translation because our rewriting often involves inserting pronouns (e.g. it, this) for antecedents.", |
| "cite_spans": [ |
| { |
| "start": 79, |
| "end": 106, |
| "text": "(Utiyama and Isahara, 2003)", |
| "ref_id": "BIBREF30" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 264, |
| "end": 271, |
| "text": "Table 1", |
| "ref_id": "TABREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "We use the TreebankWordTokenizer from NLTK (Bird et al., 2009) to tokenize English sentences and Kuromoji Japanese morphological analyzer 8 to tokenize Japanese sentences. Our phrase-based MT system is trained by Moses (Koehn et al., 2003) with standard parameters settings. We use GIZA++ (Och and Ney, 2003) for word alignment and k-best batch MIRA (Cherry and Foster, 2012) for tuning. The translation quality is evaluated by BLEU (Papineni et al., 2002) and RIBES (Isozaki et al., 2010) . 9 To obtain the parse trees for English sentences, we use the Stanford Parser (Klein and Manning, 2003) and the included English model.", |
| "cite_spans": [ |
| { |
| "start": 43, |
| "end": 62, |
| "text": "(Bird et al., 2009)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 219, |
| "end": 239, |
| "text": "(Koehn et al., 2003)", |
| "ref_id": "BIBREF18" |
| }, |
| { |
| "start": 289, |
| "end": 308, |
| "text": "(Och and Ney, 2003)", |
| "ref_id": "BIBREF22" |
| }, |
| { |
| "start": 350, |
| "end": 375, |
| "text": "(Cherry and Foster, 2012)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 433, |
| "end": 456, |
| "text": "(Papineni et al., 2002)", |
| "ref_id": "BIBREF24" |
| }, |
| { |
| "start": 467, |
| "end": 489, |
| "text": "(Isozaki et al., 2010)", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 492, |
| "end": 493, |
| "text": "9", |
| "ref_id": null |
| }, |
| { |
| "start": 570, |
| "end": 595, |
| "text": "(Klein and Manning, 2003)", |
| "ref_id": "BIBREF17" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "After applying the rewriting rules (Section 4), Table 2 shows the percentage of sentences that are candidates and how many rewrites are accepted. The most generalizable rules are passivization and delaying quotative verbs. We rewrite 32.2% of sentences, reducing the delay from 9.9 words/seg to 6.3 words/seg per segment for rewritten sentences and from 7.8 words/seg to 6.7 words/seg overall. verb voice noun conj. Applicable % 39.9 50.0 26.4 4.8 Accepted % 22.5 24.0 51.2 38.4 Table 2 : Percentage of sentences that each rule category can be applied to (Applicable) and the percentage of sentences for which the rule results in a more monotonic sentence (Accepted).", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 479, |
| "end": 486, |
| "text": "Table 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Quality of Rewritten Translations", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "We evaluate the quality of our rewritten sentences from two perspectives: grammaticality and preserved semantics. To examine how close the rewritten sentences are to standard English, we train a 5-gram language model using the English data from the Europarl corpus, consisting of 46 million words, and use it to compute perplexity. Rewriting references increases the perplexity under the language model only slightly: from 332.0 to 335.4. To ensure that rewrites leave meaning unchanged, we use the SEMAFOR semantic role labeler (Das et al., 2014) on the original and modified sentence; for each role-labeled token in the reference sentence, we examine its corresponding role in the rewritten sentence and calculate the average accuracy acrosss all sentences. Even ignoring benign lexical changes-for example, he becoming him in a passivized sentence-95.5% of the words retain their semantic roles in the rewritten sentences.", |
| "cite_spans": [ |
| { |
| "start": 529, |
| "end": 547, |
| "text": "(Das et al., 2014)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Quality of Rewritten Translations", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "Although our rules are conservative to minimize corruption, some errors are unavoidable propagation of parser errors. For example, the sentence the London Stock Exchange closes at 1230 GMT today is parsed as: 10 (S (NP the London Stock Exchange) (VP (VBZ closes) (PP at 1230) (NP GMT today))) GMT today is separated from the PP as an NP and is mistaken as the object. The passive version is then GMT today is closed at 1230 by the London Stock Exchange. Such errors could be reduced by skipping nodes with low inside/outside scores given by the parser, or skipping low-frequency patterns. However, we leave this for future work.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Quality of Rewritten Translations", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "At test time, we use right probability (Fujita et al., 2013, RP) to decide when to start translating a sentence. As we read in the source Japanese sentence, if the input segment matches an entry in the learned phrase table, we query the RP of the Japanese/English phrase pair. A higher RP indicates that the English translation of this Japanese phrase will likely be followed by the translation of the next Japanese phrase. In other words, translation of the two consecutive Japanese phrases is monotonic, thus, we can begin translating immediately. Following (Fujita et al., 2013) , if the RP of the current phrase is lower than a fixed threshold, we cache the current phrase and wait for more words from the source sentence; otherwise, we translate all cached phrases. Finally, translations of segments are concatenated to form a complete translation of the input sentence.", |
| "cite_spans": [ |
| { |
| "start": 39, |
| "end": 64, |
| "text": "(Fujita et al., 2013, RP)", |
| "ref_id": null |
| }, |
| { |
| "start": 560, |
| "end": 581, |
| "text": "(Fujita et al., 2013)", |
| "ref_id": "BIBREF10" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Segmentation", |
| "sec_num": "5.2" |
| }, |
| { |
| "text": "To show the effect of rewritten references, we compare the following MT systems:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Speed/Accuracy Trade-off", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "\u2022 GD: only gold reference translations;", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Speed/Accuracy Trade-off", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "\u2022 RW: only rewritten reference translations;", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Speed/Accuracy Trade-off", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "\u2022 RW+GD: both gold and the rewritten references; and \u2022 RW-LM+GD: using gold reference translations but using the rewritten references for training the LM and for tuning.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Speed/Accuracy Trade-off", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "For RW+GD and RW-LM+GD, we interpolate the language models of GD and RW. The interpolating weight is tuned with the rewritten sentences. For RW+GD, we combine the translation models (phrase tables and reordering tables) of RW and GD by fill-up combination (Bisazza et al., 2011) , where all entries in the tables of RW are preserved and entries from the tables of GD are added if new. Increasing the RP threshold increases interpretation delay but improves the quality of the translation. We set the RP threshold at 0.0, 0.2, 0.4, 0.8 and finally 1.0 (equivalent to batch translation). Figure 3 shows the BLEU/RIBES scores vs. the number of words per segement as we increase the threshold. Rewritten sentences alone do not significantly improve over the baseline. We suspect this is because the transformation rules sometimes generate ungrammatical sentences due to parsing errors, which impairs learning. However, combining RW and GD results in a better speed-accuracy tradeoff: the RW+GD curve completely dominates other curves in Figure 3a , 3c. Thus, using more monotone translations improves simultaneous machine translation, and because RW-LM+GD is about the same as GD, the major improvement likely comes from the translation model from rewritten sentences. The right two plots recapitulate the evaluation with the RIBES metric. This result is less clear, as MT systems are optimized for BLEU and RIBES penalizes word reordering, making it difficult to compare systems that intentionally change word order. Nevertheless, RW is comparable to GD on gold references and superior to the baseline on rewritten references.", |
| "cite_spans": [ |
| { |
| "start": 256, |
| "end": 278, |
| "text": "(Bisazza et al., 2011)", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 586, |
| "end": 594, |
| "text": "Figure 3", |
| "ref_id": "FIGREF2" |
| }, |
| { |
| "start": 1033, |
| "end": 1042, |
| "text": "Figure 3a", |
| "ref_id": "FIGREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Speed/Accuracy Trade-off", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "Rewriting training data not only creates lower latency simultaneous translations, but it also improves batch translation. One reason is that SOV to SVO translation often drops the verb because of long range reordering. (We see this for Japanese here, but this is also true for German.) Similar word orders in the source and target results in less reordering and improves phrase-based MT ( Xu et al., 2009) . Table 3 shows the number of verbs in the translations of the test sentences produced by GD, RW, RW+GD, as well as the number in the gold reference translation. Both RW and RW+GD produce more verbs (a statistically significant result), although RW+GD captures the most verbs.", |
| "cite_spans": [ |
| { |
| "start": 387, |
| "end": 388, |
| "text": "(", |
| "ref_id": null |
| }, |
| { |
| "start": 389, |
| "end": 405, |
| "text": "Xu et al., 2009)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 408, |
| "end": 415, |
| "text": "Table 3", |
| "ref_id": "TABREF3" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Effect on Verbs", |
| "sec_num": "5.4" |
| }, |
| { |
| "text": "Ref he also said that the real dangers for the euro lay in the potential for divergences in the domestic policy needs among the various participating nations of the single currency.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Effect on Verbs", |
| "sec_num": "5.4" |
| }, |
| { |
| "text": "he also for the euro, is a real danger to launch a single currency in many different countries and domestic policies on the need for the possibility of a difference.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "GD", |
| "sec_num": null |
| }, |
| { |
| "text": "he also for the euro is a real danger to launch a single currency in many different countries and domestic policies to the needs of the possibility of a difference, he said. Table 4 compares translations by GD and RW. RW correctly puts the verb said at the end, while GD drops the final verb. However, RW still produces he at the beginning (also the first word in the Japanese source sentence). This is because our current segmentation strategy do not preserve words for later translation-a note-taking strategy used by human interpreters.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 174, |
| "end": 181, |
| "text": "Table 4", |
| "ref_id": "TABREF4" |
| } |
| ], |
| "eq_spans": [], |
| "section": "RW", |
| "sec_num": null |
| }, |
| { |
| "text": "Previous approaches to simultaneous machine translation have employed explicit interpretation strategies for coping with delay. Two major approaches are segmentation and prediction. Most segmentation strategies are based on heuristics, such as pauses in speech (F\u00fcgen et al., 2007; Bangalore et al., 2009) , comma prediction (Sridhar et al., 2013) and phrase reordering probability (Fujita et al., 2013) . Learning-based methods have also been proposed. Oda et al. (2014) find segmentations that maximize the BLEU score of the final concatenated translation by dynamic programming. Grissom II et al. (2014) formulate simultaneous translation as a sequential decision making problem and uses reinforcement learning to decide when to translate. One limitation of these methods is that when learning with standard batch MT corpus, their gain can be restricted by natural word reordering between the source and the target sentences, as explained in Section 1.", |
| "cite_spans": [ |
| { |
| "start": 261, |
| "end": 281, |
| "text": "(F\u00fcgen et al., 2007;", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 282, |
| "end": 305, |
| "text": "Bangalore et al., 2009)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 325, |
| "end": 347, |
| "text": "(Sridhar et al., 2013)", |
| "ref_id": "BIBREF28" |
| }, |
| { |
| "start": 382, |
| "end": 403, |
| "text": "(Fujita et al., 2013)", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 454, |
| "end": 471, |
| "text": "Oda et al. (2014)", |
| "ref_id": "BIBREF23" |
| }, |
| { |
| "start": 582, |
| "end": 606, |
| "text": "Grissom II et al. (2014)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "6" |
| }, |
| { |
| "text": "In an SOV-SVO context, methods to predict unseen words are proposed to alleviate the above restriction. Matsubara et al. (1999) predict the English verb in the target sentence and integrates it syntactically. Grissom II et al. (2014) predict the final verb in the source sentence and decide when to use the predicted verb with reinforcement learning.", |
| "cite_spans": [ |
| { |
| "start": 104, |
| "end": 127, |
| "text": "Matsubara et al. (1999)", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 209, |
| "end": 233, |
| "text": "Grissom II et al. (2014)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Nevertheless, unless the predictor considers contextual and background information, which human interpreters often rely on for prediction (H\u00f6nig, 1997; Camayd-Freixas, 2011 ), such a prediction task is inherently hard.", |
| "cite_spans": [ |
| { |
| "start": 138, |
| "end": 151, |
| "text": "(H\u00f6nig, 1997;", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 152, |
| "end": 172, |
| "text": "Camayd-Freixas, 2011", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Unlike previous approaches to simultaneous translation, we directly adapt the training data and transform a translated sentence to an \"interpreted\" one. We can, therefore, take advantage of the abundance of parallel batch-translated corpora for training a simultaneous MT system. In addition, as a data preprocessing step, our approach is orthogonal to the others, with which it can be easily combined.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "6" |
| }, |
| { |
| "text": "This work is also related to preprocessing reordering approaches (Xu et al., 2009; Collins et al., 2005; Galley and Manning, 2008; Hoshino et al., 2013; Hoshino et al., 2014) in batch MT for language pairs with substantially different word orders. However, our problem is different in several ways. First, while the approaches resemble each other, our motivation is to reduce translation delay. Second, they reorder the source sentence, which is nontrivial and time-consuming when the sentence is incrementally revealed. Third, rewriting the target sentence requires the output to be grammatical (for it to be used as reference translation), which is not a concern when rewriting source sentences.", |
| "cite_spans": [ |
| { |
| "start": 65, |
| "end": 82, |
| "text": "(Xu et al., 2009;", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 83, |
| "end": 104, |
| "text": "Collins et al., 2005;", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 105, |
| "end": 130, |
| "text": "Galley and Manning, 2008;", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 131, |
| "end": 152, |
| "text": "Hoshino et al., 2013;", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 153, |
| "end": 174, |
| "text": "Hoshino et al., 2014)", |
| "ref_id": "BIBREF15" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Training MT systems with more monotonic (interpretation-like) sentences improves the speedaccuracy tradeoff for simultaneous machine translation. By designing syntactic transformations and rewriting batch translations into more monotonic translations, we reduce the translation delay. MT systems trained on the rewritten reference translations learn interpretation strategies implicitly from the data.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "Our rewrites are based on linguistic knowledge and inspired by techniques used by human interpreters. They cover a wide range of reordering phenomena between Japanese and English, and more generally, between SOV and SVO languages. A natural extension is to automatically extract such rules from parallel corpora. While there exist approaches that extract syntactic tree transformation rules automatically, one of the difficulties is that most parallel corpora is dominated by lexical paraphrasing instead of syntactic paraphrasing.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "Ideally, delay should be based on time lapse. However, timestamping is not applicable to typical MT corpus, therefore we approximate it by number of tokens and ignore decoding time.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "We use a morphological analyzer to distinguish between the conjunction and quotative particles. Examples of words marked by this particle include \u898b\u3089\u308c\u308b (expect), \u8a00\u3046 (say), \u601d\u308f\u308c\u308b (seem), \u3059\u308b (assume), \u4fe1\u3058\u308b (believe) and so on.3 We also include the phrase It looks like.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The main verb excludes be and have when it indicates tense (e.g., have done).5 We use the Nodebox linguistic library (https://www. nodebox.net/code) to detect and modify word forms.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "For example, in clause transformation, the Japanese conjunction moshi, which is clause initial, may appear at the beginning of a sentence to emphasize conditionals, although its appearance is relatively rare.7 Available at http://eijiro.jp 8 Available at http://www.atilika.org/ 9 In contrast to BLEU, RIBES is an order-sensitive metric commonly used for translation between Japanese and English.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "For simplicity we show the shallow parse only.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "This work was supported by NSF grant IIS-1320538. Boyd-Graber is also partially supported by NSF grants CCF-1409287 and NCSE-1422492. Daum\u00e9 III and He are also partially supported by NSF grant IIS-0964681. Any opinions, findings, conclusions, or recommendations expressed here are those of the authors and do not necessarily reflect the view of the sponsor.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgments", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "On the use of compensatory strategies in simultaneous interpretation", |
| "authors": [ |
| { |
| "first": "Raja", |
| "middle": [], |
| "last": "Al-Khanji", |
| "suffix": "" |
| }, |
| { |
| "first": "Said", |
| "middle": [], |
| "last": "El-Shiyab", |
| "suffix": "" |
| }, |
| { |
| "first": "Riyadh", |
| "middle": [], |
| "last": "Hussein", |
| "suffix": "" |
| } |
| ], |
| "year": 2000, |
| "venue": "Journal des Traducteurs", |
| "volume": "45", |
| "issue": "3", |
| "pages": "548--577", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Raja Al-Khanji, Said El-Shiyab, and Riyadh Hussein. 2000. On the use of compensatory strategies in si- multaneous interpretation. Journal des Traducteurs, 45(3):548-577.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Real-time incremental speech-tospeech translation of dialogs", |
| "authors": [ |
| { |
| "first": "Srinivas", |
| "middle": [], |
| "last": "Bangalore", |
| "suffix": "" |
| }, |
| { |
| "first": "Vivek", |
| "middle": [], |
| "last": "Kumar Rangarajan", |
| "suffix": "" |
| }, |
| { |
| "first": "Prakash", |
| "middle": [], |
| "last": "Sridhar", |
| "suffix": "" |
| }, |
| { |
| "first": "Ladan", |
| "middle": [], |
| "last": "Kolan", |
| "suffix": "" |
| }, |
| { |
| "first": "Aura", |
| "middle": [], |
| "last": "Golipour", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Jimene", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Srinivas Bangalore, Vivek Kumar Rangarajan Srid- har, Prakash Kolan, Ladan Golipour, and Aura Jimene. 2009. Real-time incremental speech-to- speech translation of dialogs. In Proceedings of the Conference of the North American Chapter of the As- sociation for Computational Linguistics (NAACL).", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "An approach to corpus-based interpreting studies: Developing EPIC (european parliament interpreting corpus)", |
| "authors": [ |
| { |
| "first": "Claudio", |
| "middle": [], |
| "last": "Bendazzoli", |
| "suffix": "" |
| }, |
| { |
| "first": "Annalisa", |
| "middle": [], |
| "last": "Sandrelli", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "Proceedings of Challenges of Multidimensional Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Claudio Bendazzoli and Annalisa Sandrelli. 2005. An approach to corpus-based interpreting studies: De- veloping EPIC (european parliament interpreting corpus). In Proceedings of Challenges of Multidi- mensional Translation.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Natural Language Processing with Python", |
| "authors": [ |
| { |
| "first": "Steven", |
| "middle": [], |
| "last": "Bird", |
| "suffix": "" |
| }, |
| { |
| "first": "Ewan", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| }, |
| { |
| "first": "Edward", |
| "middle": [], |
| "last": "Loper", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Steven Bird, Ewan Klein, and Edward Loper. 2009. Natural Language Processing with Python. O'Reilly Media.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Fill-up versus interpolation methods for phrase-based SMT adaptation", |
| "authors": [ |
| { |
| "first": "Arianna", |
| "middle": [], |
| "last": "Bisazza", |
| "suffix": "" |
| }, |
| { |
| "first": "Nick", |
| "middle": [], |
| "last": "Ruiz", |
| "suffix": "" |
| }, |
| { |
| "first": "Marcello", |
| "middle": [], |
| "last": "Federico", |
| "suffix": "" |
| } |
| ], |
| "year": 2011, |
| "venue": "Proceedings of International Workshop on Spoken Language Translation (IWSLT)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Arianna Bisazza, Nick Ruiz, and Marcello Federico. 2011. Fill-up versus interpolation methods for phrase-based SMT adaptation. In Proceedings of In- ternational Workshop on Spoken Language Transla- tion (IWSLT).", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Cognitive theory of simultaneous interpreting and training", |
| "authors": [ |
| { |
| "first": "Erik", |
| "middle": [], |
| "last": "Camayd-Freixas", |
| "suffix": "" |
| } |
| ], |
| "year": 2011, |
| "venue": "Proceedings of the 52nd Conference of the American Translators Association", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Erik Camayd-Freixas. 2011. Cognitive theory of si- multaneous interpreting and training. In Proceed- ings of the 52nd Conference of the American Trans- lators Association.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Batch tuning strategies for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Colin", |
| "middle": [], |
| "last": "Cherry", |
| "suffix": "" |
| }, |
| { |
| "first": "George", |
| "middle": [], |
| "last": "Foster", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Colin Cherry and George Foster. 2012. Batch tuning strategies for statistical machine translation. In Pro- ceedings of the Conference of the North American Chapter of the Association for Computational Lin- guistics (NAACL).", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Clause restructuring for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Michael", |
| "middle": [], |
| "last": "Collins", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Ivona", |
| "middle": [], |
| "last": "Ku\u010derov\u00e1", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "Proceedings of the annual meeting of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Michael Collins, Philipp Koehn, and Ivona Ku\u010derov\u00e1. 2005. Clause restructuring for statistical machine translation. In Proceedings of the annual meet- ing of the Association for Computational Linguistics (ACL).", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Framesemantic parsing", |
| "authors": [ |
| { |
| "first": "Dipanjan", |
| "middle": [], |
| "last": "Das", |
| "suffix": "" |
| }, |
| { |
| "first": "Desai", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "F", |
| "middle": [ |
| "T" |
| ], |
| "last": "Andr\u00e9", |
| "suffix": "" |
| }, |
| { |
| "first": "Nathan", |
| "middle": [], |
| "last": "Martins", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah", |
| "middle": [ |
| "A" |
| ], |
| "last": "Schneider", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Computational Linguistics", |
| "volume": "", |
| "issue": "1", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dipanjan Das, Desai Chen, Andr\u00e9 F. T. Martins, Nathan Schneider, , and Noah A. Smith. 2014. Frame- semantic parsing. Computational Linguistics, 40(1).", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Simultaneous translation of lectures and speeches", |
| "authors": [ |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "F\u00fcgen", |
| "suffix": "" |
| }, |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Waibel", |
| "suffix": "" |
| }, |
| { |
| "first": "Muntsin", |
| "middle": [], |
| "last": "Kolss", |
| "suffix": "" |
| } |
| ], |
| "year": 2007, |
| "venue": "Machine Translation", |
| "volume": "21", |
| "issue": "4", |
| "pages": "209--252", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Christian F\u00fcgen, Alex Waibel, , and Muntsin Kolss. 2007. Simultaneous translation of lectures and speeches. Machine Translation, 21(4):209-252.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Simple, lexicalized choice of translation timing for simultaneous speech translation", |
| "authors": [ |
| { |
| "first": "Tomoki", |
| "middle": [], |
| "last": "Fujita", |
| "suffix": "" |
| }, |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| }, |
| { |
| "first": "Sakriani", |
| "middle": [], |
| "last": "Sakti", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomoki", |
| "middle": [], |
| "last": "Toda", |
| "suffix": "" |
| }, |
| { |
| "first": "Satoshi", |
| "middle": [], |
| "last": "Nakamura", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of Interspeech", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tomoki Fujita, Graham Neubig, Sakriani Sakti, Tomoki Toda, and Satoshi Nakamura. 2013. Simple, lexicalized choice of translation timing for simulta- neous speech translation. In Proceedings of Inter- speech.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "A simple and effective hierarchical phrase reordering model", |
| "authors": [ |
| { |
| "first": "Michel", |
| "middle": [], |
| "last": "Galley", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher", |
| "middle": [ |
| "D" |
| ], |
| "last": "Manning", |
| "suffix": "" |
| } |
| ], |
| "year": 2008, |
| "venue": "Proceedings of Empirical Methods in Natural Language Processing (EMNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Michel Galley and Christopher D. Manning. 2008. A simple and effective hierarchical phrase reordering model. In Proceedings of Empirical Methods in Nat- ural Language Processing (EMNLP).", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Don't until the final verb wait: Reinforcement learning for simultaneous machine translation", |
| "authors": [ |
| { |
| "first": "Alvin", |
| "middle": [ |
| "C" |
| ], |
| "last": "Grissom", |
| "suffix": "" |
| }, |
| { |
| "first": "I", |
| "middle": [ |
| "I" |
| ], |
| "last": "", |
| "suffix": "" |
| }, |
| { |
| "first": "He", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Jordan", |
| "middle": [], |
| "last": "Boyd-Graber", |
| "suffix": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Morgan", |
| "suffix": "" |
| }, |
| { |
| "first": "Hal", |
| "middle": [], |
| "last": "Daum\u00e9", |
| "suffix": "" |
| }, |
| { |
| "first": "Iii", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alvin C. Grissom II, He He, Jordan Boyd-Graber, John Morgan, and Hal Daum\u00e9 III. 2014. Don't until the final verb wait: Reinforcement learning for si- multaneous machine translation. In Proceedings of Empirical Methods in Natural Language Processing (EMNLP).", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Using text mappings in teaching consecutive interpreting. Translation and Translation Theory", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Hans", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "H\u00f6nig", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "19--34", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hans G. H\u00f6nig. 1997. Using text mappings in teach- ing consecutive interpreting. Translation and Trans- lation Theory, pages 19-34.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Two-stage pre-ordering for Japanese-to-English statistical machine translation", |
| "authors": [ |
| { |
| "first": "Sho", |
| "middle": [], |
| "last": "Hoshino", |
| "suffix": "" |
| }, |
| { |
| "first": "Yusuke", |
| "middle": [], |
| "last": "Miyao", |
| "suffix": "" |
| }, |
| { |
| "first": "Katsuhito", |
| "middle": [], |
| "last": "Sudoh", |
| "suffix": "" |
| }, |
| { |
| "first": "Masaaki", |
| "middle": [], |
| "last": "Nagata", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "International Joint Conference on Artificial Intelligence (IJCNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sho Hoshino, Yusuke Miyao, Katsuhito Sudoh, and Masaaki Nagata. 2013. Two-stage pre-ordering for Japanese-to-English statistical machine translation. In International Joint Conference on Artificial Intel- ligence (IJCNLP).", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Japanese to english machine translation using preordering and compositional distributed semantics", |
| "authors": [ |
| { |
| "first": "Sho", |
| "middle": [], |
| "last": "Hoshino", |
| "suffix": "" |
| }, |
| { |
| "first": "Hubert", |
| "middle": [], |
| "last": "Soyer", |
| "suffix": "" |
| }, |
| { |
| "first": "Yusuke", |
| "middle": [], |
| "last": "Miyao", |
| "suffix": "" |
| }, |
| { |
| "first": "Akiko", |
| "middle": [], |
| "last": "Aizawa", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Workshop on Asian Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sho Hoshino, Hubert Soyer, Yusuke Miyao, and Akiko Aizawa. 2014. Japanese to english machine transla- tion using preordering and compositional distributed semantics. In Workshop on Asian Translation.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Automatic evaluation of translation quality for distant language pairs", |
| "authors": [ |
| { |
| "first": "Hideki", |
| "middle": [], |
| "last": "Isozaki", |
| "suffix": "" |
| }, |
| { |
| "first": "Tsutomu", |
| "middle": [], |
| "last": "Hirao", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Duh", |
| "suffix": "" |
| }, |
| { |
| "first": "Katsuhito", |
| "middle": [], |
| "last": "Sudoh", |
| "suffix": "" |
| }, |
| { |
| "first": "Hajime", |
| "middle": [], |
| "last": "Tsukada", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "Proceedings of Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hideki Isozaki, Tsutomu Hirao, Kevin Duh, Katsuhito Sudoh, and Hajime Tsukada. 2010. Automatic evaluation of translation quality for distant language pairs. In Proceedings of Empirical Methods in Nat- ural Language Processing (EMNLP).", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Accurate unlexicalized parsing", |
| "authors": [ |
| { |
| "first": "Dan", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher", |
| "middle": [ |
| "D" |
| ], |
| "last": "Manning", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Proceedings of the annual meeting of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dan Klein and Christopher D. Manning. 2003. Accu- rate unlexicalized parsing. In Proceedings of the an- nual meeting of the Association for Computational Linguistics (ACL).", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "Moses: Open source toolkit for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Hieu", |
| "middle": [], |
| "last": "Hoang", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexandra", |
| "middle": [], |
| "last": "Birch", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Callison-Burch", |
| "suffix": "" |
| }, |
| { |
| "first": "Marcello", |
| "middle": [], |
| "last": "Federico", |
| "suffix": "" |
| }, |
| { |
| "first": "Brooke", |
| "middle": [], |
| "last": "Cowan Nicola", |
| "suffix": "" |
| }, |
| { |
| "first": "Wade", |
| "middle": [], |
| "last": "Bertoldi", |
| "suffix": "" |
| }, |
| { |
| "first": "Richard Zens Christine", |
| "middle": [], |
| "last": "Shen", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Moran", |
| "suffix": "" |
| }, |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Dyer", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexandra", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Evan", |
| "middle": [], |
| "last": "Constantin", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Herbs", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Proceedings of the annual meeting of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Brooke Cowan Nicola Bertoldi, Wade Shen, Richard Zens Chris- tine Moran, Chris Dyer, Ond\u0159ej Bojar, Alexandra Constantin, and Evan Herbs. 2003. Moses: Open source toolkit for statistical machine translation. In Proceedings of the annual meeting of the Associa- tion for Computational Linguistics (ACL).", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Sync/trans: Simultaneous machine interpretation between English and Japanese", |
| "authors": [ |
| { |
| "first": "Shigeki", |
| "middle": [], |
| "last": "Matsubara", |
| "suffix": "" |
| }, |
| { |
| "first": "Katsuhiko", |
| "middle": [], |
| "last": "Toyama", |
| "suffix": "" |
| }, |
| { |
| "first": "Yasuyoshi", |
| "middle": [], |
| "last": "Inagaki", |
| "suffix": "" |
| } |
| ], |
| "year": 1999, |
| "venue": "Advanced Topics in Artificial Intelligence", |
| "volume": "", |
| "issue": "", |
| "pages": "134--143", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shigeki Matsubara, Katsuhiko Toyama, and Yasuyoshi Inagaki. 1999. Sync/trans: Simultaneous machine interpretation between English and Japanese. In Ad- vanced Topics in Artificial Intelligence, pages 134- 143. Springer.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "Bilingual spoken monologue corpus for simultaneous machine interpretation research", |
| "authors": [ |
| { |
| "first": "Shigeki", |
| "middle": [], |
| "last": "Matsubara", |
| "suffix": "" |
| }, |
| { |
| "first": "Akira", |
| "middle": [], |
| "last": "Takagi", |
| "suffix": "" |
| }, |
| { |
| "first": "Nobuo", |
| "middle": [], |
| "last": "Kawaguchi", |
| "suffix": "" |
| }, |
| { |
| "first": "Yasuyoshi", |
| "middle": [], |
| "last": "Inagaki", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the Language Resources and Evaluation Conference (LREC)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shigeki Matsubara, Akira Takagi, Nobuo Kawaguchi, and Yasuyoshi Inagaki. 2002. Bilingual spoken monologue corpus for simultaneous machine inter- pretation research. In Proceedings of the Language Resources and Evaluation Conference (LREC).", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "The Kyoto free translation task", |
| "authors": [ |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| } |
| ], |
| "year": 2011, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Graham Neubig. 2011. The Kyoto free translation task. Available online at http://www. phontron. com/kftt.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "A systematic comparison of various statistical alignment models", |
| "authors": [ |
| { |
| "first": "Josef", |
| "middle": [], |
| "last": "Franz", |
| "suffix": "" |
| }, |
| { |
| "first": "Hermann", |
| "middle": [], |
| "last": "Och", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ney", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Computational Linguistics", |
| "volume": "29", |
| "issue": "1", |
| "pages": "19--51", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Franz Josef Och and Hermann Ney. 2003. A system- atic comparison of various statistical alignment mod- els. Computational Linguistics, 29(1):19-51.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "Optimizing segmentation strategies for simultaneous speech translation", |
| "authors": [ |
| { |
| "first": "Yusuke", |
| "middle": [], |
| "last": "Oda", |
| "suffix": "" |
| }, |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| }, |
| { |
| "first": "Sakriani", |
| "middle": [], |
| "last": "Sakti", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomoki", |
| "middle": [], |
| "last": "Toda", |
| "suffix": "" |
| }, |
| { |
| "first": "Satoshi", |
| "middle": [], |
| "last": "Nakamura", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yusuke Oda, Graham Neubig, Sakriani Sakti, Tomoki Toda, and Satoshi Nakamura. 2014. Optimizing seg- mentation strategies for simultaneous speech transla- tion. In Proceedings of the Association for Compu- tational Linguistics (ACL), June.", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "BLEU: a method for automatic evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Kishore", |
| "middle": [], |
| "last": "Papineni", |
| "suffix": "" |
| }, |
| { |
| "first": "Salim", |
| "middle": [], |
| "last": "Roukos", |
| "suffix": "" |
| }, |
| { |
| "first": "Todd", |
| "middle": [], |
| "last": "Ward", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei-Jing", |
| "middle": [], |
| "last": "Zhu", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the annual meeting of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, , and Wei-Jing Zhu. 2002. BLEU: a method for automatic evaluation of machine translation. In Proceedings of the annual meeting of the Association for Computa- tional Linguistics (ACL).", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "Spoken language translation from parallel speech audio: Simultaneous interpretation as slt training data", |
| "authors": [ |
| { |
| "first": "Matthias", |
| "middle": [], |
| "last": "Paulik", |
| "suffix": "" |
| }, |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Waibel", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "Proceedings of the International Conference on Acoustics, Speech, and Signal Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Matthias Paulik and Alex Waibel. 2010. Spoken lan- guage translation from parallel speech audio: Simul- taneous interpretation as slt training data. In Pro- ceedings of the International Conference on Acous- tics, Speech, and Signal Processing (ICASSP).", |
| "links": null |
| }, |
| "BIBREF26": { |
| "ref_id": "b26", |
| "title": "Constructing a speech translation system using simultaneous interpretation data", |
| "authors": [ |
| { |
| "first": "Hiroaki", |
| "middle": [], |
| "last": "Shimizu", |
| "suffix": "" |
| }, |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| }, |
| { |
| "first": "Sakriani", |
| "middle": [], |
| "last": "Sakti", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomoki", |
| "middle": [], |
| "last": "Toda", |
| "suffix": "" |
| }, |
| { |
| "first": "Satoshi", |
| "middle": [], |
| "last": "Nakamura", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of International Workshop on Spoken Language Translation (IWSLT)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hiroaki Shimizu, Graham Neubig, Sakriani Sakti, Tomoki Toda, and Satoshi Nakamura. 2013. Con- structing a speech translation system using simulta- neous interpretation data. In Proceedings of Inter- national Workshop on Spoken Language Translation (IWSLT).", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "Collection of a simultaneous translation corpus for comparative analysis", |
| "authors": [ |
| { |
| "first": "Hiroaki", |
| "middle": [], |
| "last": "Shimizu", |
| "suffix": "" |
| }, |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| }, |
| { |
| "first": "Sakriani", |
| "middle": [], |
| "last": "Sakti", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomoki", |
| "middle": [], |
| "last": "Toda", |
| "suffix": "" |
| }, |
| { |
| "first": "Satoshi", |
| "middle": [], |
| "last": "Nakamura", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "International Language Resources and Evaluation (LREC)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hiroaki Shimizu, Graham Neubig, Sakriani Sakti, Tomoki Toda, and Satoshi Nakamura. 2014. Collec- tion of a simultaneous translation corpus for compar- ative analysis. In International Language Resources and Evaluation (LREC).", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "Srinivas Bangalore Andrej Ljolje, and Rathinavelu Chengalvarayan", |
| "authors": [ |
| { |
| "first": "Vivek", |
| "middle": [], |
| "last": "Kumar Rangarajan", |
| "suffix": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Sridhar", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Vivek Kumar Rangarajan Sridhar, John Chen, Srinivas Bangalore Andrej Ljolje, and Rathinavelu Chengal- varayan. 2013. Segmentation strategies for stream- ing speech translation. In Proceedings of the Con- ference of the North American Chapter of the Asso- ciation for Computational Linguistics (NAACL).", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "Collection of simultaneous interpreting patterns by using bilingual spoken monologue corpus", |
| "authors": [ |
| { |
| "first": "Hitomi", |
| "middle": [], |
| "last": "Tohyama", |
| "suffix": "" |
| }, |
| { |
| "first": "Shigeki", |
| "middle": [], |
| "last": "Matsubara", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "Proceedings of the Language Resources and Evaluation Conference (LREC)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hitomi Tohyama and Shigeki Matsubara. 2006. Col- lection of simultaneous interpreting patterns by us- ing bilingual spoken monologue corpus. In Proceed- ings of the Language Resources and Evaluation Con- ference (LREC).", |
| "links": null |
| }, |
| "BIBREF30": { |
| "ref_id": "b30", |
| "title": "Reliable measures for aligning japanese-english news articles and sentences", |
| "authors": [ |
| { |
| "first": "Masao", |
| "middle": [], |
| "last": "Utiyama", |
| "suffix": "" |
| }, |
| { |
| "first": "Hitoshi", |
| "middle": [], |
| "last": "Isahara", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Proceedings of the annual meeting of the Association for Computational Linguistics (ACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Masao Utiyama and Hitoshi Isahara. 2003. Reliable measures for aligning japanese-english news articles and sentences. In Proceedings of the annual meet- ing of the Association for Computational Linguistics (ACL).", |
| "links": null |
| }, |
| "BIBREF31": { |
| "ref_id": "b31", |
| "title": "Using a dependency parser to improve SMT for subject-object-verb language", |
| "authors": [ |
| { |
| "first": "Peng", |
| "middle": [], |
| "last": "Xu", |
| "suffix": "" |
| }, |
| { |
| "first": "Jaeho", |
| "middle": [], |
| "last": "Kang", |
| "suffix": "" |
| }, |
| { |
| "first": "Michael", |
| "middle": [], |
| "last": "Ringgaard", |
| "suffix": "" |
| }, |
| { |
| "first": "Franz", |
| "middle": [], |
| "last": "Och", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Peng Xu, Jaeho Kang, Michael Ringgaard, , and Franz Och. 2009. Using a dependency parser to improve SMT for subject-object-verb language. In Proceed- ings of the Conference of the North American Chap- ter of the Association for Computational Linguistics (NAACL).", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "We-TOP government-GEN structure and composition-ACC change should structure and composition should be changed by us Batch:" |
| }, |
| "FIGREF1": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "For example, O: It is important to remain watchful. R: To remain watchful is important." |
| }, |
| "FIGREF2": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "Speed/accuracy tradeoff curves: BLEU (left) / RIBES (right) versus translation delay (average number of words per segment)." |
| }, |
| "TABREF0": { |
| "type_str": "table", |
| "html": null, |
| "content": "<table><tr><td/><td>Train Tune</td><td>Test</td></tr><tr><td>Ja</td><td colspan=\"2\">21.3M 30.2k 23.3k</td></tr><tr><td>En-</td><td/></tr></table>", |
| "num": null, |
| "text": "Number of words in the training, tuning, and test datasets. En-GD and En-RW represent the gold reference set and the rewritten reference set." |
| }, |
| "TABREF3": { |
| "type_str": "table", |
| "html": null, |
| "content": "<table><tr><td>: Number of verbs in the test set transla-</td></tr><tr><td>tion produced by different models and the gold</td></tr><tr><td>reference translation. Boldface indicates the num-</td></tr><tr><td>ber is significantly larger than others (excluding</td></tr><tr><td>the gold ref) according to two-sample t-tests with</td></tr><tr><td>p < 0.001.</td></tr></table>", |
| "num": null, |
| "text": "" |
| }, |
| "TABREF4": { |
| "type_str": "table", |
| "html": null, |
| "content": "<table/>", |
| "num": null, |
| "text": "Example of translation produced by GD and RW." |
| } |
| } |
| } |
| } |
