<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1008">
  <Title>Time Mapping with Hypergraphs</Title>
  <Section position="4" start_page="60" end_page="60" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper, we have proposed the application of hypergraph techniques to word graph parsing. Motivated by linguistic properties of spontaneously spoken speech, we argued that bundles of edges in word graphs should be treated in an integrated manner. We introduced interval graphs and directed hypergraphs as representation devices. Directed hypergraphs extend the notion of a family of edges in that they are able to represent edges having several start and end vertices.</Paragraph>
    <Paragraph position="1"> We gave a formal definition of word graphs and the necessary extensions to cover hypergraphs. The conditions that have to be fulfilled in order to merge two hyperedges and to combine two adjacent hyperedges were stated in a formal way; an algorithm to integrate a word hypothesis into a hypergraph was presented.</Paragraph>
    <Paragraph position="2"> We proved the applicability of our mechanisms by parsing one dialogue of real-world spoken utterances. Using hypergraphs resulted in a 91% reduction of initial edges in the graph and a 79% reduction in the total number of chart edges. Parsing hypergraphs instead of ordinary word graphs reduced the parsing time by 93%.</Paragraph>
  </Section>
class="xml-element"></Paper>