<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2173">
  <Title>PATTERN MATCHING IN THE TEXTRACT INFORMATION EXTRACTION SYSTEM</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> In information extraction systems, finite-state pattern matchers are becoming popular as a means of identifying individu~d pieces of information in a sentence. Pattern matching systems for English texts are reported to be suits,hie tor achieving a high level of per\[brmance with less effort, compared to full parsing architectures\[Hobbs et al. 92\]. Among seventeen systems presented in the Fifth Message Understanding Conference (MUC-5), three systems used a pattern marcher a.s the main component for identifying patterns to be extracted \[MUC-5 93\]. A pattern matching architecture is appropriate for information extraction fi-om texts in narrow domains since identifying informatkm does not necessarily require full understa.nding of the text. The pattern matcher can extract information of intertVisiting rese;trcher fron/ NTT Data Communications Systems Corp., email: tkitani~.rd.nttdM.a.jp</Paragraph>
  </Section>
class="xml-element"></Paper>