| { |
| "paper_id": "C94-1019", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T12:48:27.542882Z" |
| }, |
| "title": "Two Types ot' Adaptive MT Environments", |
| "authors": [ |
| { |
| "first": "Sergei", |
| "middle": [], |
| "last": "N1ri", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Carnegie Mellon University Carnegie Mellon University Pittsburgh", |
| "location": { |
| "region": "PA", |
| "country": "USA" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "", |
| "pdf_parse": { |
| "paper_id": "C94-1019", |
| "_pdf_hash": "", |
| "abstract": [], |
| "body_text": [ |
| { |
| "text": "Yorick WII,KS l)cpartmcnt of (;tlmputcr Science University o1' Shcftiehl tJ I( ABSTI~ACT A nurnher of propos'ds have come up hi reten! years for hybrhlizitlhm of MT. Currcnl MT inojects -both \"pure\" and hyhrhl, both prcdo,ninantly leclul,.llogy-orienlcd and scienlilic (including those currently funded hy NSF) ;ire single-engine projecls, CalJahle of one parlicular type of source text analysis, one particular rncthod of lh/ding target lan~;lia~,e corre.spondences for source language elcmenls and one prescribed metho(I cd gcncralhlg tile Iitrgel language text. While such pr(~jccls can be quite useful, we believe thnt il is lime tc~ make tile next step in lhe desiy, n cd machine Ii.{inshttion systems and to move lOw;id i~dii])live, mulliplc-crlgine syslems. We describe Ihc architecture of an adaptive multi-engine MT system which uses each of the engines under tile circumstances which are most favorable for ;Is success.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "I. Multi-Engine MT Architech.'e P, eccn! years have wilnessed a shifl in tile hahmcc uf scientific and technological efl'orls in the nrea {~t\" nmchinc translation. All tile latest mcthc~doh+gic;tl m/vcllics in this field ;u'c essentially technology-c.,ricnted and do not aim ill advltnch]g our knowledge itl'Joul either basic tnecha-IliSlllS of text coralschess;on and production Of COIll])tllel + models shnHhlling stich i11e.challiSlllS.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "Tile lwo lllOSl recently popular techncd o~,{ical parndit, ms ill machine translation---e\u00d7ample-I'~ased Iranslalion (EBMT) and stalisliCSdlased transhlthm (SIIM'f) ---require linguistic knowledge only :is an aflerlhollghl. While the represenlatives of the above paradigms are still al lhc stage, of e.ilher building toy systems (e.g., Furuse and litht, 1992; McLean, 1992 ,Jones, 1992 , Maruyama and Wltlan-,aim, 1992 or struggling with tile natural constraints olal> proaches that eschew the Sttldy ol\" langual.,e ;is such (e.g., Brown et at., 1990) , .it number of llropi`'sals have come up lor some hybridization oF M'I: [n some such .aplnO',tches, Corl)llS analysis is tised ('Ill\" ltlllhl]:{ analysis ;lid Ii.{uIsfcr grammars (e.t;., Su and ('hang, 1992) . Ill olhcrs, a standlu'd tr:msfcx-I'~L~ed aPl/rtmch (TBMT) is followed usiny, hadilh/nal analysis and generalhm technhlueS bul havin!,, a IranslEr component Imscd on aligned I,ilingual corp(ira ((lrishnmn and Kosnka, I\")92). Slillotherx, use slalislical illforlll;llh`'ll ;IS Ihc source of preference axsil~lllllC.Iil durin!; lexl dismnbig, ualion (e.g., tile OUlIHle. presenlcd ht l.chnmnn and ()ll, 1992). Slalislical modelinp can be used al some sb:l,ges of a knowled~;ed}ased MT (KBMT) system (see, e.g., t lehnreich, 1'-)94).", |
| "cite_spans": [ |
| { |
| "start": 335, |
| "end": 358, |
| "text": "Furuse and litht, 1992;", |
| "ref_id": null |
| }, |
| { |
| "start": 359, |
| "end": 371, |
| "text": "McLean, 1992", |
| "ref_id": null |
| }, |
| { |
| "start": 372, |
| "end": 384, |
| "text": ",Jones, 1992", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 385, |
| "end": 417, |
| "text": ", Maruyama and Wltlan-,aim, 1992", |
| "ref_id": null |
| }, |
| { |
| "start": 531, |
| "end": 550, |
| "text": "Brown et at., 1990)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 739, |
| "end": 759, |
| "text": "Su and ('hang, 1992)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "Current MT projt!cts -Iloth \"pure\" lind hybrid, bt~lh Fu+cdmnhmntly techncdtB, y-c~rienled ill/d scientific arc shl!,Jc-cn~,,inc projccls, Calmblc of one particular lype of SOUl'CC lest analysis, one particular Inelhod of finding largel Iiln~uage cc, rresl',Cmdenccs for source hmgua,ge elemeuts and one prescribed nlethod of generating Ihc large[ hmguaI.,e lest. While such projects can be quite useful, we t:,elieve Ihal il is Ihne to make Ihe next step in the de-SigIl of llliIC]l]lll2 ll'[lllxlilliOll systems iltld l(] illOVe loward adIq`'live, mulliple-enghm syslems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "Praclical MT syslems are lypically developed lor a parlicular Icxl type (e4,., wc;llhcr rcl)t)rls , linancial news articles, scientific nh, stracls) anti for a parlicular end use -e.l'., assinlilalion or dissemhlItficm o1 ]llfOl+lllillh)n. Sl/0cial cases, such as lranslalhlg till tlpdaled version of a previously llilllS [[llt.:(I [cx[, ilt Wc perceive lwo alqu'oaches to adaplivily in MT. P, olh llreSupl~OSe an MT environment ill which a nunlher tff MT engines are present --for irlstlmcc, one (t)r morel) each of KBMT, SI;MT, F.BMT and TBMT cn~ines can he used. hi one of tile approaches all availahle engines are \"unleashed\" on an input text and file liJml otntpul is assembled from the best rex! segmeras, i,'respective of which engine prodtmcd them. We. call this approach lhe Best Otttput Segment (B()S) approach, hi another approach a heuristic \"dispatcher\" decides which of the available engines holds tile highest p,-omise for it given input text and then assigns the job to that engine. This is tile DiSlmtcher-Based (DB) approach. The B()S approach involves more processing bill ~lllows an ,.7 posreriori selection of the best results. Tile DB approach saves cycles but relies on heuristic ,,., priori selection of the best oulput.", |
| "cite_spans": [ |
| { |
| "start": 322, |
| "end": 341, |
| "text": "[[llt.:(I [cx[, ilt", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "hi this latter case, lhe quality of the dispalchermodule is crucial, but additionally, the DP, approach expecls each c,f the component engines to be of rather Irish quality, since they would not (as is the case in lhe BOS apF, rOach) he \"bailed onl\" hy olher engines in case of failure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "hi what lk-dlows we hrielly describe our lirst experiment with tile B()S approach and discuss tile requirements for tile DB approach.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "I.as Cruces, NM, liSA", |
| "sec_num": null |
| }, |
| { |
| "text": "The Best Output Segment Apprtmch to Adaptlvity ()ur B()S Itpproach experiment was cmried out lor a Spanish -English Iranslation sel-u F, in the fran/ework of Ihe Pangloss MT project (F'angloss, 1994)and used Ihrce. MT engines --KBMT, EBMT, and TBMT.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "Tile KBMT engine we used was tile. mainline engine of tile Pangh./ss system, a lradilional KBMT environment described in some detail in (Pangloss, 1994) . It was important for tile BOS experiment that this engine genernlcd an internal quality rating for each OUtlmt segment it produced.", |
| "cite_spans": [ |
| { |
| "start": 136, |
| "end": 152, |
| "text": "(Pangloss, 1994)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "The tmsic idea of EBMT ix simple (cf. Nagao, 19g4): an input passage S is comlmred with the sourcc-I:mguage \"side\" of a bilingual lexl archive, where lexl passages are slored witll their Iransllitions ill|() It flu'gel langtmge (or a set of such). TIle \"closesl\" matcll, passage S' is selecled and lhe lranslation of lhis clos'ast malch, the passage 7\" is accepled as tile IranslaliOn of S. Our EBMT engine iiscd a 100MB bilingual Spmfish -English archive of UN cdticial documents, hi preparation fc, r processir~g, die archive was idigned at tile sentence level. Tile lnalching of input passages with the Spanish side of the archive was allowed to be inexact. Penalties were assessed for omitted and ex-Ira words, word occurrences ill different rnorphological forms and differences in word order. The English siring lranslaling lhe best Spanish archive candidale wlts then lound in tile English sentence aligned with tile Spanish sentence in which lhe hest match candidme appea,',ad. A .Spanish -English MRD win; used in determining Iranshtlions of individual words inside the candidale segmenis. A special ronlinc then calculated lhe expected quality o1 the resulting Iranslatiorl, which helped .;it lhe restlll inlegralion stage of nnllti-engine MT syslenl operaliOn. ()ur EBMT approach ix described in Nirenln.~g el al., 1993 and Nirenburg ,at al., s.bmiHed) .", |
| "cite_spans": [ |
| { |
| "start": 1306, |
| "end": 1362, |
| "text": "Nirenln.~g el al., 1993 and Nirenburg ,at al., s.bmiHed)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "Our transfer systenl was very simple. It was Ilascd on direct Icxical substitution fo English words and phrases for Spanish words and phrase, forlilied wilh n/orphological analysis at/d synlhesis modifies. Tile process relied on ii tltllllber of dalabases -it Slmnish -English MRD, lhe lexicons used by ll/e KBMT engine, a large sel of user-generated bilingual glossaries as well as a gltzetleer and It list of proper and orglll/izaliOll names. The usergerler.:llcd glossaries for our experiment corllained aboul 174,000 entries. In tile rule above dop stands for\"dhecl object pronoun\" and poss for \"possessive.\" \"l, fl-,les of feIflure correspondences were prepared to make the translation possible. Note that in many CltSCS Spanish features and English fealurcs were quile differenl (rlot;ih, ly, for verbs). The rltn,nbers in \"mgtthlr brackets are indices which show the mo,pht+logical synthesizer which word Io put in a particular form at generation time. In lifts expe,iment we used variables for the lollowing word classes: proper IlllllICS, such as imlividual, ct'mlplllly and ill:tee Illlllies; litltllllcrs itl/d the vltriotls classes of prollotlns --persorml, possessive, rellcxive, direcl ohjccl, indirecl olljecl and possessive al~st)hile.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "The crux of tile B()S melhod is combining, results from indivhlual engines. A clmrl data strllCltlrc wil~ Itge(] tO COlllbinc resells l]t)lii Ihc individual engines. Bclbre the lranshffion process, the edges of lhe chart were made to correspond to indivkhml words in the input. New edges are added It) the ch:lrl tilrougtl tile operation of the throe MT erlgines labeled wilh tim Iransration of a scgmenI of tile inpul siring and indexed hy this segment's heginning and end positions. The KBM'I[ and EBMT engines also carried a quality score for each ioulpul elemenl.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Combining Results", |
| "sec_num": "2.1." |
| }, |
| { |
| "text": "After all lima engines finished their work il is lleC(b;-sary lo lind the sequence of transhltion candidates vehich ~0 cover the input string as densely as possible (so Ihat there is a Iraiislalion for ak I]laI/y source lexl elements as possil',le); b) use the \"hesl\" of lhe available canditlales. q~'~ lind the best candidates three heuristics were used a) intern'd quatily ratings produced by the KP, MT and EBMT engines; h) stalic relative qu;dity assessmcnl of the protitular engines wc used and c) the length of lhe translation segment (the longer, Ihe hetter). Enhancing lhe quality of lhese hemistics antl generally tinding more Sol)hislicated ways of combining timlings of individual engines is the most important direction of improvenlenl of ollr BOS system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Combining Results", |
| "sec_num": "2.1." |
| }, |
| { |
| "text": "The chart walk algorithm l)roducing the final result of lhe B()S system used lhe above heuristics. The algorilhm uses dynamic programming to lind the Ol~linmI cover (a cover with the best cnmtllative score), aSS]lining correct component qualily scores. 11 ix dcscrihed in some detail and illustralcd in Nirenhurg and l:rcdcrking, 1994 and Frederking an(I Nirenburg, sttl,tfftted.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Combining Results", |
| "sec_num": "2.1." |
| }, |
| { |
| "text": "The l)isl)atcher-Based AI)l)roach to", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "3.", |
| "sec_num": null |
| }, |
| { |
| "text": "In this apfuoach, ,'t dispalcher nlodule ix used to break up the input text into segments and assign each segmcnl Io one or another o1' tile avaihtble MT engines. Among Ihc possible diagnoslics l~'~r the dispatcher are:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "* q~ype of translation --whether the rcstilt of lranshtlion is intended for disscmin:ttion or for assimihttitm; whether a complete lranslaticm is nccdetl or an abst,act or even a simple categorizalitm of a Iext (e.g., as a text Ihat is iml~ort;mt CllOIIgh Io be Iranshdcd in its entirety).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": ". Availability of parallel lext iu a parlicuhu domain 'm(I on a Imrticular topic. This ix lhe crucial cnal'fling condition 15r EBMT and SP, MT.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "t, Amoltnl of ambiguity in Ihc source passage, hoth in tile source language itself and vis-a-vis a I;irget language. The smaller the tlegrce of anlhilmily, Ihe more attractive the KBMT approach.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": ".t. Size and quality of available KBMT resolnces (ontology, lexicons, etc.).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "The work on the dislmtcher, thus, includes a) evalualing tile translation contcxL with rcspccl to tile fore\" crilcria above and 1\"0 pulling Iogelher a decision mechanism which will establish the relative ,:q:,propriatcncss of each of tile available engines lbr treating all input passage in a given context. All additionaI important parameter in Ihe operation of tile dispatcher is determirung the most approl)riate size of input passage to be dispatched It) an MT engine. Since tin entire input text c~.tn t'~C processed hy a combination of MT engines, it is necessary to maximize tilt: cxpcclcd quality of Otllllllt OVCf ;I vark.'Ay of possil'~le ways of\"chunking\" tile input Icxl for processing. This has some similarity with the chart walk in file B()S alqm)ach.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "The disimtchcr will unsc an additional set of diagnostics dctcrlllillcd by file slntlClllre of Ihe spccitic MT engine.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "Tim dcvelt)l'llllel/I ()[lhe:.;c dispatcher heuristics -ill (,lhcr words, how the dispalchcr is to be h-ained (see below) .... is a key l)Oinl of tile [l[of~ose(I research. A prelinunary analysis elthese spccilic tliagnoslic heuristics, orderc(I by Ihc parlicuhu\" cngil]c, follows.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "An additional tliagnoslic heuristic lot SBMT inspects Ihc frcqucrlcy olc, ccurfencc of each iil(livi,.Itt;ll input slrillg ileal] in the corl)tts. The greater the frequency of the items c()ntaincd ill the lcxt, tile glCaler the likelihood lhal tile SRMT engine will produce [,,ood tlualily OUtlml.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "The ahovc heuristic will also serve tile EI',MT engine. A heuristic uscfut spccilically for EBMT is the ~llllOtll]t of overlap (if ;ill ill]Hit IeXt with a (lOclll/]et]l ahcady in llle source lan,t,,lmgc si(Ic of the bilingual archive.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "The diagnostics lot tile \"['BMT and KBMT al)inoaches moslIy check Ihc coverages of approprialc slalic knowlet[~c SOUlCCS --~fltllllll;.trs ,:llltl lexicons.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "Tim diagnostics proposed above vary in cosl, both in tt.'l'lllg c,f developing the procedures and in tel'ill,'-; Of Ihcir colnplll;ltional conlplcxity. Rehllively inexpensive are tliat,xlt)stics h;Isctl oil recognizing il]dividual terms or paltoms in the inptlt (e.g., chccki,'lg tile availahilily of ilcms ill a lexicon t]r it corplls, chcckhlg tile lenglh of segtllCllt:.,, checking for local sct]llellcing p'alterns of forms). Soil|ewhat Illore cxpcnsivcarc diagnostics based on a.',:signnlenl of catc,t,,orics to forlns. [1 is screndipilous, howevcq thai tile more cosily tli'lgnosfics are generally related to milial stages of pnocenxin t, nccessgry ill tilt)st cnghles. This opc'.ns a pt~lcnlial I(u inlerleaving Ihe processing by individual engines with lhc operation of tile disp;llchcr.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Adaptivity", |
| "sec_num": null |
| }, |
| { |
| "text": "Fulure Work \"I'he questions of how Io optimize the colnlfinalion el'evidence in Ihe P,( )S al~pro;lch and how 1o trail1 Ihe, disp:tlcher ill the DB apl:uoach ale very close 1o ~[l key (llleSlion in mc~(lern MT: how an M'F system is to be evahl[llc(I (even :ix a small-scale proof of concept). We. plan an experh/lental smtly to ilnprove, the procedure for the combinalion of evidence from the individual engines in tile B()S approach, which will include a cOIlll)llriSOll of the rcstllts of our system with htlm;tn j]IdgmelltS and sill',sequent inodilication of the sy.,;Icnl ba.'-;ctl on this feedback. Wc also intend to cxpcrilncnt with ;I training schcdtllC h,y which the disl!atchcf COllld be trained over 1ox{ samples, hy Irying potentially r;tlldOll/ltg.'.;iglIlllCnts of texl parts to II]OdtlICS [|l]l.I then seeing which assignment regimes produce the host results. A v:uiant on this would I',c hul]lttn text \"tttgt[if~g\" by intuitions about tile texl type (where the human lagged it hy tile module type that he considered would be needed; this would be essentially a difficulty rating the text a priori). and again a,;sessing this against system results. As the size of such an experiment carl be quite signilicant, we envisage the use of some form of qtmsi-automalie quality scoring for MT of the sort proposed recently by Henry Thompson and his colleagues (e.g., Brew and Thompson, 1994) .", |
| "cite_spans": [ |
| { |
| "start": 1374, |
| "end": 1398, |
| "text": "Brew and Thompson, 1994)", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "4.", |
| "sec_num": null |
| }, |
| { |
| "text": "slalislics-orienled machine translation. Prbceedings of TM1-92. Montreal. 249-62. Wilks, Y., Fass, D., Gt,o, C-M., McDonald, J., Plate, T., & Slalor, B. 1990 . Providing Machine Tractable l)ietionary Tools. Machine 7)'anslalion, 5:2, 99-15 I.", |
| "cite_spans": [ |
| { |
| "start": 64, |
| "end": 157, |
| "text": "Montreal. 249-62. Wilks, Y., Fass, D., Gt,o, C-M., McDonald, J., Plate, T., & Slalor, B. 1990", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "4.", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Tr:mshttional Ambiguity Rephrased", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [ |
| "M" |
| ], |
| "last": "Ben Ari", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Rimes", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Berry", |
| "suffix": "" |
| } |
| ], |
| "year": 1988, |
| "venue": "Proceedings of the Second International Conference on Theoretical mid Inethotlological Issues in Machine T,'anslalion. Pittsburgh", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ben Ari, D. M. Rimes and D. Berry. 1988. Tr:mshttional Ambiguity Rephrased. Proceedings of the Second Inter- national Conference on Theoretical mid Inethotlological Issues in Machine T,'anslalion. Pittsburgh, June 1988.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Automatic Evaluation of Computer Generated Text: A Progress Reporl on the TextEval Project. F',oeeedings of HLrqX)4", |
| "authors": [ |
| { |
| "first": "C", |
| "middle": [], |
| "last": "Brew", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Thompson", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Brew, C. and 11. Thompson. 1994. Automatic Evalua- tion of Computer Generated Text: A Progress Reporl on the TextEval Project. F',oeeedings of HLrqX)4, Princeton, Mm-ch.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "A statistical approach to language translation", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Brown", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Cocke", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Della Pietra", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Della Pietra", |
| "suffix": "" |
| }, |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Jelinek", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [ |
| "L" |
| ], |
| "last": "Mercer", |
| "suffix": "" |
| }, |
| { |
| "first": "P", |
| "middle": [ |
| "S" |
| ], |
| "last": "Mid Roossin", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Comlmtatiomd Linguistics", |
| "volume": "16", |
| "issue": "", |
| "pages": "79--85", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Brown, P., Cocke, J., Della Pietra, S., Della Pietra, V., Jelinek, K, Mercer, R.L. mid Roossin P.S. 1990. A sta- tistical approach to language translation, Comlmtatiomd Linguistics. vol 16, 79-85.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "An Example-Based Method for Transfer-Driven Machine Translation", |
| "authors": [ |
| { |
| "first": "O", |
| "middle": [], |
| "last": "Fnrnse", |
| "suffix": "" |
| }, |
| { |
| "first": "H", |
| "middle": [ |
| "Ikla" |
| ], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "Proceedings of TMI-92. Montreal", |
| "volume": "", |
| "issue": "", |
| "pages": "139--50", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fnrnse, O and H. ikla. 1992. An Example-Based Method for Transfer-Driven Machine Translation. Proceedings of TMI-92. Montreal. 139-50.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Comhining ralionalist and empiricist approaches Io mqchine translalion", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Grishman", |
| "suffix": "" |
| }, |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Kosaka", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "Proceedings ofTMI-92. Montre,'tl", |
| "volume": "", |
| "issue": "", |
| "pages": "263--74", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Grishman, R. and M. Kosaka. 1992. Comhining ralio- nalist and empiricist approaches Io mqchine translalion. Proceedings ofTMI-92. Montre,'tl. 263-74", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "TAUM-AVIATI()N: Its Technical Features and Some Experimental Results. Computational Linguistics", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Lsabelle", |
| "suffix": "" |
| }, |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Bourbeau", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "", |
| "volume": "11", |
| "issue": "", |
| "pages": "1--27", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "lsabelle, P. anti L. Bourbeau. 1985. TAUM-AVIATI()N: Its Technical Features and Some Experimental Results. Computational Linguistics, 11 : 1 g-27.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Non-hybrkl example-based machine translation architectures", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Jones", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "Proceedings of TMI-92. Mon-Ireal", |
| "volume": "", |
| "issue": "", |
| "pages": "163--71", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jones, D. 1992. Non-hybrkl example-based machine translation architectures. Proceedings of TMI-92. Mon- Ireal. 163-71.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "It. 1992. Translation relations and the combination of analytical and statistical unetho,Is in Itlachhle trarlslation", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Lehmann", |
| "suffix": "" |
| }, |
| { |
| "first": "N", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Proceedings of TMI-92. Monlrcal", |
| "volume": "", |
| "issue": "", |
| "pages": "237--285", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Lehmann, H. and N. ()It. 1992. Translation relations and the combination of analytical and statistical unetho,,Is in Itlachhle trarlslation. Proceedings of TMI-92. Monlrcal. 237-48.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Tree cover search algorithm for example-based translation", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Maruymna", |
| "suffix": "" |
| }, |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Waianabe", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "Proceedings of TMI-92. Monlreal", |
| "volume": "", |
| "issue": "", |
| "pages": "173--84", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Maruymna, H. and H. Waianabe. 1992. Tree cover search algorithm for example-based translation. Proceedings of TMI-92. Monlreal. 173-84.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Example-based machine translation using connectionisl matching", |
| "authors": [ |
| { |
| "first": "I", |
| "middle": [], |
| "last": "Mcleml", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "Proceedings of TMI-92", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "McLemL I. 1992. Example-based machine translation using connectionisl matching. Proceedings of TMI-92.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "M~lchine Translation: A Knowledge-Based Approach", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Nirenburg", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Carbonell", |
| "suffix": "" |
| }, |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Tomita", |
| "suffix": "" |
| }, |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Goodman", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nirenburg, S., J. Carbonell, M. Tomita and K. Goodman. 1992. M~lchine Translation: A Knowledge-Based Ap- proach. San Mateo, CA: Morgan Kaufmann.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "TABREF0": { |
| "num": null, |
| "html": null, |
| "content": "<table><tr><td>)Olll/(] ill Ihc rcid-worl,,I ])faClilTc..</td></tr><tr><td>Gains in t:,Ull'~Ut quality and eflicicncy can I;e expected if;</td></tr><tr><td>IllllthilIc hanslalhm ellvhonlllelll Call he made. I[:, iRlil[)l It)</td></tr><tr><td>a task prolilc. Thus, [t'u cxmnple, fc, r lransl;lling nbslrltclS</td></tr><tr><td>of scientific arlicles ill order to sclccl jusl</td></tr></table>", |
| "text": ", it statistics-based apprc, ach might he mosl apprc, priate. Extlmple-based transhtlion seems It, be most l/ronlisinE lor It+ansi;thiS new versions of previously translated (hlcIIillelllS. This correspondence hctwecn lechnique, input texl type and end use (or Olllptlt lext lype) provides ItlHher nlotivatioll", |
| "type_str": "table" |
| }, |
| "TABREF1": { |
| "num": null, |
| "html": null, |
| "content": "<table><tr><td/><td/><td/><td>Fof illS[ante,</td></tr><tr><td colspan=\"2\">lhe following glossary enlry</td><td/></tr><tr><td>absolver<l></td><td colspan=\"3\">~t <dop:2> de</td></tr><tr><td/><td colspan=\"3\">--po::s:2> promesa</td></tr><tr><td>:=></td><td/><td/></tr><tr><td>release<l></td><td><dop:2></td><td colspan=\"2\">from</td></tr><tr><td/><td colspan=\"3\"><po:;s : 2-prolfli~31 ~</td></tr><tr><td colspan=\"4\">can help to generate such English sentences as</td></tr><tr><td colspan=\"4\">I r~9].ease yo~l froln your promise;</td></tr><tr><td colspan=\"4\">He released me from my promise;</td></tr><tr><td colspan=\"3\">You will be releasing</td><td>her from</td></tr><tr><td colspan=\"2\">her promisa ;</td><td/></tr><tr><td>i~ t c .</td><td/><td/></tr></table>", |
| "text": "Glossary enlires conlained variahles to allow feature matching and indices U.i link the parts of phrasal elllries Ilia[ translated Olle anolller.", |
| "type_str": "table" |
| } |
| } |
| } |
| } |
