Hi,
Suppose I have the following text in a file.
ORA-00942: table or view does not exist
ORA-01555: snapshot too old: rollback segment number string with name "string"
too small
Is there any way I can list all the text that starts only with 'ORA-'?
Or there any grep command that can... (7 Replies)
Hi,
I have a file with rows of text like so :
E100005568374098100000015667
D100005568374032000000112682
H100005228374060800000002430
I need to grab just the last digits(bolded) of each line without the proceeding text/numbers.
Thanks (5 Replies)
Hi,
i am just gettin exposed to UNIX.
Could anyone of u help me out with dis problem..?
i have a variable 'act' which has the value as follows,
echo $act gives -0- -0- -----0---- 2008-06-04 -0- -0-
echo "$act" | awk '{print ($act)}'
gives,
-0-
-0-
-----0----
2008-06-04
-0-
-0-
I... (2 Replies)
i have a file that contains a pattern like this:
ajay 1234 newyork available
kumar 2345 denver
singh 2345 newyork
ajay 3456 denver
kumar 3456 newyork
singh 3456 delhi available
ajay 4567 miami
kumar 4567 miami
singh 4567 delhi
i want to search for each line... (5 Replies)
First of all I am VERY new to this so bare with me and try and explain everything even if it seems simple.
Basically I want to read a line of text from a html file. See if the line of text has a certain string in it. copy an unknown number of characters (the last 4 characters wiil be ".jpg" the... (1 Reply)
Hi,
I have a file in the following format
123|shanwer|15DEC2010|bgbh|okok|16JAN3000|okok|
I want the following to be in following format
123|shanwer|12\15\2010|bgbh|okok|01\16\3000|okok|
SED/PERL/AWK Gurus
could you please help me with this?
Thanks
Shankar (8 Replies)
Hi All,
Pls help me out on the below,
05 LAMSZ201-ZM-MEMO2-DATE02-5 PIC X(10).
05 LAMSZ201-ZM-MEMO2-AMT02-5 PIC S9(13)V99.
05 LAMSZ201-ZM-MEMO2-TYPE02-6 PIC XXX.
05 LAMSZ201-ZM-MEMO2-DATE02-6 PIC X(10).
05 ... (2 Replies)
Hello
Could you help with small script:
How to split string X1 into 3 string
String X1 can have 1 or many strings
X1='A1:B1:C1:D1:A2:B2:C2:D2:A3:B3:C3:D3'
This is output which I want to have:
Z1='A1:B1:C1:D1'
Z2='A2:B2:C2:D2'
Z3='A3:B3:C3:D3' (5 Replies)
i have something like this...
echo "teCertificateId" | awk -F'Id' '{ print $1 }' | awk -F'te' '{ print $2 }'
Certifica
the awk should remove 'te' only if it is present at the start of the string.. anywhere else it should ignore it.
expected output is
Certificate (7 Replies)
I'm making a little game in Perl, and I am trying to remove the first instance of a character in an arbitrary string. For example, if the string is
"cupcakes"and the user enters another string that contains letters from "cupcake" e.g:
"sake"the original string will now look like this (below)... (3 Replies)
Discussion started by: whyte_rhyno
3 Replies
LEARN ABOUT PHP
levenshtein
LEVENSHTEIN(3) 1 LEVENSHTEIN(3)levenshtein - Calculate Levenshtein distance between two stringsSYNOPSIS
int levenshtein (string $str1, string $str2)
DESCRIPTION
int levenshtein (string $str1, string $str2, int $cost_ins, int $cost_rep, int $cost_del)
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform $str1 into
$str2. The complexity of the algorithm is O(m*n), where n and m are the length of $str1 and $str2 (rather good when compared to simi-
lar_text(3), which is O(max(n,m)**3), but still expensive).
In its simplest form the function will take only the two strings as parameter and will calculate just the number of insert, replace and
delete operations needed to transform $str1 into $str2.
A second variant will take three additional parameters that define the cost of insert, replace and delete operations. This is more general
and adaptive than variant one, but not as efficient.
PARAMETERS
o $str1
- One of the strings being evaluated for Levenshtein distance.
o $str2
- One of the strings being evaluated for Levenshtein distance.
o $cost_ins
- Defines the cost of insertion.
o $cost_rep
- Defines the cost of replacement.
o $cost_del
- Defines the cost of deletion.
RETURN VALUES
This function returns the Levenshtein-Distance between the two argument strings or -1, if one of the argument strings is longer than the
limit of 255 characters.
EXAMPLES
Example #1
levenshtein(3) example
<?php
// input misspelled word
$input = 'carrrot';
// array of words to check against
$words = array('apple','pineapple','banana','orange',
'radish','carrot','pea','bean','potato');
// no shortest distance found, yet
$shortest = -1;
// loop through words to find the closest
foreach ($words as $word) {
// calculate the distance between the input word,
// and the current word
$lev = levenshtein($input, $word);
// check for an exact match
if ($lev == 0) {
// closest word is this one (exact match)
$closest = $word;
$shortest = 0;
// break out of the loop; we've found an exact match
break;
}
// if this distance is less than the next found shortest
// distance, OR if a next shortest word has not yet been found
if ($lev <= $shortest || $shortest < 0) {
// set the closest match, and shortest distance
$closest = $word;
$shortest = $lev;
}
}
echo "Input word: $input
";
if ($shortest == 0) {
echo "Exact match found: $closest
";
} else {
echo "Did you mean: $closest?
";
}
?>
The above example will output:
Input word: carrrot
Did you mean: carrot?
SEE ALSO soundex(3), similar_text(3), metaphone(3).
PHP Documentation Group LEVENSHTEIN(3)