Main > Free Download Search >

Free wordnet software for linux

wordnet

Sponsored Links
Sponsored Links
Sort by >> Relevance
rss
Secleted [ 0 ] software to compare
Results 1 - 15 of about 9
WordNet 3.0

WordNet 3.0


WordNet is a lexical database for the English language. more>>
WordNet project is a large lexical database of English, developed under the direction of George A. Miller. Nouns, verbs, adjectives and adverbs are grouped into sets of cognitive synonyms (synsets), each expressing a distinct concept. Synsets are interlinked by means of conceptual-semantic and lexical relations.
The resulting network of meaningfully related words and concepts can be navigated with the browser. WordNet is also freely and publicly available for download. WordNets structure makes it a useful tool for computational linguistics and natural language processing.
Enhancements:
- Major feature enhancements
<<less
Download (10.9MB)
Added: 2007-08-02 License: GPL (GNU General Public License) Price:
836 downloads
WordNet::Similarity 1.04

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.

<<less
Download (0.63MB)
Added: 2007-02-28 License: Perl Artistic License Price:
968 downloads
FrameNet::WordNet::Detour 0.99c

FrameNet::WordNet::Detour 0.99c


FrameNet::WordNet::Detour is a WordNet to FrameNet Detour. more>>
FrameNet::WordNet::Detour is a WordNet to FrameNet Detour.

SYNOPSIS

use FrameNet::WordNet::Detour;

# Creation without parameters, $WNHOME and $FNHOME will be used
my $detour = FrameNet::WordNet::Detour->new;

# Creation with some parameters
my $detour2 = FrameNet::WordNet::Detour->new(-wnhome => /path/to/WordNet,
-fnhome => /path/to/FrameNet
-cached => 1,
-limited => undef);

my $result = $detour->query("walk#v#1");

if ($result->is_ok) {
print "Best frames: n";
print join( , @{$result->get_best_framenames})."n";

print "All frames: n";
print join( , @{$result->get_all_framenames})."n";

print "All frames with weights: n";
foreach my $frame (@{$result->get_all_frames}) {
print $frame->name.": ";
print $frame->get_weight."n";
}
} else {
print $result->message."n";
}

<<less
Download (0.015MB)
Added: 2007-04-03 License: Perl Artistic License Price:
939 downloads
WordNet::Similarity::Visual 0.07

WordNet::Similarity::Visual 0.07


WordNet::Similarity::Visual is a Perl extension for providing visualization tools for WordNet::Similarity. more>>
WordNet::Similarity::Visual is a Perl extension for providing visualization tools for WordNet::Similarity.

SYNOPSIS

Basic Usage Example

use WordNet::Similarity::Visual;

$gui = WordNet::Similarity::Visual->new;

$gui->initialize;

This package provides a graphical extension for WordNet::Similarity. It provides a gui for WordNet::Similarity and visualization tools for the various edge counting measures like path, wup, lch and hso.

<<less
Download (0.019MB)
Added: 2007-04-07 License: Perl Artistic License Price:
560 downloads
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
WordNet::Similarity::PathFinder 1.04

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.

<<less
Download (0.63MB)
Added: 2007-08-01 License: Perl Artistic License Price:
817 downloads
WordNet::Similarity::vector_pairs 1.04

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
Knorpora 1.0

Knorpora 1.0


Knorpora is a modified version of the Knoppix 3.3 Live CD for students of corpus-based computational linguistics. more>>
Knorpora is a modified version of the Knoppix 3.3 Live CD for students of corpus-based computational linguistics.

Like Knoppix, the Knorpora CD allows you to run a fully operational Debian/Linux operating system from the CD-ROM drive, without installing anything on the computer.

The Knorpora edition of Knoppix contains programs and data files that should be of interest to computational linguistics students (WordNet, the Natural Language Toolkit, taggers, etc.)

When you launch Knorpora on your computer, you can immediately start learning how to use a UNIX-like operating system while at the same time experimenting with the kind of UNIX-command-line-based NLP tools that make UNIX the ideal operating system for NLP work.

Even if you already work with UNIX, Knorpora may give you the chance to try some interesting software before you install it.

I tested Knorpora only superficially, and there will definitely be all kinds of problems.

