<?xml version="1.0" standalone="yes"?>
<Paper uid="P06-2007">
  <Title>Sydney, July 2006. c(c)2006 Association for Computational Linguistics N Semantic Classes are Harder than Two</Title>
  <Section position="10" start_page="54" end_page="54" type="concl">
    <SectionTitle>
8 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have provided the first benchmark for n-class semantic classification of highly substitutable query phrases. There is much room for improvement, and we expect that this baseline will be surpassed.</Paragraph>
  </Section>
class="xml-element"></Paper>