<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1020">
  <Title>AN ENGLISH-TO-KOI~EAN MACHINE TI~ANSLATOR, : * ~' .:~ MA~ ES/EK</Title>
  <Section position="3" start_page="0" end_page="0" type="metho">
    <SectionTitle>
2. Overview of The System
</SectionTitle>
    <Paragraph position="0"> MNI'ES/EK is a typical transfi'x-based system, which does English sentence analysis, tnmsforms the result (parse tree) into an intermediate repre-.</Paragraph>
    <Paragraph position="1"> sentation, and then transRn'ms it into ~L Korean syntactic structure to construct ~t Korean sentmlce. Figure 1 de.picts the ow'.rall configuration of MNI'ES/EK, which has R)llowing features:</Paragraph>
  </Section>
  <Section position="4" start_page="0" end_page="129" type="metho">
    <SectionTitle>
* Morphological Analysis Using l'C/-gr;ml : We
</SectionTitle>
    <Paragraph position="0"> resolve tile category ambiguities by combining the N-gram and the rules. (Kim, 1992) . Augmented Context Free (',ranlmars for Ellglish Syntactic An~dysis : We dew'.loped a set of augmented context free gr~mmu~r rules \['or general English synt~mtic analysis a, td the. ~malyzer is implemented using '/bnfita~ LI{. parsing algorithm (Tomita, 1987).</Paragraph>
    <Paragraph position="1"> , I,exical Semantic Structure (LSS) to repre-sent the intermediate representation : The result of the syntactic structure is trans.tbrmed into an intermediate representatkm LSS, which is a dependency structure that is relatively independent to specific languages. In I, SS, the constituents in a sentence are combined only in head-dependent relation based on the lexieal categories, and there art.' no order relatkm between the constituents. Hence LSS is desirable for trans- null lation between English and Korean, two languages with fairly different syntactic structures (Kweon, et M., 1990, Kweon, 1992).</Paragraph>
    <Paragraph position="2"> * Grammar Writing Language and Its Environment : MATES/EK runs a series of tree transformations on LSS structures from the English syntactic structure, in order to get a structure specific to Korean syntactic structure. To do this, a grammar writing language and the supporting system were developed for the tree transformations (Kweon, 1992).</Paragraph>
    <Paragraph position="3"> The whole tree transformations are done in a single grammar processing system in which a grammar writing language is defined and a set of tools, such as the parser, the interpreter and some debugging facilities for the language, are supported. In the grammar writing language, a rule describes a tree transformation by specifying the p~ttern of an input tree, test conditions, the transformation operations, and the resultant tree structures. Figure 2 is an example of a tree transformation rule written in grammar writing language and two trees before and after its apphcation.</Paragraph>
    <Paragraph position="4"> MATES/EK consists of a set of dictionaries, a set of grammar rules, and the processing modules. Translation is done through a series of processes; English morphological analysis, English syntactic analysis, English semantic analysis, English-Korean lexical transfer, English-to-Korean structural transformation, Korean syntactic structure generation, and Korean morphologicM generation. Brief introductions to each processing follows. null</Paragraph>
  </Section>
  <Section position="5" start_page="129" end_page="130" type="metho">
    <SectionTitle>
3. English Analysis
</SectionTitle>
    <Paragraph position="0"/>
    <Section position="1" start_page="129" end_page="130" type="sub_section">
      <SectionTitle>
3.1. Morphological Analysis
</SectionTitle>
      <Paragraph position="0"> It incorporates the method of categorial ambiguity resolution using N-gram with rule combinations, as well as the basic English word identification, such as word separation, processing of Mtixes and recognition of idiomatic phrases (Kim, et M., 1092).</Paragraph>
      <Paragraph position="1"> 3.2. English Syntactic Analysis It uses the gener~flized Tomita Lit parsing algorithm on augmented context free grammar. Tile grammar is inductively constructed from 3,000 e~trefully selected sentences that include various linguistic phenomena of English. Those sentences are mainly selected from the IEEE computer magazine September 1991. Other sources of the test sentences are HP issue test sentences, ~nd I,ongman English Grammar Textbook. The constructed grammar for syntax analysis consists of about 500 rules.</Paragraph>
      <Paragraph position="2"> As described above, LSg(the Lexical Semantic Structure) is description for the intermediate representation. The result of syntactic analysis is transformed into an LSS which is relatively more specific to English, and then is transformed into  an LSS speeitic to Korean.</Paragraph>
    </Section>
    <Section position="2" start_page="130" end_page="130" type="sub_section">
      <SectionTitle>
3.3. English Semantic Analysis
</SectionTitle>
      <Paragraph position="0"> We developed more titan 300 tree transforming rules that are written in grammar writing law guage. These grammar rules lead the English syntactic structure into a dependency structure of English. This dependency structure is relatively similar to meaning structure but it is still specitic to English, so we need more tree transformations to get a structure for Korean language.</Paragraph>
      <Paragraph position="1"> head in an \];',uglish dependency structure is a \]:;nglish verb word, the hexd in corresponding Korean dependency structure is Korean verb or a,djeclive word, those two words are often not mapped directly, l&amp;quot;igure 3 is an example of transformation from an English syntactic structure into its English specilic dependency structures LSS for a sentence &amp;quot;Pipelining increases \])erformance by ex-I)loiting instruction-level parallelism.&amp;quot;</Paragraph>
    </Section>
  </Section>
class="xml-element"></Paper>