WordNet::Similarity::path

Perl module for computing semantic relatedness of word senses by counting nodes in the noun and verb WordNet 'is-a' hierarchies.
Download

WordNet::Similarity::path Ranking & Summary

Advertisement

  • Rating:
  • License:
  • Perl Artistic License
  • Price:
  • FREE
  • Publisher Name:
  • Ted Pedersen, Siddharth Patwardhan and Jason Michelizzi
  • Publisher web site:
  • http://search.cpan.org/~sid/

WordNet::Similarity::path Tags


WordNet::Similarity::path Description

Perl module for computing semantic relatedness of word senses by counting nodes in the noun and verb WordNet 'is-a' hierarchies. WordNet::Similarity::path is a Perl module for computing semantic relatedness of word senses by counting nodes in the noun and verb WordNet 'is-a' hierarchies.SYNOPSIS use WordNet::Similarity::path; use WordNet::QueryData; my $wn = WordNet::QueryData->new(); my $path = WordNet::Similarity::path->new($wn); my $value = $measure->getRelatedness("car#n#1", "bus#n#2"); my ($error, $errorString) = $measure->getError(); die "$errorString " if($error); print "car (sense 1) bus (sense 2) = $value ";This module computes the semantic relatedness of word senses by counting the number of nodes along the shortest path between the senses in the 'is-a' hierarchies of WordNet. The path lengths include the end nodes. For example, the path between shrub#n#1 and tree#n#1 is shrub#n#1 - woody_plant#n#1 - tree#n#1.Since a longer path length indicate less relatedness, the relatedness value returned is the multiplicative inverse of the path length (distance) between the two concepts: relatedness = 1 / distance. If the two concepts are identical, then the distance between them is one; therefore, their relatedness is also 1. If no path is found, then a large negative number is returned and an error is generated (see getError()). Requirements: · Perl


WordNet::Similarity::path Related Software