<?xml version="1.0" standalone="yes"?>
<Paper uid="M98-1003">
  <Title>Analyzing the Complexity of a Domain With Respect To An Information Extraction Task</Title>
  <Section position="2" start_page="7" end_page="11" type="concl">
    <SectionTitle>
Conclusion
</SectionTitle>
    <Paragraph position="0"> The level of a fact with respect to a network for a piece of text provides a new method of classifying a fact based on the degree of syntactic complexity related to a fact. This classi#0Ccation tries to quantify the complexity of the syntax that holds the information in text. Moreover, studies based upon this classi#0Ccation scheme indicate that there is a correlation between the level of a fact and the di#0Eculty of its extraction.</Paragraph>
    <Paragraph position="1"> The analysis of the degree of di#0Eculty of understanding a text in a domain comes as a by-product of our approach and is a big step up from some of the techniques used earlier.</Paragraph>
    <Paragraph position="2"> This measure is just the beginning of a search for useful complexity measures. Despite its shortcomings, the current measure does quantify complexity on one very important dimension, namely the number of clauses #28or phrases#29 required to specify a fact. For the short term it appears to be the best available vehicle for understanding the complexity of extracting a fact as shown in this paper.</Paragraph>
  </Section>
class="xml-element"></Paper>