<?xml version="1.0" standalone="yes"?>
<Paper uid="J04-4003">
  <Title>c(c) 2004 Association for Computational Linguistics Fast Approximate Search in Large Dictionaries Stoyan Mihov [?]</Title>
  <Section position="6" start_page="4333212" end_page="4333212" type="intro">
    <SectionTitle>
AST
</SectionTitle>
    <Paragraph position="0"> (P, k) at several final states. In order to determine the optimal distance between P and a substring T prime of T ending at a certain position, it is necessary to determine the final state that can be reached that has the smallest exponent.</Paragraph>
    <Paragraph position="1"> In the remainder of the article, the set of all states with base number i is called the ith column of A</Paragraph>
  </Section>
class="xml-element"></Paper>