<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1011">
  <Title>PRECISE N-GRAM PROBABILITIES FROM STOCHASTIC CONTEXT-FREE GRAMMARS</Title>
  <Section position="11" start_page="77" end_page="77" type="ackno">
    <SectionTitle>
ACKNOWLEDGMENTS
</SectionTitle>
    <Paragraph position="0"> Dan Jurafsky wrote the BeRP grammar, carried out the recognition experiments, and was generally indispensable. Steve Omohundro planted the seed for our n-gram algorithm during lunch at the California Dream Caf6 by suggesting sub-string expectations as an interesting computational linguistics problem. Thanks also to Jerry Feldman and Lokendra Shastri for improving the presentation with their comments.</Paragraph>
    <Paragraph position="1"> This research has been supported by ICSI and ARPA contract #N0000 1493 C0249.</Paragraph>
    <Paragraph position="2"> C This leads to</Paragraph>
  </Section>
class="xml-element"></Paper>