Expressing Implicit Semantic Relations without Supervision
<|reference_start|>Expressing Implicit Semantic Relations without Supervision: We present an unsupervised learning algorithm that mines large text corpora for patterns that express implicit semantic relations. For a given input word pair X:Y with some unspecified semantic relations, the corresponding output list of patterns <P1,...,Pm> is ranked according to how well each pattern Pi expresses the relations between X and Y. For example, given X=ostrich and Y=bird, the two highest ranking output patterns are "X is the largest Y" and "Y such as the X". 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 Pi for a word pair X:Y is the expected relational similarity between the given pair and typical pairs for Pi. 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.<|reference_end|>
@article{turney2006expressing,
    title={Expressing Implicit Semantic Relations without Supervision},
    author={Peter D. Turney (National Research Council of Canada)},
    journal={Proceedings of the 21st International Conference on Computational
  Linguistics and 44th Annual Meeting of the Association for Computational
  Linguistics (ACL-06), (2006), Sydney, Australia, 313-320},
    year={2006},
    number={NRC-48761},
    archivePrefix={arXiv},
    eprint={cs/0607120},
    primaryClass={cs.CL cs.AI cs.IR cs.LG}
}