09-29-2008
What degree of similarity are you looking for? What are your requirements?
- If you are looking for a learning platform, any UNIX will be similar.
- If you are looking for binary compatibility, I think that you may be out of luck.
8 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
hi
i have created a pipe which outputs a list of words such as:
hello
yay
foo
yah
good
goof
and from this i want to find words which only differ by their last letters ie yay/yah and good/goof.
i would only need to print out the first instance of the word.
these words are not... (1 Reply)
Discussion started by: Streetrcr
1 Replies
2. UNIX for Dummies Questions & Answers
Hi,
I am trying to quickly learn Unix because I am going to be using HP-UX soon.
Problem is I can't find download HP-UX.
Does anyone know a Unix OS I can download that is more like HP-UX?
I'm running windows vista at the moment. (3 Replies)
Discussion started by: budz
3 Replies
3. Shell Programming and Scripting
Greetings, I have been trying to merge the following lines:
Sat. May 9 8:00 PM
Sat. May 9 8:00 PM CW
Sat. May 9 8:00 PM CW Cursed
Sat. May 9 9:00 PM
Sat. May 9 9:00 PM CW
Sat. May 9 9:00 PM CW Sanctuary
Sat. May 16 8:00 PM
Sat. May 16 8:00 PM CW
Sat. May 16 8:00 PM CW Sanctuary
Sat. May... (2 Replies)
Discussion started by: adambot
2 Replies
4. Shell Programming and Scripting
i have a file like this:
wedd01A1 1
wedd01A2 2
wedd01A3 1
wedd02A2 3
wedd02A3 4
wadd02A1 1
wadd02A2 5
wqdd01A1 3
wsdd01A3 1
i want out like this:
A1 A2 A3
wedd01 1 2 1
wedd02 0 3 4
wadd02 1 5 0
wqdd01 3 0 0
wsdd01 0 0 1 (8 Replies)
Discussion started by: aydj
8 Replies
5. AIX
Hi
Do you know if there is a similar tool like monit in AIX's packages?
thanks
Regards
Israel. (1 Reply)
Discussion started by: iga3725
1 Replies
6. Homework & Coursework Questions
1. The problem statement, all variables and given/known data:
saferm is a replacement for the rm utility. Rather than removing files, it move files in a sub directoy called".saferm" in the user's home directory. If "~/.saferm" doesn't exist, it is automatically created. The -l options lists the ... (3 Replies)
Discussion started by: Joey12
3 Replies
7. AIX
Hi ,
I want to know is there any command in AIX similar to pkginfo ?
that shows details of all packages installed and we can grep whatever we need to check?
Thanks
Rafi (2 Replies)
Discussion started by: rafi49
2 Replies
8. Shell Programming and Scripting
I'm trying to code a line (ksh) without much success along the lines of :-
If
then
.....etc
fi
I know i could use the case statement but i'm hoping someone may know a one liner or a simple workaround. (8 Replies)
Discussion started by: squrcles
8 Replies
LEARN ABOUT DEBIAN
string::similarity
Similarity(3pm) User Contributed Perl Documentation Similarity(3pm)
NAME
String::Similarity - calculate the similarity of two strings
SYNOPSIS
use String::Similarity;
$similarity = similarity $string1, $string2;
$similarity = similarity $string1, $string2, $limit;
DESCRIPTION
$factor = similarity $string1, $string2, [$limit]
The "similarity"-function calculates the similarity index of its two arguments. A value of 0 means that the strings are entirely
different. A value of 1 means that the strings are identical. Everything else lies between 0 and 1 and describes the amount of
similarity between the strings.
It roughly works by looking at the smallest number of edits to change one string into the other.
You can add an optional argument $limit (default 0) that gives the minimum similarity the two strings must satisfy. "similarity" stops
analyzing the string as soon as the result drops below the given limit, in which case the result will be invalid but lower than the
given $limit. You can use this to speed up the common case of searching for the most similar string from a set by specifying the
maximum similarity found so far.
SEE ALSO
The basic algorithm is described in:
"An O(ND) Difference Algorithm and its Variations", Eugene Myers,
Algorithmica Vol. 1 No. 2, 1986, pp. 251-266;
see especially section 4.2, which describes the variation used below.
The basic algorithm was independently discovered as described in:
"Algorithms for Approximate String Matching", E. Ukkonen,
Information and Control Vol. 64, 1985, pp. 100-118.
AUTHOR
Marc Lehmann <schmorp@schmorp.de>
http://home.schmorp.de/
(the underlying fstrcmp function was taken from gnu diffutils and
modified by Peter Miller <pmiller@agso.gov.au> and Marc Lehmann
<schmorp@schmorp.de>).
perl v5.14.2 2012-03-15 Similarity(3pm)