<?xml version="1.0" standalone="yes"?>
<Paper uid="P06-1040">
  <Title>Expressing Implicit Semantic Relations without Supervision</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present an unsupervised learning algorithm that mines large text corpora for patterns that express implicit semantic relations. For a given input word pair YX : with some unspecified semantic relations, the corresponding output list of patterns mPP ,,1 is ranked according to how well each pattern iP expresses the relations between X and Y . For example, given ostrich=X and bird=Y , the two highest ranking output patterns are &amp;quot;X is the largest Y&amp;quot; and &amp;quot;Y such as the X&amp;quot;. The output patterns are intended to be useful for finding further pairs with the same relations, to support the construction of lexicons, ontologies, and semantic networks. The patterns are sorted by pertinence, where the pertinence of a pattern iP for a word pair YX : is the expected relational similarity between the given pair and typical pairs for iP . The algorithm is empirically evaluated on two tasks, solving multiple-choice SAT word analogy questions and classifying semantic relations in noun-modifier pairs. On both tasks, the algorithm achieves state-of-the-art results, performing significantly better than several alternative pattern ranking algorithms, based on tf-idf.</Paragraph>
  </Section>
class="xml-element"></Paper>