relatedness
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 6
WordNet::SenseRelate::AllWords 0.06
WordNet::SenseRelate::AllWords is a Perl module to perform Word Sense Disambiguation. more>>
WordNet::SenseRelate::AllWords is a Perl module to perform Word Sense Disambiguation.
SYNOPSIS
use WordNet::SenseRelate::AllWords;
use WordNet::QueryData;
my $qd = WordNet::QueryData->new;
my $wsd = WordNet::SenseRelate::AllWords->new (wordnet => $qd,
measure => WordNet::Similarity::lesk);
my @results = $wsd->disambiguate ();
WordNet::SenseRelate::AllWords implements an algorithm for Word Sense Disambiguation that uses measures of semantic relatedness. The algorithm is an extension of an algorithm described by Pedersen, Banerjee, and Patwardhan[1]. This implementation is similar to the original SenseRelate package but disambiguates every word in the given context rather than just single word.
<<lessSYNOPSIS
use WordNet::SenseRelate::AllWords;
use WordNet::QueryData;
my $qd = WordNet::QueryData->new;
my $wsd = WordNet::SenseRelate::AllWords->new (wordnet => $qd,
measure => WordNet::Similarity::lesk);
my @results = $wsd->disambiguate ();
WordNet::SenseRelate::AllWords implements an algorithm for Word Sense Disambiguation that uses measures of semantic relatedness. The algorithm is an extension of an algorithm described by Pedersen, Banerjee, and Patwardhan[1]. This implementation is similar to the original SenseRelate package but disambiguates every word in the given context rather than just single word.
Download (0.035MB)
Added: 2007-04-07 License: Perl Artistic License Price:
934 downloads
WordNet::Similarity 1.04
WordNet::Similarity is a collection of Perl modules for computing measures of semantic relatedness. more>>
WordNet::Similarity is a collection of Perl modules for computing measures of semantic relatedness.
SYNOPSIS
Basic Usage Example
use WordNet::QueryData;
use WordNet::Similarity::path;
my $wn = WordNet::QueryData->new;
my $measure = 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) = $valuen";
Using a configuration file to initialize the measure
use WordNet::Similarity::path;
my $sim = WordNet::Similarity::path->new($wn, "mypath.cfg");
my $value = $sim->getRelatedness("dog#n#1", "cat#n#1");
($error, $errorString) = $sim->getError();
die $errorString if $error;
print "dog (sense 1) cat (sense 1) = $valuen";
Printing traces
print "Trace String -> ".($sim->getTraceString())."n";
Introduction
We observe that humans find it extremely easy to say if two words are related and if one word is more related to a given word than another. For example, if we come across two words, car and bicycle, we know they are related as both are means of transport. Also, we easily observe that bicycle is more related to car than fork is. But is there some way to assign a quantitative value to this relatedness? Some ideas have been put forth by researchers to quantify the concept of relatedness of words, with encouraging results.
Eight of these different measures of relatedness have been implemented in this software package. A simple edge counting measure and a random measure have also been provided. These measures rely heavily on the vast store of knowledge available in the online electronic dictionary -- WordNet. So, we use a Perl interface for WordNet called WordNet::QueryData to make it easier for us to access WordNet. The modules in this package REQUIRE that the WordNet::QueryData module be installed on the system before these modules are installed.
<<lessSYNOPSIS
Basic Usage Example
use WordNet::QueryData;
use WordNet::Similarity::path;
my $wn = WordNet::QueryData->new;
my $measure = 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) = $valuen";
Using a configuration file to initialize the measure
use WordNet::Similarity::path;
my $sim = WordNet::Similarity::path->new($wn, "mypath.cfg");
my $value = $sim->getRelatedness("dog#n#1", "cat#n#1");
($error, $errorString) = $sim->getError();
die $errorString if $error;
print "dog (sense 1) cat (sense 1) = $valuen";
Printing traces
print "Trace String -> ".($sim->getTraceString())."n";
Introduction
We observe that humans find it extremely easy to say if two words are related and if one word is more related to a given word than another. For example, if we come across two words, car and bicycle, we know they are related as both are means of transport. Also, we easily observe that bicycle is more related to car than fork is. But is there some way to assign a quantitative value to this relatedness? Some ideas have been put forth by researchers to quantify the concept of relatedness of words, with encouraging results.
Eight of these different measures of relatedness have been implemented in this software package. A simple edge counting measure and a random measure have also been provided. These measures rely heavily on the vast store of knowledge available in the online electronic dictionary -- WordNet. So, we use a Perl interface for WordNet called WordNet::QueryData to make it easier for us to access WordNet. The modules in this package REQUIRE that the WordNet::QueryData module be installed on the system before these modules are installed.
Download (0.63MB)
Added: 2007-02-28 License: Perl Artistic License Price:
968 downloads
WordNet::Similarity::vector_pairs 1.04
WordNet::Similarity::vector_pairs is a Perl module for computing semantic relatedness of word senses. more>> <<less
Download (0.63MB)
Added: 2007-08-18 License: GPL (GNU General Public License) Price:
798 downloads
WebService::GoogleHack::Rate 0.15
WebService::GoogleHack::Rate is a Perl module that implements a simple relatedness measure and semantic orientation. more>>
WebService::GoogleHack::Rate is a Perl module that implements a simple relatedness measure and semantic orientation related type functions.
SYNOPSIS
use WebService::GoogleHack::Rate;
#GIVE PATH TO INPUT FILE HERE
my $INPUTFILE="";
#GIVE PATH TO TRACE FILE HERE
my $TRACEFILE="";
#create an object of type Rate
my $rate = WebService::GoogleHack::Rate->new();
$results=$rate->measureSemanticRelatedness1("dog", "cat");
#The PMI measure is stored in the variable $results, and it can also
#be accessed as $rate->{PMI};
$results=$rate->predictSemanticOrientation($INPUTFILE, "excellent", "bad",$TRACEFILE);
#The resutls can be accessed through
print $results->{prediction}."n";
$results->{PMI Measure}."n";
$rate->{prediction} &."n";
$rate->{PMI Measure}."n";
WebService::GoogleHack::Rate - This package uses Google to do some basic natural language processing. For example, given two words, say "knife" and "cut", the module has the ability to retrieve a semantic relatedness measure, commonly known as the PMI (Pointwise mututal information) measure. The larger the measure the more related the words are. The package can also predict the semantic orientation of a given paragraph of english text. A positive measure means that the paragraph has a positive meaning, and negative measure means the opposite.
<<lessSYNOPSIS
use WebService::GoogleHack::Rate;
#GIVE PATH TO INPUT FILE HERE
my $INPUTFILE="";
#GIVE PATH TO TRACE FILE HERE
my $TRACEFILE="";
#create an object of type Rate
my $rate = WebService::GoogleHack::Rate->new();
$results=$rate->measureSemanticRelatedness1("dog", "cat");
#The PMI measure is stored in the variable $results, and it can also
#be accessed as $rate->{PMI};
$results=$rate->predictSemanticOrientation($INPUTFILE, "excellent", "bad",$TRACEFILE);
#The resutls can be accessed through
print $results->{prediction}."n";
$results->{PMI Measure}."n";
$rate->{prediction} &."n";
$rate->{PMI Measure}."n";
WebService::GoogleHack::Rate - This package uses Google to do some basic natural language processing. For example, given two words, say "knife" and "cut", the module has the ability to retrieve a semantic relatedness measure, commonly known as the PMI (Pointwise mututal information) measure. The larger the measure the more related the words are. The package can also predict the semantic orientation of a given paragraph of english text. A positive measure means that the paragraph has a positive meaning, and negative measure means the opposite.
Download (0.088MB)
Added: 2006-12-04 License: Perl Artistic License Price:
1054 downloads
WordNet::Similarity::PathFinder 1.04
WordNet::Similarity::PathFinder is a Perl module to implement path finding methods for WordNet::Similarity measures. more>>
WordNet::Similarity::PathFinder is a Perl module to implement path finding methods (by node counting) for WordNet::Similarity measures of semantic relatedness.
SYNOPSIS
use WordNet::QueryData;
my $wn = WordNet::QueryData->new;
use WordNet::Similarity::PathFinder;
my $obj = WordNet::Similarity::PathFinder->new ($wn);
my $result = $obj->parseWps($wps1, $wps2);
my @paths = $obj->getShortestPath("dog#n#1", "cat#n#1", "n", "wps");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
my @paths = $obj->getAllPaths("worship#v#1", "adore#v#1", "v", "wps");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
my @paths = $obj->getShortestPath("02895418", "02724985", "n", "offset");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
Introduction
This class is derived from (i.e., is a sub-class of) WordNet::Similarity.
The methods in this module are useful for finding paths between concepts in WordNets is-a taxonomies. Concept A is-a concept B if, and only if, B is a hypernym of A or A is in the hypernym tree of B. N.B., only nouns and verbs have hypernyms.
The methods that find path lengths (such as getShortestPath() and getAllPaths() compute the lengths using node-counting not edge-counting. In general, the length of a path using node-counting will always be one more than the length using edge-counting. For example, if concept A is a hyponym of concept B, then the path length between A and B using node-counting is 2, but the length using edge-counting is 1. Likewise, the path between A and A is 1 using node-counting and 0 using edge-counting.
<<lessSYNOPSIS
use WordNet::QueryData;
my $wn = WordNet::QueryData->new;
use WordNet::Similarity::PathFinder;
my $obj = WordNet::Similarity::PathFinder->new ($wn);
my $result = $obj->parseWps($wps1, $wps2);
my @paths = $obj->getShortestPath("dog#n#1", "cat#n#1", "n", "wps");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
my @paths = $obj->getAllPaths("worship#v#1", "adore#v#1", "v", "wps");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
my @paths = $obj->getShortestPath("02895418", "02724985", "n", "offset");
my ($length, $path) = @{shift @paths};
defined $path or die "No path between synsets";
Introduction
This class is derived from (i.e., is a sub-class of) WordNet::Similarity.
The methods in this module are useful for finding paths between concepts in WordNets is-a taxonomies. Concept A is-a concept B if, and only if, B is a hypernym of A or A is in the hypernym tree of B. N.B., only nouns and verbs have hypernyms.
The methods that find path lengths (such as getShortestPath() and getAllPaths() compute the lengths using node-counting not edge-counting. In general, the length of a path using node-counting will always be one more than the length using edge-counting. For example, if concept A is a hyponym of concept B, then the path length between A and B using node-counting is 2, but the length using edge-counting is 1. Likewise, the path between A and A is 1 using node-counting and 0 using edge-counting.
Download (0.63MB)
Added: 2007-08-01 License: Perl Artistic License Price:
817 downloads
WebService::GoogleHack 0.15
WebService::GoogleHack is a Perl package that ties together all GoogleHack modules. more>>
WebService::GoogleHack is a Perl package that ties together all GoogleHack modules (Webservice::GoogleHack::Search, Webservice::GoogleHack::Spelling, Webservice::GoogleHack::Rate, and Webservice::GoogleHack::Text) to implement Natural Language Processing techniques that use the World Wide Web as a source of information. Use this package to access all the functionality of GoogleHack.
SYNOPSIS
use WebService::GoogleHack;
my $google = new WebService::GoogleHack;
#Initializing the object to the contents of the configuration file
# API Key, GoogleSearch.wsdl file location.
$google->initConfig("initconfig.txt");
#Printing the contents of the configuration file
$google->printConfig();
#Measure the semantic relatedness between the words "white house" and
#"president".
$measure=$google->measureSemanticRelatedness1("white house","president");
print "nRelatedness measure between white house and president is: ";
print $measure."n";
#Going to search for words that are related to "toyota" and "ford"
my @terms=();
push(@terms,"toyota");
push(@terms,"ford");
#The parameters are the search terms, number of web page results to look
#at, the number of iterations,output file and the "true" indicates that the
#diagnostic data should be stored in the file "results.txt"
$results=$google->Algorithm1(@terms,10,25,1,"results.txt","true");
print $results;
WebService::GoogleHack is a PERL package that interacts with the Google API, and implements basic functions that allow the user to interact with Google and retrieve results in an easy to use format. GoogleHack also implements and extends a number of Natural Language Processing by using the World Wide Web as a source of information.
Main features:
- Issue queries to Google (WebService::GoogleHack, WebService::GoogleHack::Search)
- Retrieve Spelling suggestions from Google (WebService::GoogleHack, WebService::GoogleHack::Spelling)
- Find the Pointwise Mututal Information (PMI) measure between two words (WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a paragraph find if the paragraph has a positive or negative semantic orientation.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a set of words along with a positively oriented word such as "excellent" and a negatively oriented word such as "poor", find if the word has a positive or negative semantic orientation.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a set of phrases along with a positively oriented word such as "excellent" and a negatively oriented word such as "poor", predict if the given phrases are positive or negative in sentiment.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given two or more words finds a set of related words. (WebService::GoogleHack)
<<lessSYNOPSIS
use WebService::GoogleHack;
my $google = new WebService::GoogleHack;
#Initializing the object to the contents of the configuration file
# API Key, GoogleSearch.wsdl file location.
$google->initConfig("initconfig.txt");
#Printing the contents of the configuration file
$google->printConfig();
#Measure the semantic relatedness between the words "white house" and
#"president".
$measure=$google->measureSemanticRelatedness1("white house","president");
print "nRelatedness measure between white house and president is: ";
print $measure."n";
#Going to search for words that are related to "toyota" and "ford"
my @terms=();
push(@terms,"toyota");
push(@terms,"ford");
#The parameters are the search terms, number of web page results to look
#at, the number of iterations,output file and the "true" indicates that the
#diagnostic data should be stored in the file "results.txt"
$results=$google->Algorithm1(@terms,10,25,1,"results.txt","true");
print $results;
WebService::GoogleHack is a PERL package that interacts with the Google API, and implements basic functions that allow the user to interact with Google and retrieve results in an easy to use format. GoogleHack also implements and extends a number of Natural Language Processing by using the World Wide Web as a source of information.
Main features:
- Issue queries to Google (WebService::GoogleHack, WebService::GoogleHack::Search)
- Retrieve Spelling suggestions from Google (WebService::GoogleHack, WebService::GoogleHack::Spelling)
- Find the Pointwise Mututal Information (PMI) measure between two words (WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a paragraph find if the paragraph has a positive or negative semantic orientation.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a set of words along with a positively oriented word such as "excellent" and a negatively oriented word such as "poor", find if the word has a positive or negative semantic orientation.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given a set of phrases along with a positively oriented word such as "excellent" and a negatively oriented word such as "poor", predict if the given phrases are positive or negative in sentiment.(WebService::GoogleHack,WebService::GoogleHack::Rate)
- Given two or more words finds a set of related words. (WebService::GoogleHack)
Download (0.088MB)
Added: 2006-11-28 License: Perl Artistic License Price:
1060 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 1
- 1
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above relatedness search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed