Expressing Implicit Semantic Relations without Supervision

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, related work available at http://purl.org/peter.turney/

Scientific paper

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 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Expressing Implicit Semantic Relations without Supervision does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Expressing Implicit Semantic Relations without Supervision, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expressing Implicit Semantic Relations without Supervision will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-250131

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.