<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="1"/><title>DESIGN ISSUE OF ECTST</title><author surname="Jianshuo" givenname="Huang"><org  name="South China University of Technology" country="China" city="Guangzhou"/></author></firstpageheader><frontmatter><p><b>DESIGN ISSUE </b>OF BOTST Huang Jianshuo</p><p>Language Training Center South China University of <b>Technology </b>Guajogzhou 510641, P.R.C.</p></frontmatter><abstract>This note presents an overview of the English-Chinese Translation System for Tourists (ECTST) currently under de­velopment at South China University of Technology. A brief description of the bilingual dictionary is given, followed by descriptions of grammar rules representation and the main processes involved in translation» SYSTEM CONFIGURATION <b>generation phase, applying the con­tents obtained from the previous pro­cess, generates the TL sentence.</b> <b>ECTST is implemented in </b>PASCAL. <b>The </b>software <b>is separated from the lin­guistic data, so that any language can </b>be <b>accepted if the grammar rules and vocabulary are given. Likewise, the system program are free to change their components with no undue res­trictions that may be imposed by the linguistic components.</b> ECTST consists of a translation pro­gram, a bilingual dictionary and a rule-data base. The program body is composed of a sequence of modules, performing translation in four phases: SL sentence ,_i_ </abstract></header><body><section title="Initiation"><p>Bilingual dictionary</p></section><section title="Transfer L_"><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">ZIEZ</doubt></section><section title="feneration"><p>JUJ.e--da.ta<b> base</b></p></section><section title="TL sentence"><p><b>The initiation phase is concerned with input of the SL sentence, dictionary </b>look<b>-up and morphological processing. The analysis phase involves syntactic </b>and <b>semantic parsing, which are accom­plished through linguistic models and case frame. The transfer phase com­prises rules for converting the parsed SL sentence into the TL sentence. The</b></p></section><section title="DICTION ft WV CONTENTS"><p><b>The dictionary is bilingual: it con­tains morphological, syntactic and se­mantic information needed for the analysis and generation of a sentence. This includes information about the category of words, their semantic fea­tures and oase frames. Entries in the lexicon are of eight types, and their semantic features are based on graded concepts. The case frame provides a means to find out the logical rela­tionship between components in, the sentence.</b></p><p>At <b>present, the dictionary contains a limited set of lexical entries, which are grouped into models with the ini­tial letter as the index for access.</b></p></section><section title="GRAMMAR RULES"><p><b>In ECTST, rules are represented in the form of meta-model. It may contain one or more data items as shown belows</b> where A,B,0 represent information on category of the word, while x,y,z and atb,c are parameters indicating multi­ple pieces of information and tree structure separately.<page local="2" global="2"/> In many oases, semantic features or information on grammatical gender, number or case can be used as parameters.</p><doubt alpha="48.0" length="25" tooSmall="False" monospace="0.0">A fx] (a) Bfy3(b) C1Xl(o)</doubt><p>Generally, hundreds or even thousands <b>of grammar </b>rules are necessary <b>for </b>language analysis and transformation. <b>It </b>is impractical <b>to </b>check whether all these rules can be applied to ail in­termediate processings. To make the processing ef<b>f</b>ioient,rules are grouped into packets, each dealing with speci­fic corresponding linguistic phenomena ranging from a phrase, a clause to a ;:..entenoe„</p><p>The work of analysis is performed by the parse module- It constitutes a unified syntactic anc semantic analy­sis of the input sentence, and its output rervp-v a;- an input tes transfer. Tpe <i>y</i>ar<i>v\v.</i>■'' -'ro^r.^<footnote anchor="1"/>. jntorrrot <b>h </b>tb.o <b>l;.t— -••p </b>i'enb<b>^ricf- </b>scccr*'ii;:~ to -the availa­ble 1 ir:ir-tic models. The^e come in Federal variable», f-uoh as neta-:r<b>;0</b>(k'lf",  csfe fra'-'ss etc.,</p><p>Th,:; rnr-'fi rncdul e consiptr. of a rurrber of routines, each respo^tible for a snecial wor&gt; . One ratine <b><i>i </i></b>or example perform? morphological analysis of woran;    another, for syntactic and ~'e~ other, for application of case frames, and so on. Analysis are carried cut from the surface structure throu-'h the deep structure. <i>h </i>deei. structure <b>.T</b>&lt;ay comprise roles of six essential types: SUBject, CBJeot,lKVolvtownt,fITuation, S TA te and OAtHation. They make up a basic frame with the '"KEBicator as shown in Fig. 1.</p><p>In .application, a role may come into it? subcategories whenever necessary, SITuation, for example,    may fall into</p><p>Tl"e, LOOation, DEGree or COFdition; INVolvement into PfsCipient, PARtioi-pant or GOAljand CAUsation into BAF-is, î UHpose or RE'ult ana <i>no</i><i> </i>on.</p><doubt alpha="50.0" length="12" tooSmall="False" monospace="0.0">GAU \-~~,PTA</doubt><doubt alpha="60.0" length="5" tooSmall="False" monospace="0.0">Fig.1</doubt><p>In analysis, the deep structure is obtained via preferential weightings caculated from grammatical data and frame labels. The following sentence? for example would result in two dif­ferent internal structures even though their sirrfa.ee structures are similar.</p><p>1. We found John very well.</p><p><i>2.</i><i> </i>We know John very well.</p><p>In the case frame, their deep struc­tures would be:</p><doubt alpha="41.9" length="31" tooSmall="False" monospace="0.0">1. found (SUB(1),0BJ(?),CCM(3))</doubt><doubt alpha="44.8" length="29" tooSmall="False" monospace="0.0">2.know(^LrR(l),0EJ(2),STY(3))</doubt><p>When an internal structure results, it serves as the basis for transfer.</p><p>TRANSFER AND GENi'ffATION</p><p>In the transfer stage, transformation is accomplished in two steps s first the internal structure of the f'L sen­tence is generated into a tree, with nodes that indicate their proper se­mantic and grammatical order in tha TL sentence; then lexicon rules are in­voked to transfer the HL entry, on the basis of its context, into the TL entry. The advantage of such a pro­cedure are obvious. It makes the rules more flexible, especially those coping with sentences with similar in­ternal structures. Moreover, rules can be added, modified or changed as needed with no resultant effect on one another.</p><p>When a target tree is built up, it is then scanned by way <b>of </b>left recursion and with word s appended to its termi­nal nodes aa required.<page local="3" global="1987"/> Finally, a character string is obtained; its out­put is a sentence in TL.</p><doubt alpha="0.0" length="4" tooSmall="False" monospace="0.0">3 77</doubt><p><u>CONCL</u>USION</p><p>Efforts made over the past decade have achieved considerable progress in machine translation. First syntactic parsing was pursued, then semantic and context analysis was advocated. ECTST has profited <b>from both theories.</b></p><p>Natural language is essentially a discrete information system. It often allows multiple syntactic interpreta­tions. To minimize the possibility of multiple interpretation, we introduce a minimum amount of semantic informa­tion and adopt the case frame. This provides flexible facility in syntac­tic analysis and helps to distinguish structural ambiguity. In this ap­proach, the translation accuracy is up to 90<b>/3 </b>or more, which can be raised if corresponding information and/or rules are modified and supplemented.</p><p>1. Pan Yu and Yuan Y. Sung (87).</p><p>"Automatic English-Chinese Transla­tor," Proceeding of Interna­tional Conference on Chinese In­formation Processing, pp. 52-51</p><p>'?. Jonothan Slocum Diemens Corpora­tion and Winfield S. Bennett (82). "The LHC Machine Translation Sys­tem: An Application of State<b>-of</b>-the Art Text and Natural Language Pro­cessing Techniques to the Transla­tion of Technical <b>Maimuals t </b>" Work™ ir:&gt; Paper LHC-32-1   July 1982</p><p>3. Mei<b>-Du </b>! i   and   Gary G. Erickson. <b>" Modular   </b>Dictionary   Design <b>For </b>Chines8-To-Knglish Machine <b>Transla­</b>tion,"     GAPlJAK Research Inc. 990 Highland Drive, Solana Beach, Cali­fornia 92075-2472,  r,p. 249-252</p><doubt alpha="66.7" length="111" tooSmall="False" monospace="0.0">4.Vw&amp;xi".Jianshuo(87)."Language Features   and Semantic Information inMT," Proceedings   of ICCIP'37,pp.110-116</doubt><p>5. Makoto HAGAO (82), "A Purvey of Natural Language Processing and Ma­chine Translation in Japan," Compu­ter Science <i>à </i>Technology, pp. 64-70 T. Kila&lt;?awa(eri.) OHMS <b>HA, </b>LTD. &amp; North-Holland Pub. Co. 6. T-!akoto NAGAO (86). "Current Status and and Future Trends ir&gt; Machine Translation," Future Generations Computer System 2 (1986) pp.77-32. Elsevier Science Publishers B.V. (North Holland)</p><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">378</doubt></section></body></article>