You lost me. Please explain in smaller steps. What I understand is instead of five strings
Code:
string1 string2 string3 string4 string5
hai wafam cherol makha palli
and dropping the third you'll have "sentences" consisting of between 9 and 12 strings, of which none should be dropped for the comparison, and you want to compare 1 to 5, if no match then 2 to 6, and, if either matches, compare 6 to 10. What if there's only 9 strings in a sentence? If there's more, what to do with string11 and 12?
And, what to print for either match?
I have a text file with following content (3 lines)
filename : output.txt
first line:12/12/2008
second line:12/12/2008
third line:Y
I would like to know how we can replace 'Y' with 'N' in the 3rd line keeping 1st and 2nd lines same as what it was before.
I tried using cat output.txt... (4 Replies)
Hi,
Please let me know how to find text and print text and its previous line. Please don't get irritated few days back I asked text and next line. I am using HP-UX 11.11
Thanks for your help. (6 Replies)
Hello friends!
Help me pls to write correct awk and grep statements for my task:
I have got files with name filename.txt
It has such structure:
Start of file
FROM: address@domen.com (12...890) abc
DATE: 11/23/2009 on Std
SUBJECT: any subject
End of file
So, I must check,
if this file... (4 Replies)
Hi,
I have the follwoing text file :
db1;unrecoverable;0;20110728162548
db1;unrefreshed;1,NO_MV_VIEWS;20110728162548
xe1;Database;1;20110728162548
xe1;autoextensible;0;20110511112053
xe1;chk_offline_dbf;0;20110511112053
xe1;expiry_date;0;20110511112053
xe1;job;4;20110420111823... (2 Replies)
Hello all,
after spending hours of searching the web I decided to create an account here. This is my first post and I hope one of the experts can help.
I need to resolve a grep / sed / xargs / awk problem.
My input file is just like this:
----------------------------------... (6 Replies)
I need to search a string for some specific text which is no big deal using grep. My problem is when the search fails to find the text. I need to add text like "na" when my search does not match.
I have tried this command but it does not work when I put the command in a loop in a bash script:
... (12 Replies)
I hope this makes sense and is possible.
I am trying to match $1 of panel_genes.txt with $3 of RefSeqGene.txt and when a match is found the value in $6 of RefSeqGene.txt
Example: ACTA2 is $1 of panel_genes.txt
ACTA2 NM_001613.2
ACTA2 NM_001141945.1
awk 'FNR==NR {... (4 Replies)
Hi guys,
I have a text file named file1.txt that is formatted like this:
001 , ID , 20000
002 , Name , Brandon
003 , Phone_Number , 616-234-1999
004 , SSNumber , 234-23-234
005 , Model , Toyota
007 , Engine ,V8
008 , GPS , OFF
and I have file2.txt formatted like this:
... (2 Replies)
hi all,
trying this using shell/bash with sed/awk/grep
I have two files, one containing one column, the other containing multiple columns (comma delimited).
file1.txt
abc12345
def12345
ghi54321
...
file2.txt
abc1,text1,texta
abc,text2,textb
def123,text3,textc
gh,text4,textd... (6 Replies)
Discussion started by: shogun1970
6 Replies
LEARN ABOUT CENTOS
string::similarity
Similarity(3) User Contributed Perl Documentation Similarity(3)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 specifing 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.16.3 2008-11-04 Similarity(3)