Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "N12-1036",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T14:05:15.098474Z"
},
"title": "TransAhead: A Computer-Assisted Translation and Writing Tool *",
"authors": [
{
"first": "Chung-Chi",
"middle": [],
"last": "Huang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "Ping-Che",
"middle": [],
"last": "Yang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "Keh-Jiann",
"middle": [],
"last": "Chen",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": "kchen@iis.sinica.edu.tw"
},
{
"first": "Jason",
"middle": [
"S"
],
"last": "Chang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": "jason.jschang@gmail.com"
},
{
"first": "Academia",
"middle": [],
"last": "Iis",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Sinica",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Taipei",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "R",
"middle": [
"O C"
],
"last": "Taiwan",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
},
{
"first": "",
"middle": [
"C"
],
"last": "Cs",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "III",
"location": {
"settlement": "Taipei",
"country": "Taiwan, R.O.C"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We introduce a method for learning to predict text completion given a source text and partial translation. In our approach, predictions are offered aimed at alleviating users' burden on lexical and grammar choices, and improving productivity. The method involves learning syntax-based phraseology and translation equivalents. At run-time, the source and its translation prefix are sliced into ngrams to generate and rank completion candidates, which are then displayed to users. We present a prototype writing assistant, TransAhead, that applies the method to computer-assisted translation and language learning. The preliminary results show that the method has great potentials in CAT and CALL with significant improvement in translation quality across users.",
"pdf_parse": {
"paper_id": "N12-1036",
"_pdf_hash": "",
"abstract": [
{
"text": "We introduce a method for learning to predict text completion given a source text and partial translation. In our approach, predictions are offered aimed at alleviating users' burden on lexical and grammar choices, and improving productivity. The method involves learning syntax-based phraseology and translation equivalents. At run-time, the source and its translation prefix are sliced into ngrams to generate and rank completion candidates, which are then displayed to users. We present a prototype writing assistant, TransAhead, that applies the method to computer-assisted translation and language learning. The preliminary results show that the method has great potentials in CAT and CALL with significant improvement in translation quality across users.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "More and more language workers and learners use the MT systems on the Web for information gathering and language learning. However, web translation systems typically offer top-1 translations (which are usually far from perfect) and hardly interact with the user.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Text translation could be achieved more interactively and effectively if a system considered translation as a collaborative between the machine generating suggestions and the user accepting or overriding on those suggestions, with the system adapting to the user's action.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Consider the source sentence \"\u6211\u5011\u5728\u5b8c\u6210\u9019\u7b46\u4ea4 \u6613\u4e0a\u626e\u6f14\u91cd\u8981\u89d2\u8272\" (We play an important role in closing this deal). The best man-machine interaction is probably not the one used by typical existing MT systems. A good working environment might be a translation assistant that offers suggestions and gives the user direct control over the target text. We present a system, TransAhead 1 , that learns to predict and suggest lexical translations (and their grammatical patterns) likely to follow the ongoing translation of a source text, and adapts to the user's choices. Example responses of TransAhead to the source sentence \"\u6211\u5011\u5728\u5b8c\u6210\u9019\u7b46 \u4ea4 \u6613 \u4e0a \u626e \u6f14\u91cd \u8981 \u89d2 \u8272 \" and two partial translations are shown in Figure 1 . The responses include text and grammatical patterns (in all-cap labels representing parts-of-speech). TransAhead determines and displays the probable subsequent grammatical constructions and partial translations in the form of parts-of-speech and words (e.g., \"IN[in] VBG[close,\u2026]\" for keywords \"play role\" where lexical items in square brackets are lemmas of potential translations) in a pop-up. TransAhead learns these constructs and translations during training.",
"cite_spans": [],
"ref_spans": [
{
"start": 676,
"end": 684,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "At run-time, TransAhead starts with a source sentence, and iterates with the user, making predictions on the grammar patterns and lexical translations, while adapting to the user's translation choices to resolve ambiguities in the source sentence related to word segmentation and word sense. In our prototype, TransAhead mediates between users and suggestion modules to translation quality and productivity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Computer Assisted Translation (CAT) has been an area of active research. We focus on offering suggestions during the translation process with an Figure 1 . Example TransAhead responses to a source text under the translation (a) \"we\" and (b) \"we play an important role\". Note that the grammar/text predictions of (a) and (b) are not placed directly under the caret (current input focus) for space limit. (c) and (d) depict predominant grammar constructs which follow and (e) summarizes the confident translations of the source's character-based ngrams. The frequency of grammar pattern is shown in round brackets while the history (i.e., keyword) based on the user input is shown in shades. emphasis on language learning. Specifically, our goal is to build a translation assistant to help translator (or learner-translator) with inline grammar help and translation. Unlike recent research focusing on professional (e.g., Brown and Nirenburg, 1990) , we target on both professional and student translators.",
"cite_spans": [
{
"start": 920,
"end": 946,
"text": "Brown and Nirenburg, 1990)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 145,
"end": 153,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "More recently, interactive MT (IMT) systems have begun to shift the user's role from postediting machine output to collaborating with the machine to produce the target text. Foster et al (2000) describe TransType, a pioneering system that supports next word predictions. Along the similar line, Koehn (2009) develops caitra which predicts and displays phrasal translation suggestions one phrase at a time. The main difference between their systems and TransAhead is that we also display grammar patterns to provide the general patterns of predicted translations so a student translator can learn and become more proficient.",
"cite_spans": [
{
"start": 174,
"end": 193,
"text": "Foster et al (2000)",
"ref_id": null
},
{
"start": 295,
"end": 307,
"text": "Koehn (2009)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Recent work has been done on using fullyfledged statistical MT systems to produce target hypotheses completing user-validated translation prefix in IMT paradigm. Barrachina et al. (2008) investigate the applicability of different MT kernels within IMT framework. Nepveu et al. (2004) and Ortiz-Martinez et al. (2011) further exploit user feedbacks for better IMT systems and user experience. Instead of triggered by user correction, our method is triggered by word delimiter and assists both translation and learning the target language.",
"cite_spans": [
{
"start": 162,
"end": 186,
"text": "Barrachina et al. (2008)",
"ref_id": "BIBREF1"
},
{
"start": 263,
"end": 283,
"text": "Nepveu et al. (2004)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In contrast to the previous CAT research, we present a writing assistant that suggests grammar constructs as well as lexical translations following users' partial translation, aiming to provide users with choice to ease mental burden and enhance performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "We focus on predicting a set of grammar patterns with lexical translations likely to follow the current partial target translation of a source text. The predictions will be examined by a human user directly. Not to overwhelm the user, our goal is to return a reasonable-sized set of predictions that contain suitable word choices and grammatical patterns to choose and learn from. Formally, Problem Statement: We are given a targetlanguage reference corpus Ct, a parallel corpus Cst, a source-language text S, and its translation prefix T p . Our goal is to provide a set of predictions based on Ct and Cst likely to further translate S in terms of grammar and text. For this, we transform S and T p into sets of ngrams such that the predominant grammar constructs with suitable translation options following T p are likely to be acquired. Translations for the source text: \"\u6211\u5011\": we, \u2026; \"\u5b8c\u6210\": close, end, \u2026; \u2026; \"\u626e\u6f14\": play, \u2026; \"\u91cd\u8981\": critical, \u2026; \u2026; \"\u626e\": act, \u2026; \u2026; \"\u91cd\": heavy, \u2026; \"\u8981\": will, wish, \u2026; \"\u89d2\": cents, \u2026; \"\u8272\": outstanding, \u2026",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement",
"sec_num": "3.1"
},
{
"text": "Input your source text and start to interact with TransAhead!",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Statement",
"sec_num": "3.1"
},
{
"text": "In the training stage, we find and store syntaxbased phraseological tendencies and translation pairs. These patterns and translations are intended to be used in a real-time system to respond to user input speedily. First, we part of speech tag sentences in Ct. Using common phrase patterns (e.g., the possessive noun one's in \"make up one's mind\") seen in grammar books, we resort to parts-ofspeech (POS) for syntactic generalization. Then, we build up inverted files of the words in Ct for the next stage (i.e., pattern grammar generation). Apart from sentence and position information, a word's lemma and POS are also recorded.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning to Find Pattern and Translation",
"sec_num": "3.2"
},
{
"text": "Subsequently, we use the procedure in Figure 2 to generate grammar patterns following any given sequence of words, either contiguous or skipped. The algorithm first identifies the sentences containing the given sequence of words, query. Iteratively, Step 3performs an AND operation on the inverted file, InvList, of the current word w i and interInvList, a previous intersected results.",
"cite_spans": [],
"ref_spans": [
{
"start": 38,
"end": 46,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Learning to Find Pattern and Translation",
"sec_num": "3.2"
},
{
"text": "After that, we analyze query's syntax-based phraseology (Step (5)). For each element of the form ([wordPosi(w 1 ),\u2026, wordPosi(w n )], sentence number) denoting the positions of query's words in the sentence, we generate grammar pattern involving replacing words in the sentence with POS tags and words in wordPosi(w i ) with lemmas, and extracting fixed-window 2 segments surrounding query from the transformed sentence. The result is a set of grammatical patterns (i.e., syntax-based phraseology) for the query. The procedure finally returns top N predominant 2 Inspired by (Gamon and Leacock, 2010) . syntactic patterns of the query. Such patterns characterizing the query's word usages in the spirit of pattern grammar in (Hunston and Francis, 2000) and are collected across the target language.",
"cite_spans": [
{
"start": 575,
"end": 600,
"text": "(Gamon and Leacock, 2010)",
"ref_id": "BIBREF4"
},
{
"start": 725,
"end": 752,
"text": "(Hunston and Francis, 2000)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Learning to Find Pattern and Translation",
"sec_num": "3.2"
},
{
"text": "In the fourth and final stage, we exploit Cst for bilingual phrase acquisition, rather than a manual dictionary, to achieve better translation coverage and variety. We obtain phrase pairs through a number of steps, namely, leveraging IBM models for bidirectional word alignments, grow-diagonalfinal heuristics to extract phrasal equivalences (Koehn et al., 2003) .",
"cite_spans": [
{
"start": 342,
"end": 362,
"text": "(Koehn et al., 2003)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Learning to Find Pattern and Translation",
"sec_num": "3.2"
},
{
"text": "Once translation equivalents and phraseological tendencies are learned, they are stored for run-time reference. TransAhead then predicts/suggests the following grammar and text of a translation prefix given the source text using the procedure in Figure 3 . We first slice the source text S into characterlevel ngrams, represented by {s i }. We also find the word-level ngrams of the translation prefix T p . But this time we concentrate on the ngrams, may skipped, ending with the last word of T p (i.e., pivoted on the last word) since these ngrams are most related to the subsequent grammar patterns.",
"cite_spans": [],
"ref_spans": [
{
"start": 246,
"end": 255,
"text": "Figure 3",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "Step 3and 4retrieve translations and patterns learned from Section 3.2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "Step 3acquires the target-language active vocabulary that may be used to translate the source. To alleviate the word boundary issue in MT (Ma et al. (2007) ), the word boundary in our system is loosely decided. Initially, TransAhead non-deterministically segments the source text using character ngrams for translations and proceeds with collaborations with the user to obtain the segmentation for MT and to complete the translation. Note that T p may reflect some translated segments, reducing the size of the active vocabulary, and that a user vocabulary of preference (due to users' domain knowledge or procedure PatternFinding(query,N,C t ) (1) interInvList=findInvertedFile(w1 of query)",
"cite_spans": [
{
"start": 138,
"end": 155,
"text": "(Ma et al. (2007)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "for each word wi in query except for w1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "(2) InvList=findInvertedFile(wi) (3a) newInterInvList= \u03c6 ; i=1; j=1 (3b) while i<=length(interInvList) and j<=lengh(InvList) (3c) if interInvList[i].SentNo==InvList[j].SentNo (3d) Insert(newInterInvList, interInvList[i],InvList[j]) else (3e) Move i,j accordingly (3f) interInvList=newInterInvList (4) Usage= \u03c6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "for each element in interInvList (5) Usage+={PatternGrammarGeneration(element,C t )} (6) Sort patterns in Usage in descending order of frequency (7) return the N patterns in Usage with highest frequency procedure MakePrediction(S,Tp) (1) Assign sliceNgram(S) to {si} (2) Assign sliceNgramWithPivot(Tp) to {tj} (3) TransOptions=findTranslation({si},Tp) (4) GramOptions=findPattern({tj}) (5) Evaluate translation options in TransOptions and incorporate them into GramOptions (6) Return GramOptions errors of the system) may be exploited for better system performance. In addition, Step (4) extracts patterns preceding with the history ngrams of {t j }.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "In Step (5), we first evaluate and rank the translation candidates using linear combination:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "( ) ( ) ( ) ( ) 1 1 1 2 2 i i p P t s P s t P t T \u03bb \u03bb \u00d7 + + \u00d7",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "where \u03bb i is combination weight, P 1 and P 2 are translation and language model respectively, and t is one of the translation candidates under S and T p . Subsequently, we incorporate the lemmatized translation candidates according to their ranks into suitable grammar constituents in GramOptions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "For example, we would include \"close\" in pattern \"play role IN[in] VBG\" as \"play role IN[in] VBG[close]\". At last, the algorithm returns the representative grammar patterns with confident translations expected to follow the ongoing translation and further translate the source. This algorithm will be triggered by word delimiter to provide an interactive CAT and CALL environment. Figure 1 shows example responses of our working prototype.",
"cite_spans": [],
"ref_spans": [
{
"start": 381,
"end": 389,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Run-Time Grammar and Text Prediction",
"sec_num": "3.3"
},
{
"text": "In developing TransAhead, we used British National Corpus and Hong Kong Parallel Text as target-language reference corpus and parallel training corpus respectively, and deployed GENIA tagger for lemma and POS analyses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Preliminary Results",
"sec_num": "4"
},
{
"text": "To evaluate TransAhead in CAT and CALL, we introduced it to a class of 34 (Chinese) college freshmen learning English as foreign language. We designed TransAhead to be accessible and intuitive, so the user training tutorial took only one minute.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Preliminary Results",
"sec_num": "4"
},
{
"text": "After the tutorial, the participants were asked to translate 15 Chinese texts from (Huang et al., 2011) (half with TransAhead assistance called experimental group, and the other without any system help whatsoever called control group). The evaluation results show that the experimental group achieved much better translation quality than the control group with an average BLEU score (Papineni et al., 2002) of 35.49 vs. 26.46. Admittedly, the MT system Google Translate produced translations with a higher BLEU score of 44.82.",
"cite_spans": [
{
"start": 83,
"end": 103,
"text": "(Huang et al., 2011)",
"ref_id": "BIBREF5"
},
{
"start": 383,
"end": 406,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Preliminary Results",
"sec_num": "4"
},
{
"text": "Google Translate obviously has much more parallel training data and bilingual translation knowledge. No previous work in CAT uses Google Translate for comparison. Although there is a difference in average translation quality between the experimental TransAhead group and the Google Translate, it is not hard for us to notice the source sentences were better translated by language learners with the help of TransAhead. Take the sentence \"\u6211\u5011\u5728\u5b8c\u6210\u9019\u7b46\u4ea4\u6613\u4e0a\u626e\u6f14\u91cd\u8981\u89d2 \u8272\" for example. A total of 90% of the participants in the experimental group produced more grammatical and fluent translations (see Figure 4 ) than that (\"We conclude this transaction plays an important role\") by Google Translate. Post-experiment surveys indicate that (a) the participants found Google Translate lack humancomputer interaction while TransAhead is intuitive to collaborate with in translation/writing; (b) the participants found TransAhead grammar and translation predictions useful for their immediate task and for learning; (c) interactivity made the translation and language learning a fun process (like image tagging game of (von Ahn and Dabbish, 2004)) and the participants found TransAhead very recommendable and would like to use it again in future translation tasks.",
"cite_spans": [],
"ref_spans": [
{
"start": 586,
"end": 594,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Preliminary Results",
"sec_num": "4"
},
{
"text": "We have introduced a method for learning to offer grammar and text predictions expected to assist the user in translation and writing. We have implemented and evaluated the method. The preliminary results are encouragingly promising. As for the further work, we intend to evaluate and improve our system further in learner productivity in terms of output quality, typing speed, and the amount of using certain keys such as delete and backspace.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "5"
},
{
"text": "http://140.114.214.80/theSite/TransAhead/ (Chrome only)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This study is conducted under the \"Project Digital Convergence Service Open Platform\" of the Institute for Information Industry which is subsidized by the Ministry of Economy Affairs of the Republic of China.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgement",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "we play(ed) an important role in ending this/the deal",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "we play(ed) an important role in ending this/the deal.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Statistical approaches to computer-assisted translation",
"authors": [
{
"first": "S",
"middle": [],
"last": "Barrachina",
"suffix": ""
},
{
"first": "O",
"middle": [],
"last": "Bender",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Casacuberta",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Civera",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Cubel",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Khadivi",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Lagarda",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Ney",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tomas",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Vidal",
"suffix": ""
},
{
"first": "J.-M",
"middle": [],
"last": "Vilar",
"suffix": ""
}
],
"year": 2008,
"venue": "Computational Linguistics",
"volume": "35",
"issue": "1",
"pages": "3--28",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Barrachina, O. Bender, F. Casacuberta, J. Civera, E. Cubel, S. Khadivi, A. Lagarda, H. Ney, J. Tomas, E. Vidal, and J.-M. Vilar. 2008. Statistical approaches to computer-assisted translation. Computational Linguistics, 35(1): 3-28.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Human-computer interaction for semantic disambiguation",
"authors": [
{
"first": "R",
"middle": [
"D"
],
"last": "Brown",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Nirenburg",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of COLING",
"volume": "",
"issue": "",
"pages": "42--47",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. D. Brown and S. Nirenburg. 1990. Human-computer interaction for semantic disambiguation. In Proceedings of COLING, pages 42-47.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "TransType: text prediction for translators",
"authors": [
{
"first": "G",
"middle": [],
"last": "Foster",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Langlais",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Macklovitch",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Lapalme",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of ACL Demonstrations",
"volume": "",
"issue": "",
"pages": "93--94",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Foster, P. Langlais, E. Macklovitch, and G. Lapalme. 2002. TransType: text prediction for translators. In Proceedings of ACL Demonstrations, pages 93-94.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Search right and thou shalt find \u2026 using web queries for learner error detection",
"authors": [
{
"first": "M",
"middle": [],
"last": "Gamon",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Leacock",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the NAACL Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Gamon and C. Leacock. 2010. Search right and thou shalt find \u2026 using web queries for learner error detection. In Proceedings of the NAACL Workshop.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "GRASP: grammar-and syntaxbased pattern-finder in CALL",
"authors": [
{
"first": "C.-C",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "M.-H",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "S.-T",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "H.-C",
"middle": [],
"last": "Liou",
"suffix": ""
},
{
"first": "J",
"middle": [
"S"
],
"last": "Chang",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of ACL Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C.-C. Huang, M.-H. Chen, S.-T. Huang, H.-C. Liou, and J. S. Chang. 2011. GRASP: grammar-and syntax- based pattern-finder in CALL. In Proceedings of ACL Workshop.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Pattern Grammar: A Corpus-Driven Approach to the Lexical Grammar of English",
"authors": [
{
"first": "S",
"middle": [],
"last": "Hunston",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Francis",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Hunston and G. Francis. 2000. Pattern Grammar: A Corpus-Driven Approach to the Lexical Grammar of English. Amsterdam: John Benjamins.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Statistical phrase-based translation",
"authors": [
{
"first": "P",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "F",
"middle": [
"J"
],
"last": "Och",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Koehn, F. J. Och, and D. Marcu. 2003. Statistical phrase-based translation. In Proceedings of NAACL.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A web-based interactive computer aided translation tool",
"authors": [
{
"first": "P",
"middle": [],
"last": "Koehn",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Koehn. 2009. A web-based interactive computer aided translation tool. In Proceedings of ACL.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Bootstrapping word alignment via word packing",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Stroppa",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Way",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Ma, N. Stroppa, and A. Way. 2007. Bootstrapping word alignment via word packing. In Proceedings of ACL.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Adaptive language and translation models for interactive machine translation",
"authors": [
{
"first": "L",
"middle": [],
"last": "Nepveu",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Lapalme",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Langlais",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Foster",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. Nepveu, G. Lapalme, P. Langlais, and G. Foster. 2004. Adaptive language and translation models for interactive machine translation. In Proceedings of EMNLP.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "An interactive machine translation system with online learning",
"authors": [
{
"first": "D",
"middle": [],
"last": "Ortiz-Martinez",
"suffix": ""
},
{
"first": "L",
"middle": [
"A"
],
"last": "Leiva",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Alabau",
"suffix": ""
},
{
"first": "I",
"middle": [],
"last": "Garcia-Varea",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Casacuberta",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of ACL System Demonstrations",
"volume": "",
"issue": "",
"pages": "68--73",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Ortiz-Martinez, L. A. Leiva, V. Alabau, I. Garcia- Varea, and F. Casacuberta. 2011. An interactive machine translation system with online learning. In Proceedings of ACL System Demonstrations, pages 68-73.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Bleu: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "K",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "W.-J",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of ACL",
"volume": "",
"issue": "",
"pages": "311--318",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Papineni, S. Roukos, T. Ward, W.-J. Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of ACL, pages 311-318.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Labeling images with a computer game",
"authors": [
{
"first": "L",
"middle": [],
"last": "Von Ahn",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Dabbish",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of CHI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. von Ahn and L. Dabbish. 2004. Labeling images with a computer game. In Proceedings of CHI.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"text": "Automatically generating pattern grammar.",
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"uris": null,
"text": "Predicting pattern grammar and translations at run-time.",
"type_str": "figure"
},
"FIGREF2": {
"num": null,
"uris": null,
"text": "Example translations with TransAhead assistance.",
"type_str": "figure"
}
}
}
}