<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2138">
  <Title>Identifying Temporal Expression and its Syntactic Role Using FST and Lexical Data from Corpus</Title>
  <Section position="3" start_page="954" end_page="955" type="intro">
    <SectionTitle>
2 Related Works
</SectionTitle>
    <Paragraph position="0"> Almey (\] 991) has proposed texL chunldng as a t)l'e liminary st;e l) to tmrsing on the basis of psychological (wi(lence. In his work, tim chunk was (lefine(1 as a. t)artitione(l segnmnt wlfi(:h corl:(~,Sl)Oll(ts in some way to ln'osodic lmtt(!rns, l\[n addition, con&gt; 1)lex }/I;|;tlchlllellt (\](?cisions ;Is occurring in NP or VP analysis are 1)OStl)one,(l wit;hour \]icing (leci(led in (:hunldng. Rmnshaw and Marcus (1995) introdu(:e(l a 1)aseNl' whi(:h is a non-re(:ursive NIL They used trmlsfornmtion-1)ase(l learning to i(lentif~y n(/nrecto'sire l)aseNPs in a s(mtence. Also, V-typ(~ (:hullk was iifl;roduce(l in their system, and so I;lw, y (aied to t)artition sentences into non-overlal)l)ing N-type ;til(t V-tyl)e ('hunks. Y(/on, et al. (\].099) have, defined ('lmnking in various ways for efficient analysis of Korean texts mM shown that the, mt:tho(t is very eff(;(:tive for practical al)l)li(:ation.</Paragraph>
    <Paragraph position="1"> l leside, s, th(',r(~ have })een many w(/rks based on the finite state ma(:hine. The finite state machine i,~ of ten used for systems su(:h as speech t)r(l('essing, liartern mat('hing, P()S tagging and so forth becmlse of its ei\[i('ien(;y of sl)ee(l mid si)aee and its ('onvenience of rei)resenl;ai;ion. As for parsing, it is not suitable \['or flfll parsing based on the grammar that has recurrent property, but for partial parsing requiring simple, sl;&amp;l;e l;rallsitioll, l~.o('he all(1 S(:hal)es (1995) have i;ransformed l;he Brilt's rule based tagger to the (ll)timized deterministic FST and imI)roved the sl)eed mM sl)a.ce of the tagger. A. nora.tile one related t(/this work is about local grammar 1)resented in Gross (1993), which is suital)le for rel)resenting  rigid phrases, collocations and idioms unlike global grammar for describing sentences of a language in a formal level. The temporal expression was represented with loc~l grammar in his work, where it, was claimed that the formalism of finite automata could be easily used to represent them.</Paragraph>
  </Section>
class="xml-element"></Paper>