<?xml version="1.0" standalone="yes"?>
<Paper uid="W03-1113">
  <Title>Dynamic Programming Matching for Large Scale Information Retrieval</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for large-scale information retrieval. In this paper, we propose a method of dynamic programming matching for information retrieval. This method is as effective as a conventional information retrieval system, even though it is capable of approximate matching. It is also as efficient as a conventional system.</Paragraph>
  </Section>
class="xml-element"></Paper>