Main > Free Download Search >

Free measures of semantic relatedness software for linux

measures of semantic relatedness

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 359
WordNet::SenseRelate::AllWords 0.06

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.

<<less
Download (0.035MB)
Added: 2007-04-07 License: Perl Artistic License Price:
934 downloads
Text::NSP::Measures::2D::Dice::dice 1.03

Text::NSP::Measures::2D::Dice::dice 1.03


Text::NSP::Measures::2D::Dice::dice is a Perl module to compute Dice coefficient for bigrams. more>>
Text::NSP::Measures::2D::Dice::dice is a Perl module to compute Dice coefficient for bigrams.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::Dice::dice;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$dice_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$dice_value."n"";
}

Assume that the frequency count data associated with a bigram is stored in a 2x2 contingency table:

word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp

where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.

The Dice Coefficient is defined as :

2 * n11
---------
np1 + n1p

The Jaccard coefficient can also be computed by applying a transformation to the dice coefficient:

$jaccard = $dice/(2-$dice)

Methods

calculateStatistic() - method to calculate the dice coefficient value

INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.

RETURN VALUES : $dice .. Dice Coefficient value for this bigram.

getStatisticName() - Returns the name of this statistic

INPUT PARAMS : none

RETURN VALUES : $name .. Name of the measure.

<<less
Download (0.93MB)
Added: 2007-03-16 License: GPL (GNU General Public License) Price:
954 downloads
Text::NSP::Measures::2D::Fisher::twotailed 1.03

Text::NSP::Measures::2D::Fisher::twotailed 1.03


Text::NSP::Measures::2D::Fisher::twotailed is a Perl module implementation of the two-sided Fishers exact test. more>>
Text::NSP::Measures::2D::Fisher::twotailed is a Perl module implementation of the two-sided Fishers exact test.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::Fisher::twotailed;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$twotailed_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage();
}
else
{
print getStatisticName."value for bigram is ".$twotailed_value;
}

<<less
Download (0.93MB)
Added: 2007-03-12 License: Perl Artistic License Price:
956 downloads
Text::NSP::Measures::2D::Fisher2::twotailed 1.03

Text::NSP::Measures::2D::Fisher2::twotailed 1.03


Text::NSP::Measures::2D::Fisher2::twotailed is a Perl module implementation of the two-sided Fishers exact test. more>>
Text::NSP::Measures::2D::Fisher2::twotailed is a Perl module implementation of the two-sided Fishers exact test.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::Fisher2::twotailed;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$twotailed_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage();
}
else
{
print getStatisticName."value for bigram is ".$twotailed_value;
}

This module provides a naive implementation of the fishers twotailed exact tests. That is the implementation does not have any optimizations for performance. This will compute the factorials and the hypergeometric measures using direct multiplications.

This measure should be used if you need exact values without any rounding errors, and you are not worried about the performance of the measure, otherwise use the implementations under the Text::NSP::Measures::2D::Fisher module. To use this implementation, you will have to specify the entire module name. Usage:

statistic.pl Text::NSP::Measures::Fisher2::twotailed dest.txt source.cnt
Assume that the frequency count data associated with a bigram < word1 >< word2 > is stored in a 2x2 contingency table:

word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp

where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.

The fishers exact tests are calculated by fixing the marginal totals and computing the hypergeometric probabilities for all the possible contingency tables,
A twotailed fishers test is calculated by adding the probabilities of all the contingency tables with probabilities less than the probability of the observed table. The twotailed fishers test tells us how likely it would be to observe an contingency table which is less prpbable than the current table.

<<less
Download (0.93MB)
Added: 2007-03-12 License: Perl Artistic License Price:
956 downloads
Text::NSP::Measures::2D::Dice::jaccard 1.03

Text::NSP::Measures::2D::Dice::jaccard 1.03


Text::NSP::Measures::2D::Dice::jaccard is a Perl module that implements the jaccard coefficient. more>>
Text::NSP::Measures::2D::Dice::jaccard is a Perl module that implements the jaccard coefficient.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::Dice::jaccard;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$jaccard_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$jaccard_value."n"";
}

Assume that the frequency count data associated with a bigram < word1 >< word2 > is stored in a 2x2 contingency table:

word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp

where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.

The Jaccard Coefficient is the ratio of number of times the words occur together to the number of times atleast any one of the words occur. It is defined as:

n11
---------------
n11 + n12 + n21

The Jaccard coefficient can also be computed by applying a transformation to the dice coefficient:

$jaccard = $dice/(2-$dice)
We use this computation of jaccard in our implementation.

Methods

calculateStatistic() - method to calculate the jaccard coefficient value

INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.

RETURN VALUES : $jaccard .. Jaccard Coefficient value for this bigram.

getStatisticName() - Returns the name of this statistic

INPUT PARAMS : none

RETURN VALUES : $name .. Name of the measure.

