<?xml version="1.0" standalone="yes"?>
<Paper uid="W03-1113">
  <Title>Dynamic Programming Matching for Large Scale Information Retrieval</Title>
  <Section position="7" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this study, we proposed a DP matching method for large-scale information retrieval. To improve its efficiency, this method selects the strings that contribute more to retrieval. This selection process reduces the memory requirement and frequency of memory access. We conclude that our method is suitable for large-scale information retrieval where approximate matching is required.</Paragraph>
  </Section>
class="xml-element"></Paper>