<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-1062">
  <Title>VOCNETS - A TOOL FOR HANDLING FINITE VOCABULARIES</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. Task
</SectionTitle>
    <Paragraph position="0"> We thus require a method for representing a v o c a b u 1 a r y V of strings over on a 1 p h a b e t A (of letters, phonemes, morphemes or other atoms), where * A is small compared to the vocabulary V (say, 30 against 30 000 or 300 000), * the vocabulary V, though large, is finite, * V has a &amp;quot;structure&amp;quot; in the sense that, typically, a string in V contains substrings included in other strings in V.</Paragraph>
    <Paragraph position="1"> We want the representation to * permit convenient r e t r i e v a 1 of strings and substrings of strings in V, * be algorithmically constructed on s u c-c e s s i v e i n p u t of strings in V, or, if V is defined through B o o 1 e a n or s t r i n g o p e r a t i o n s on other sets, be derivable from operations on representations of these more elementary sets, * be reasonably c o m p a c t for practical computational applications.</Paragraph>
  </Section>
class="xml-element"></Paper>