<<less
Download (0.94MB)
Added: 2007-03-15 License: GPL (GNU General Public License) Price:
954 downloads
Text::NSP::Measures 1.03

Text::NSP::Measures 1.03


Text::NSP::Measures is a Perl module for computing association scores of Ngrams. more>>
Text::NSP::Measures is a Perl module for computing association scores of Ngrams. This module provides the basic framework for these measures.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::MI::ll;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}

<<less
Download (0.94MB)
Added: 2006-10-19 License: Perl Artistic License Price:
1100 downloads
SenseClusters 0.95

SenseClusters 0.95


SenseClusters is a natural language processing package that allows you to cluster similar contexts or to identify clusters. more>>
SenseClusters is a natural language processing package that allows you to cluster similar contexts or to identify clusters of related words.
SenseClusters supports its own native methods based on first and second order representations of context, and also supports Latent Semantic Analysis. It is fully unsupervised, and can automatically discover the optimal number of clusters in your text.
SenseClusters is a complete system that takes users from preprocessing of raw text to providing clustered output.
Enhancements:
- Full support for Latent Semantic Analysis was introduced.
- Both contexts and words may be clustered using either native SenseClusters methods (first or second order) or Latent Semantic Analysis.
<<less
Download (20.1MB)
Added: 2006-08-29 License: GPL (GNU General Public License) Price:
1153 downloads
Mantissa 7.0

Mantissa 7.0


Mantissa is a collection of various mathematical tools aimed towards for simulation. more>>
Mantissa is a collection of various mathematical tools aimed towards for simulation.
Mantissa contains a collection of algorithms, among which:
a small set of linear algebra classes
a least squares estimator
some curve fitting classes
several ordinary differentials equations integrators, either with fixed steps or adaptive stepsize control (see below)
vectors and rotations in a three dimensional space
algebra-related classes like rational and double polynomials
various orthogonal polynomials:
Chebyshev
Hermite
Laguerre
Legendre
some random numbers and vectors generation classes:
Robert M. Ziff four tap shift register (contributed by Bill Maier)
Makoto Matsumoto and Takuji Nishimura Mersenne twister
generators for vectors with correlated components
some basic (min, max, mean, standard deviation) statistical analysis classes
some optimization algorithms using direct search methods:
the Nelder-Mead simplex method
Virginia Torczons multi-directional method
Enhancements:
- For many basic objects provided by Mantissa like Vector3D, Rotation, and the various Polynomial classes, instances are now guaranteed to be immutable.
- This greatly simplifies safe sharing of instances without forcing users to either put severe restrictions on their use of Mantissa classes or make numerous copies just to make sure everything is safe.
- Since the change is a semantic change on the contract of the classes, this version introduces some incompatibilities with respect to previous ones.
- Upgrading to this version is not difficult, though.
<<less
Download (0.19MB)
Added: 2006-12-15 License: BSD License Price:
1044 downloads
Measuring Buffer 20090628

Measuring Buffer 20090628


Measuring Buffer is an enhanced version of buffer. more>>
Measuring Buffer 20090628 provides you with a perfect and enhanced version of buffer which features display of throughput, network support, memory-mapped file I/O for huge buffers and multithreading. This will be your excellent choice.

Major Features:

  1. Display of I/O speed
  2. Optional use of memory mapped I/O for huge buffers
  3. Multithreaded instead of sharedmemory ipc
  4. Multi volume support
  5. Autoloader support
  6. Networking support
  7. Compatible command-line options

Enhancements:

  • This release fixes a hang on transfer sizes smaller than blocksize with status display active.
  • It has a Gentoo compatibility update, a man page update, a summary display update, and a libmhash initialization fix.
  • Termination latency with active status display is reduced.
  • There is a fix for -q suppressing the output of -H.
<<less
Added: 2009-06-29 License: GPL v3 Price: FREE
14 downloads
 
Other version of Measuring Buffer
Measuring Buffer 20070518Measuring Buffer is an enhanced version of buffer. Measuring Buffer 20070518 - Thomas Maier ... version of buffer. Measuring Buffer features display of throughput, network support, memory
License:GPL (GNU General Public License)
Download (0.090MB)
889 downloads
Added: 2007-05-18
WebService::GoogleHack::Rate 0.15

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.

<<less
Download (0.088MB)
Added: 2006-12-04 License: Perl Artistic License Price:
1054 downloads
Majic 0.01pre2

Majic 0.01pre2


Majic is an Erc interprter and compiler. more>>
Majic is the interpreter for a language called Erc. It is written in Java and follows the documented standard for the Erc language. First, a word about Erc: Erc is a link-oriented language. In fact, it is the first link-oriented language. It uses a novel syntax with roots in TCL, Scheme, Bash, and natural languages, among others.

Link orientation is a programming paradigm similar to a cross between link-orientation and object-orientation, with a little hypertext markup thrown in for good measure. In it, although it contains list-like structures which behave like objects, the focus is in fact the links between concepts (structures and elements), as opposed to list organization/processing or object creation.

