./textproc/ruby-levenshtein, Calculates the Levenshtein distance between two byte strings

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 0.2.2, Package name: ruby23-levenshtein-0.2.2, Maintainer: pkgsrc-users

The Levenshtein distance is a metric for measuring the amount
of difference between two sequences (i.e., the so called edit
distance). The Levenshtein distance between two sequences is
given by the minimum number of operations needed to transform
one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.

The two sequences can be two strings, two arrays, or two other
objects responding to :each. All sequences are by generic
(fast) C code.

All objects in the sequences should respond to :hash and :eql?.

More information about the Levenshtein distance algorithm:
http://en.wikipedia.org/wiki/Levenshtein_distance .


Required to run:
[lang/ruby23-base]

Master sites:

SHA1: 7408d9adc53cba7ad4b37dd82026a9b8fabb49de
RMD160: e75ce89b5692a0853d93eb94a6dd20242e4dec07
Filesize: 7.5 KB

Version history: (Expand)


CVS history: (Expand)


   2015-11-04 03:00:17 by Alistair G. Crooks | Files touched by this commit (797)
Log message:
Add SHA512 digests for distfiles for textproc category

Problems found locating distfiles:
	Package cabocha: missing distfile cabocha-0.68.tar.bz2
	Package convertlit: missing distfile clit18src.zip
	Package php-enchant: missing distfile php-enchant/enchant-1.1.0.tgz

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.
   2015-03-08 16:17:22 by Takahiro Kambe | Files touched by this commit (58) | Package updated
Log message:
Add ${GEM_EXTSDIR}/gem.build_complete for new rubygems and updated ruby.
   2014-03-26 14:30:56 by Takahiro Kambe | Files touched by this commit (1)
Log message:
Add GEM_EXTSDIR support.
Use ${RUBY_DLEXT} instead of "so".
   2013-01-26 11:49:03 by OBATA Akio | Files touched by this commit (4)
Log message:
Import ruby-levenshtein-0.2.2 as textproc/ruby-levenshtein.

The Levenshtein distance is a metric for measuring the amount
of difference between two sequences (i.e., the so called edit
distance). The Levenshtein distance between two sequences is
given by the minimum number of operations needed to transform
one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.

The two sequences can be two strings, two arrays, or two other
objects responding to :each. All sequences are by generic
(fast) C code.

All objects in the sequences should respond to :hash and :eql?.

More information about the Levenshtein distance algorithm:
http://en.wikipedia.org/wiki/Levenshtein_distance .