<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1035">
  <Title>SYLLABLE-IIASED MOI)EI. FOR TIIF, K()III~AN MORPIIOLOGY</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. Introduction
</SectionTitle>
    <Paragraph position="0"> There are two linguistic phenomena that are interested in Ihe processing of computational morphology. They are morphological transformation and morpheme identification. Two-level model and syllable--based formalism focussed on the problem of morl)hological h'ansformntion IBear88, Cahig0, Kosk83\]. Morpheme identification is an importmlt issue in some languages where two or more morphemes ave combined to make a word, a compound word, or a sentence without any delimiters between morphemes \[Abe86, Chen92, Paeh92\].</Paragraph>
    <Paragraph position="1"> The goal of morphological analysis is to find the base form of morphemes in a word.</Paragraph>
    <Paragraph position="2"> It consists of a generation of analysis candidates and the selection of ton'cot candidates. Analysis candidates are generated as a reverse process of word formation rules'. morpheme isolation and morphological transformation. Then, correct candidates are selected by the coherence restrictions among  adjacent morphelnes and dictionary confirnmtion. The morphological mmlyzer tries to generate all the possible candidates only to accept the correct candidates.</Paragraph>
  </Section>
class="xml-element"></Paper>