This makes link-oriented languages such as Erc good for AI or other applications which require keeping track of links between concepts, such as expert systems, semantic searching, and neural nets.

Erc is pronounced URk, with a short U. Majic is pronounced MAH-jik. Both names are derived from the book Web of Angels by John M Ford, in which the Erc was the ethreal currency used in the book universe, and Majic was slang for multiple Erc.

Majic stands for Majic Ate Java Inline Classes, or My Awesome Java Interpreter Code. Erc stands for Enumerate Relative Constants, or Ercs Really Cool. Choose an interpretation, either I sound overconfident (read: like an arrogant jerk), obtrusely technical, or like a hacker with a bad sense of humor. All of that is true, just to clear stuff up.
<<less
Download (0.028MB)
Added: 2005-04-14 License: GPL (GNU General Public License) Price:
1655 downloads
Text::NSP::Measures::2D::CHI::tscore 1.03

Text::NSP::Measures::2D::CHI::tscore 1.03


Text::NSP::Measures::2D::CHI::tscore is a Perl module that implements T-score measure of association for bigrams. more>>
Text::NSP::Measures::2D::CHI::tscore is a Perl module that implements T-score measure of association for bigrams.

SYNOPSIS

Basic Usage

use Text::NSP::Measures::2D::CHI::tscore;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$tscore_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$tscore_value."n"";
}

Assume that the frequency count data associated with a bigram < word1 >< word2 > is stored in a 2x2 contingency table:

word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp

where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.

The T-score is defined as a ratio of difference between the observed and the expected mean to the variance of the sample. Note that this is a variant of the standard t-test that was proposed for use in the identification of collocations in large samples of text.

Thus, the T-score is defined as follows:

m11 = n1p * np1 / npp

T-score = (n11 - m11)/sqrt(n11)

calculateStatistic() - method to calculate the tscore Coefficient

INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $tscore .. tscore value for this bigram.
getStatisticName() - Returns the name of this statistic
INPUT PARAMS : none
RETURN VALUES : $name .. Name of the measure.

<<less
Download (0.93MB)
Added: 2007-03-12 License: Perl Artistic License Price:
957 downloads
Text::NSP::Measures::3D 1.01

Text::NSP::Measures::3D 1.01


Text::NSP::Measures::3D is a Perl module that provides basic framework for building measure of association for trigrams. more>>
Text::NSP::Measures::3D is a Perl module that provides basic framework for building measure of association for trigrams.

This module can be used as a foundation for building 3-dimensional measures of association that can then be used by statistic.pl. In particular this module provides methods that give convenient access to 3-d (i.e., trigram) frequency counts as created by count.pl, as well as some degree of error handling that verifies the data.

Basic Usage

use Text::NSP::Measures::3D::MI::ll;

$ll_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);

if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n";
}

The methods in this module retrieve observed trigram frequency counts and marginal totals, and also compute expected values. They also provide support for error checking of the output produced by count.pl. These methods are used in all the trigram (3d) measure modules provided in NSP. If you are writing your own 3d measure, you can use these methods as well.

<<less
Download (0.96MB)
Added: 2006-09-02 License: Perl Artistic License Price:
1147 downloads
Text::NSP::Measures::2D 1.01

Text::NSP::Measures::2D 1.01


Text::NSP::Measures::2D is a Perl module that provides basic framework for building measure of association for bigrams. more>>
Text::NSP::Measures::2D is a Perl module that provides basic framework for building measure of association for bigrams.

SYNOPSIS

Basic Usage
use Text::NSP::Measures::2D::MI::ll;

my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;

$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);

if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}

This module is to be used as a foundation for building 2-dimensional measures of association. The methods in this module retrieve observed bigram frequency counts, marginal totals, and also compute expected values. They also provide error checks for these counts.

<<less
Download (0.93MB)
Added: 2006-08-30 License: Perl Artistic License Price:
1150 downloads
Emacs Configuration Framework 0.0.5

Emacs Configuration Framework 0.0.5


Emacs Configuration Framework is a versatile configuration package for Emacs. more>>
Emacs Configuration Framework is a versatile configuration package for Emacs. It is meant for users whose Emacs configuration has become so complex that it appears to be unmanageable.
It enables you to write and load the configuration for individual Emacs packages in pieces. You can use it to setup some autoloads for a package when you start Emacs and then do extra configuration after the package has loaded.
This speeds up your Emacs startup without compromising your ability to do complicated things.
Enhancements:
- This release adds a new rc.d/lang directory.
- Modes added: speedbar, semantic, cedet, and ecb.
<<less
Download (0.032MB)
Added: 2006-10-09 License: GPL (GNU General Public License) Price:
1111 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 5
  • 1
  • 2
  • 3
  • 4
  • 5