<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2147">
  <Title>mar, A language-Independent System for Parsing Unrestricted Tezt. Mouton de</Title>
  <Section position="4" start_page="895" end_page="896" type="concl">
    <SectionTitle>
4. Conclusion
</SectionTitle>
    <Paragraph position="0"> A new weighted CFG compilation algorithm has been presented. It can be used to compile effi- null ciently an interesting class of grammars representing weighted regular languages and allows for dynamic modifications that are crucial in many speech recognition applications.</Paragraph>
    <Paragraph position="1"> While we focused here on CFGs with real number weights, which are especially relevant in speech recognition, weighted CFGs can be defined more generally over an arbitrary semiring (Salomaa and Soittola, 1978). Our compilation algorithm applies to general semirings without change. Both the grammar compilation algorithms (GRM library) and our automata optimization tools (FSM library) work in the most general case.</Paragraph>
  </Section>
class="xml-element"></Paper>