| { |
| "paper_id": "C86-1025", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T13:14:51.906310Z" |
| }, |
| "title": "TRANSFER AND MT MODULARITY", |
| "authors": [ |
| { |
| "first": "Pierre", |
| "middle": [], |
| "last": "Isabeile", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Canadian Workplace Automation Research Centre", |
| "location": { |
| "addrLine": "1575 Chomedey Boulevard Laval", |
| "postCode": "H7V 2X2", |
| "region": "Quebec Canada" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "~j", |
| "middle": [ |
| "L" |
| ], |
| "last": "Iott Macklovltch", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Canadian Workplace Automation Research Centre", |
| "location": { |
| "addrLine": "1575 Chomedey Boulevard Laval", |
| "postCode": "H7V 2X2", |
| "region": "Quebec Canada" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "", |
| "pdf_parse": { |
| "paper_id": "C86-1025", |
| "_pdf_hash": "", |
| "abstract": [], |
| "body_text": [ |
| { |
| "text": "The t cansfer components of typical second generation (G2) MT systems do not fully conform to the principles o~ G2 modularity, incorporating extensive target language information while failing to separate translation facts from linguistic theory. The exclusion from transfer of all non-contrastive information [eads us to a system design in which the three major components operate in parallel, rather than in seqnence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "We also propose that MT systems be designed to allow translators to express their knowledge in natural metalanguage statements.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Modularity is a defining characteristic of second genera ti.on machine translation systems (hereafter C2 MT).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "G2 systems are claimed to be based on a mode] in which linguistic descriptions are clearly separated from the algorithms and programs that actually produce translations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "Moreover, in this mode]., the linguistic facts that pertain solely to the source language (SL) are supposed to be clearly separated from the facts that pertain solely to the target language (TL), and from those facts that concern the lexlcai and structural contrasts between TL and S],. Such, at Least, are the principles of G2 design, as set fortb for example in Vauquois [i ] .", |
| "cite_spans": [ |
| { |
| "start": 364, |
| "end": 377, |
| "text": "Vauquois [i ]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "This conception of MT gives rise to systems composed of three distinct and successive phases : a monolingual analysis component, which produces a SL-dependent structural description (SD) of the input text; a transfer component, which maps that SD onto a TL-dependent SD; and a monolingual synthesis component, which transforms that SD into a TL output text.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "As pointed out by Kay [2] , this classical G2 design offers a number of advantages.", |
| "cite_spans": [ |
| { |
| "start": 18, |
| "end": 25, |
| "text": "Kay [2]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "Ideally, it should allow the formal[ description of a given language to serve the needs of analysis and synthesis indifferently.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "As well, it should allow a given analysis or synthesis component to be coupled onto other MT systems of simi.lar design to produce translations for other language pairs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "And finally, because the algorithms are independent of the particular linguistic descriptions, they too should be reusable in other MT applications.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I. Modularity: a Basic Principle of G2 S~stems", |
| "sec_num": null |
| }, |
| { |
| "text": "Transl!er in G2 systems like TAUM-AVIATION [3] , ARIANE-78 [4] ", |
| "cite_spans": [ |
| { |
| "start": 43, |
| "end": 46, |
| "text": "[3]", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 59, |
| "end": 62, |
| "text": "[4]", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "/v:\\ ,' V S l I know savoir V NP V NP 1 I know conna2tre", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Such transfer rules are usually deterministic: each input tree (or subtree) is mapped onto one and only one output tree.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Consequently, corresponding to each SL SD produced by the analysis component, the synthesis component will receive one and only one TL SD.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "In order for a correct TL sentence to be produced, this unique structure has to be correct in all respects. This conception makes it necessary for the transfer component to encode a lot of knowledge about TL grammar.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "]for example, if the input tree required by synthesis is an Aspects-type deep structure, transfer will need to include the equivalent of the complete base component of the TL grammar, including ].exicaL insertion mechanisms.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "A close examination of the transfer components of the three systems mentioned above shows that this is indeed the ease.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Rules such as (la-b) clearly state facts that belong to a description of TL: namely, strict subcategorizatLon conditions on the insertion of savoir and connaltre.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "A sizable portion of the so-called transfer rules in these systems actually deals with TL strict subcategori zation requirements.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "In addition to incorporating TL linguistic descriptions within transfer, these systems also make use of impoverished TL grammars for synthesis. For example, none of the systems mentioned accesses a full-fledged TL dictionary during synthesis.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "It has long been a truism in MT circles that synthesis is much easier that analysis. This is hardly surprising, when so nmch of tile work of synthesis has been passed over to transfer.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "This move has at least two unfortunate consequences:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "(a) the burden placed on the translator/lexicographer is greatly increased; and (b) the translation relation is implemented in a highly directional fashion.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Analysis and synthesis become totally different tasks, each standing in a different relationship to transfer.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "In order to remedy these defects, we favour a more rigourous adherence to the principles of G2 modularity:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "all information which is not strictly contrastive should be removed from the transfer component and returned to synthesis, where it belongs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "This would allow G2 systems to fully benefit from the advantages of modularity that Kay has noted.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "It would also ease the burden on those who must write the transfer rules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "On the other hand, such a move would make the transfer phase non-deterministic, and this may lead to severe efficiency problems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "If, as in typical G2 systems, transfer and synthesis are applied in sequence, communication between the two components will be effected through tree structures representing complete translation units. The use of non-deterministic rules at transfer would mean that local translation ambiguities would then generalize to these complete units.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "For exalaple, if tranfer no longer selects between savoir and connagtre for the translation of know, or between cheveux and ~ for the translation of hair, then at least four different French SDs will be transmitted to the synthesis component for any SL SD containing both know and hair.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "One possible solution to this problem is to have analysis, transfer and synthesis operate in parallel rather than in sequence, while providing the three components with the means to exchange partially specified tree structures at each stage of the processing.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "This is probably what Arnold et al [6] have in mind when they suggest that transfer should be viewed as a relation between two generating devices.", |
| "cite_spans": [ |
| { |
| "start": 35, |
| "end": 38, |
| "text": "[6]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "We have recently begun developing a system that seeks to implement such an approach.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "We have chosen PROLOG II (Universit~ d'Aix-Marseille) as the implementation language, in order to take advantage of the handling of partial information in a timeindependent manner that is offered by unificationbased formalisms (cf Kay [2] ).", |
| "cite_spans": [ |
| { |
| "start": 235, |
| "end": 238, |
| "text": "[2]", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "PROLOG II also has built-in facilities for parallel processing.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Though our system is still in the embryonic stage, it can already translate in both directions between English and French, or simply enumerate pairs of sentences that are translationally equivalent.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "il. Transfer in T_yj~ical G2 Systems", |
| "sec_num": null |
| }, |
| { |
| "text": "Assuming that the scheme outlined in the preceding paragraphs takes us somewhat closer to the ideals of G2 modularity, we can now ask what content is left for transfer rules to express.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "III. Transfer Rules as Metalanguage Statements", |
| "sec_num": null |
| }, |
| { |
| "text": "Since a good measure of compositionality is a prerequisite for transfer to be possible at all~ the tranfer relation (trf) has to be recurslvely defined in terms of relations between progressively smaller subparts of the SDs representing complete translation units, up to the level of basic LUs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "III. Transfer Rules as Metalanguage Statements", |
| "sec_num": null |
| }, |
| { |
| "text": "Depending on the degree of compositionallty involved, three classes of rules can be distinguished.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "III. Transfer Rules as Metalanguage Statements", |
| "sec_num": null |
| }, |
| { |
| "text": "First, there will be rules of purely compositional translation, ie rules which define the translation of some type of unit as a function of the translation of its parts.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "Rule 2, for example, states that the translation of an NP is a function of the translation of its components.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "(2) trf(np(Det, Adj, N), np(Det', N', Adj'))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": ":-trf(Det, Det') trf(Adj, Adj') trf(N, N').", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "Second, there will be rules dealing with purely non-compositional cases, such as those of (3):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "(3) a) trf(n(chair), n(chaise))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "b) trf(v(know), v(savoir)) trf(v(know), v", |
| "eq_num": "(" |
| } |
| ], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "connaltre)) c) trf(nom(n(pressure), n(gauge)), nom(n(manom~tre))).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "Example (3a) states a simple correspondence between basic LUs. (3b) illustrates a case where transfer leaves a choice for synthesis, as discussed above. Example (3c) is meant to illustrate the possibility of purely non-compositional translation involving an SL phrase.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "From the translator's point of view, pressure gauge is a unit; SL-internally, however, we see no reason to consider it an idiom (cf the possibility of conjunction, as in pressure and temperatnre ~).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "We need a third type of rule to handle partly compositional translation, \" ie cases in which the translation of some but not all of the sub-phrases are required for the translation of the whole expression.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "To express the restructuring that takes place when miss is translated as manquer ~, for example, we would need a rule like (4):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "(4) trf(s(Subj, vp(v(miss), Obj)), s(Subj', vp(v(manquer), pp(p(~), Obj'))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": ":-trf(Subj, Obj'), trf(Obj, Subj').", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "Notice that in the transfer rules given in (2)-(4), just as in those of G2 systems in general, translation facts are cast in terms of the specific linguistic theories embodied in the analysis and synthesis modules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "This has a number of serious disadvantages:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "(a) in order to be able to directly contribute to the development of the transfer component, the translator/lexicographer must assimilate all the details of the specific linguistic theories on which analysis and synthesis are based; (b) descriptions of translation facts have no independent status with respect to the analysis and synthesis modules:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "changes to the linguistic descriptions of SL and TL will likely force changes to the transfer rules, creating potential consistency problems; and (c) translation rules are unlikely to be portable to other systems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "116", |
| "sec_num": null |
| }, |
| { |
| "text": "bilingual dictionaries state translation facts in an altogether different manner. The information they contain is expressed in what essentially amounts to metalanguage statements, like the following: (5) a) \"chair\" translates as \"chaise\" in French b) \"pressure gauge\" translates as \"manom~tre\" c) \"sb misses sth\" translates as \"qqch manque qqn\"", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "Translators obviously manage to express a good deal of translation knowledge in terms of such statements. One way to ease the burden of the translator involved in MT would be to build into the system a capability to automatically interpret statements like those of (5) in terms of rules like those of (3)-(4). In fact, G2 MT systems already possess much of the knowledge required to build SDs out of the quoted expressions in (5) .", |
| "cite_spans": [ |
| { |
| "start": 426, |
| "end": 429, |
| "text": "(5)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "For (5a), little more than SL and TL dictionary lookups are needed to produce (3a). To handle cases such as (5b) the system wouid only have to access its regular grammar rules. Obviously, other cases will arise where such a simple scheme would lead to the generation of spurious rules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "For example~ if not supplemented by additional constraints, an equivalence might be created between the English adjective ~ and the French noun lumi~re. However, it does not seem difficult to imagine motivated principles that would automatically take care of such incorrect equivalences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "Cases of partly compositional translation raise more interesting problems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "In order to produce (4) from (5e), relations must be established between the sub-parts of the two quoted expressions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "Sb, stl!, ~ and j~l are clearly meant to be interpreted as meta-variables.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "Sl!) must be linked to ihg~ , so that if the first takes some expression as its value, then the second takes tile translation of that expression as its value.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "The clue to this link, of course, is the fact that ~ is itself the translation of sb.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "We are currently working on a scheme that will interpret translation rules expressed as simply as those in (5) , and allow them to be fed into the transfer component of the MT system mentioned at the end of section II.", |
| "cite_spans": [ |
| { |
| "start": 107, |
| "end": 110, |
| "text": "(5)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| }, |
| { |
| "text": "Though many difficulties remain to be resolved, the research program we have described does have the merit of addressing the shortcomings that result from the insufficient modularity of G2 systems. At the very least, we hope to stimulate theoretical reflection upon the translation component of MT systems, which has not until recently received the attention it deserves.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Natural", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "La traduction automatic~__~", |
| "authors": [ |
| { |
| "first": "B", |
| "middle": [], |
| "last": "Vauquois", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Vauquois, B., La traduction automatic~__~", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Documents de linguist:Lque quantitative 29", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Grenoble", |
| "suffix": "" |
| } |
| ], |
| "year": 1975, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Grenoble, Documents de linguist:Lque quantitative 29, Paris, Dunod, 1975.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Functional Unification Grammar: a Formalism for Machine Translation", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Kay", |
| "suffix": "" |
| } |
| ], |
| "year": 1984, |
| "venue": "Proceedi~ of COLING-84", |
| "volume": "", |
| "issue": "", |
| "pages": "75--78", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kay M., Functional Unification Grammar: a Forma- lism for Machine Translation, Proceedi~ of COLING-84, 75-78, 1984.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "TAUM-AVIATION: Its Technical Features and some Experimental Results, Computational Linguistics , ii:i", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Isabelle", |
| "suffix": "" |
| }, |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Bourbeau", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "18--27", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Isabelle P., Bourbeau L., TAUM-AVIATION: Its Technical Features and some Experimental Results, Computational Linguistics , ii:i, 18-27, 1985.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Automated Translation at Grenoble University, Computational[ Linguistics, ii:I", |
| "authors": [ |
| { |
| "first": "B", |
| "middle": [], |
| "last": "Vauquois", |
| "suffix": "" |
| }, |
| { |
| "first": "C", |
| "middle": [], |
| "last": "Boitet", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "28--36", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Vauquois B., Boitet C., Automated Translation at Grenoble University, Computational[ Linguistics, ii:I, 28-36, 1985.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "The LRC Machine Translation System", |
| "authors": [ |
| { |
| "first": "W", |
| "middle": [], |
| "last": "Bennett", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Sloeum", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "Computational Linguistics", |
| "volume": "1", |
| "issue": "2-3", |
| "pages": "111--121", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bennett W., Sloeum J., The LRC Machine Transla- tion System, Computational Linguistics , 1]:2-3, 111-121, 1985.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "A MU 1 View of the ~C,A>, T Framework in EUROTRA", |
| "authors": [], |
| "year": 1985, |
| "venue": "Proceedings of the Conference on Theoretical Issues in Mac|line Translation of Natural Lansuages", |
| "volume": "", |
| "issue": "", |
| "pages": "1--14", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "A MU 1 View of the ~C,A>, T Framework in EUROTRA, Proceedings of the Con- ference on Theoretical Issues in Mac|line Transla- tion of Natural Lansuages, Colgate University, 1-14, 1985.", |
| "links": null |
| } |
| }, |
| "ref_entries": {} |
| } |
| } |