If you experience problems with Knorpora, you can contact me (baroni AT sslmit unibo it), and I will try to help.

However, if you have problems with a specific tool, you are probably better off contacting the authors of the tool, or posting to the relevant list, and if you have general problems with the CD or the operating system, you are probably better off posting to a list where Knoppix and Linux issues are discussed.

I would like to hear from you about your Knorpora experience, suggestions for future releases, etc.

I optimistically named this release Knorpora 1.0, but I am not going to be able to release up-to-date versions on a regular basis.
<<less
Download (676.4MB)
Added: 2005-09-01 License: GPL (GNU General Public License) Price:
1513 downloads
Natural Language Toolkit 0.8

Natural Language Toolkit 0.8


Natural Language Toolkit is a suite of Python libraries and programs for symbolic and statistical natural language processing. more>>
Natural Language Toolkit is a suite of Python libraries and programs for symbolic and statistical natural language processing. NLTK includes graphical demonstrations and sample data.
It is accompanied by extensive documentation, including tutorials that explain the underlying concepts behind the language processing tasks supported by the toolkit.
Documentation:
A substantial amount of documentation about how to use NLTK is available from the nltk home page:
< http://nltk.sourceforge.net >
In particular, the NLTK home page contains three types of documentation:
- Tutorials teach students how to use the toolkit, in the context of performing specific tasks. They are appropriate for anyone who wishes to learn how to use the toolkit.
< http://nltk.sourceforge.net/tutorial/ >
- The toolkits reference documentation describes every module, interface, class, method, function, and variable in the toolkit. This documentation should be useful to both users and developers.
< http://nltk.sourceforge.net/ref/nltk.html >
- A number of technical reports are available. These reports explain and justify the toolkits design and implementation. They are used by the developers of the toolkit to guide and document the toolkits construction. Students can consult these reports if they would like further information about how the toolkit is designed and why it is designed that way.
< http://nltk.sourceforge.net/tech/ >
Enhancements:
Code (major):
- changed package name to nltk
- import all top-level modules into nltk, reducing need for import statements
- reorganization of sub-package structures to simplify imports
- new featstruct module, unifying old featurelite and featurestructure modules
- FreqDist now inherits from dict, fd.count(sample) becomes fd[sample]
- FreqDist initializer permits: fd = FreqDist(len(token) for token in text)
- made numpy optional
Code (minor):
- changed GrammarFile initializer to accept filename
- consistent tree display format
- fixed loading process for WordNet and TIMIT that prevented code installation if data not installed
- taken more care with unicode types
- incorporated pcfg code into cfg module
- moved cfg, tree, featstruct to top level
- new filebroker module to make handling of example grammar files more transparent
- more corpus readers (webtext, abc)
- added cfg.covers() to check that a grammar covers a sentence
- simple text-based wordnet browser
- known bug: parse/featurechart.py uses incorrect apply() function
Corpora:
- csv data file to document NLTK corpora
Contrib:
- added Glue semantics code (contrib.glue, by Dan Garrette)
- Punkt sentence segmenter port (contrib.punkt, by Willy)
- added LPath interpreter (contrib.lpath, by Haejoong Lee)
- extensive work on classifiers (contrib.classifier*, Sumukh Ghodke)
Tutorials:
- polishing on parts I, II
- more illustrations, data plots, summaries, exercises
- continuing to make prose more accessible to non-linguistic audience
- new default import that all chapters presume: from nltk.book import *
Distributions:
- updated to latest version of numpy
- removed WordNet installation instructions as WordNet is now included in corpus distribution
- added pylab (matplotlib)
Enhancements:
Code:
- changed nltk.__init__ imports to explicitly import names from top-level modules
- changed corpus.util to use the rb flag for opening files, to fix problems reading corpora under MSWindows
- updated stale examples in engineering.txt
- extended feature stucture interface to permit chained features, e.g. fs[F,G]
- further misc improvements to test code plus some bugfixes
Tutorials:
- rewritten opening section of tagging chapter
- reorganized some exercises
<<less
Download (MB)
Added: 2007-07-03 License: GPL (GNU General Public License) Price:
850 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 1
  • 1