Regex

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Sendmail K command regex: adding exclusion/negative lookahead to regex -a@MATCH

I'm trying to get some exclusions into our sendmail regular expression for the K command. The following configuration & regex works: LOCAL_CONFIG # Kcheckaddress regex -a@MATCH +<@+?\.++?\.(us|info|to|br|bid|cn|ru) LOCAL_RULESETS SLocal_check_mail # check address against various regex...

2. UNIX for Beginners Questions & Answers

Using Regex

Here i am writing a script to check&display only the valid mail address from a file echo "Plz enter the Target file name with path" read path if then echo "The valid mail address are:" email=$(grep -E -o "\b+@+\.{2,6}\b" $path ) echo "$email" fi The file contains the data like this:...

3. Shell Programming and Scripting

Perl, RegEx - Help me to understand the regex!

I am not a big expert in regex and have just little understanding of that language. Could you help me to understand the regular Perl expression: ^(?!if\b|else\b|while\b|)(?:+?\s+){1,6}(+\s*)$*$ *?(?:^*;?+){0,10}\{ ------ This is regex to select functions from a C/C++ source and defined in...

4. UNIX for Dummies Questions & Answers

read regex from ID file, print regex and line below from source file

I have a file of protein sequences with headers (my source file). Based on a list of IDs (which are included in some of the headers), I'd like to print out only the specified sequences, with only the ID as header. In other words, I'd like to search source.txt for the terms in IDs.txt, and print...

5. Shell Programming and Scripting

Regex for First and Last name

I have a regex I'd like to implement and I believe it should be working and I have tested it on various websites that have regex testers but it always says the name is invalid. #!/bin/bash -x echo Enter the users first and last name. read name if...

6. UNIX for Advanced & Expert Users

Vi Regex help

Can someone tell me what is going with this expression :%s/<C-V><C-M>/. Is there a way to get a more useful message if the carriage return has been deleted? http://objectmix.com/editors/149245-fixing-dos-line-endings-within-vim.html#post516826 Why does this expression work for...

7. Shell Programming and Scripting

Converting perl regex to sed regex

I am having trouble parsing rpm filenames in a shell script.. I found a snippet of perl code that will perform the task but I really don't have time to rewrite the entire script in perl. I cannot for the life of me convert this code into something sed-friendly: if ($rpm =~ /(*)-(*)-(*)\.(.*)/)...

8. Shell Programming and Scripting

regex help

I would like to search strings composed by only one type of charachter for example only strings composed by the charachter 'b' is it right? $egrep '\<(b+)+\>' filename Could be there some side effects? Regards.

9. UNIX for Dummies Questions & Answers

regex

Can anyone give the detailed explanation on regex search i want to know the use of regex in sed and awk also...... the operators like ^,.,* ....etc i need it with some example.....kindly help on this. I gone through the man pages also..but i was not clear.........

10. Shell Programming and Scripting

Need a regex

Hi, I am trying to grep for the following type of string from a document given below: 12637 1239 3356 12956 7004 7004 7004 13381 13381 *> 12.0.1.63 0 7018 21872 ? * 208.51.134.254 53 0 3549 7018 21872 ?...

LEARN ABOUT PHP

levenshtein

LEVENSHTEIN(3)								 1							    LEVENSHTEIN(3)

levenshtein - Calculate Levenshtein distance between two strings

SYNOPSIS

       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)

Shell Programming and Scripting