Update: 2023-10-31
Regular expressions, commonly abbreviated as regex, form a language for string matching, enabling operations to search, match, and manipulate text based on specific patterns or rules.
Online Interpreter: Regular Expressions 101
Regex provides metacharacters with specific meanings, making it convenient to define patterns:
.
: any single character except a newline character.
[ ]
: a character set matching any character within the brackets.
\d
: any digit, equivalent to [0-9]
.
\D
: any character that is not a digit, equivalent to [^0-9]
.
\s
: any whitespace character, equivalent to [ \t\n\r\f\v]
.
\S
: any character that is not a whitespace character, equivalent to [^ \t\n\r\f\v]
.
\w
: any word character (alphanumeric or underscore), equivalent to [A-Za-z0-9_]
.
\W
: any character that is not a word character, equivalent to [^A-Za-z0-9_]
.
\b
: a word boundary matching the position between a word character and a non-word character.
Examples:
M.\.
matches "Mr." and "Ms.", but not "Mrs." (\
escapes the metacharacter .
).
[aeiou]
matches any vowel.
\d\d\d
searches for "170" in "CS170".
\D\D
searches for "kg" in "100kg".
\s
searches for the space " " in "Hello World".
\S
searches for "H" in " Hello".
\w\w
searches for "1K" in "$1K".
\W
searches for "!" in "Hello!".
\bis\b
matches "is", but does not match "island" nor searches for "is" in "basis".
The terms "match" and "search" in the above examples have different meanings. "match" means that the pattern must be found at the beginning of the text, while "search" means that the pattern can be located anywhere in the text. We will discuss these two functions in more detail in the latter section.
Repetitions allow you to define complex patterns that can match multiple occurrences of a character or group of characters:
*
: the preceding character or group appears zero or more times.
+
: the preceding character or group appears one or more times.
?
: the preceding character or group appears zero or once, making it optional.
{m}
: the preceding character or group appears exactly m
times.
{m,n}
: the preceding character or group appears at least m
times but no more than n
times.
{m,}
: the preceding character or group appears at least m
times or more.
By default, matches are "greedy" such that patterns match as many characters as possible.
Matches become "lazy" by adding ?
after the repetition metacharacters, in which case, patterns match as few characters as possible.
Examples:
\d*
matches "90" in "90s" as well as "" (empty string) in "ABC".
\d+
matches "90" in "90s", but no match in "ABC".
https?
matches both "http" and "https".
\d{3}
is equivalent to \d\d\d
.
\d{2,4}
matches "12", "123", "1234", but not "1" or "12345".
\d{2,}
matches "12", "123", "1234", and "12345", but not "1".
<.+>
matches the entire string of "<Hello> and <World>".
<.+?>
matches "<Hello>" in "<Hello> and <World>", and searches for "<World>" in the text.
Grouping allows you to treat multiple characters, subpatterns, or metacharacters as a single unit. It is achieved by placing these characters within parentheses (
and )
.
|
: a logical OR, referred to as a "pipe" symbol, allowing you to specify alternatives.
( )
: a capturing group; any text that matches the parenthesized pattern is "captured" and can be extracted or used in various ways.
(?: )
: a non-capturing group; any text that matches the parenthesized pattern, while indeed matched, is not "captured" and thus cannot be extracted or used in other ways.
\num
: a backreference that refers back to the most recently matched text by the num
'th capturing group within the same regex.
You can nest groups within other groups to create more complex patterns.
Examples:
(cat|dog)
matches either "cat" or "dog".
(\w+)@(\w+.\w+)
has two capturing groups, (\w+)
and (\w+.\w+)
, and matches email addresses such as "john@emory.edu" where the first and second groups capture "john" and "emory.edu", respectively.
(?:\w+)@(\w+.\w+)
has one non-capturing group (?:\w+)
and one capturing group (\w+.\w+)
. It still matches "john@emory.edu" but only captures "emory.edu", not "john".
(\w+) (\w+) - (\2), (\1)
has four capturing groups, where the third and fourth groups refer to the second and first groups, respectively. It matches "Jinho Choi - Choi, Jinho" where the first and fourth groups capture "Jinho" and the second and third groups capture "Choi".
(\w+.(edu|org))
has two capturing groups, where the second group is nested in the first group. It matches "emory.edu" or "emorynlp.org", where the first group captures the entire texts while the second group captures "edu" or "org", respectively.
Assertions define conditions that must be met for a match to occur. They do not consume characters in the input text but specify the position where a match should happen based on specific criteria.
A positive lookahead assertion (?= )
checks that a specific pattern is present immediately after the current position.
A negative lookahead assertion (?! )
checks that a specific pattern is not present immediately after the current position.
A positive look-behind assertion (?<= )
checks that a specific pattern is present immediately before the current position.
A negative look-behind assertion (?<! )
checks that a specific pattern is not present immediately before the current position.
^
asserts that the pattern following the caret must match at the beginning of the text.
$
asserts that the pattern preceding the dollar sign must match at the end of the text.
Examples:
apple(?=[ -]pie)
matches "apple" in "apple pie" or "apple-pie", but not in "apple juice".
do(?!(?: not|n't))
matches "do" in "do it" or "doing", but not in "do not" or "don't".
(?<=\$)\d+
matches "100" in "$100", but not in "100 dollars".
(?<!not )(happy|sad)
searches for "happy" in "I'm happy", but does not search for "sad" in "I'm not sad".
not
searches for "not" in "note" and "cannot", whereas ^not
matches "not" in "note" but not in "cannot".
not$
searches for "not" in "cannot" but not in "note".
Python provides several functions to make use of regular expressions.
Let us create a regular expression that matches "Mr." and "Ms.":
L1:
L3: Create a regular expression re_mr
(compile()). Note that a string indicated by an r
prefix is considered a regular expression in Python.
r'M'
matches the letter "M".
r'[rs]'
matches either "r" or "s".
r'\.
' matches a period (dot).
L4: Try to match re_mr
at the beginning of the string "Mr. Wayne" (match()).
L6: Print the value of m
. If matched, it prints the match object information; otherwise, m
is None
; thus, it prints "None".
Currently, no group has been specified for re_mr
:
L1: groups()
Let us capture the letters and the period as separate groups:
L1: The pattern re_mr
is looking for the following:
1st group: "M" followed by either "r" or 's'.
2nd group: a period (".")
L2: Match re_mr
with the input string "Ms".
L5: Print the entire matched string (group()).
L6: Print a tuple of all captured groups (groups()).
L7: Print specific groups by specifying their indexes. Group 0 is the entire match, group 1 is the first capture group, and group 2 is the second capture group.
If the pattern does not find a match, it returns None
.
Let us match the following strings with re_mr
:
s1
matches "Mr." but not "Ms." while s2
does not match any pattern. It is because the match()
function matches patterns only at the beginning of the string. To match patterns anywhere in the string, we need to use search()
instead:
The search()
function matches "Mr." in both s1
and s2
but still does not match "Ms.". To match them all, we need to use the findall()
function:
While the findall()
function matches all occurrences of the pattern, it does not provide a way to locate the positions of the matched results in the string. To find the locations of the matched results, we need to use the finditer()
function:
Finally, you can replace the matched results with another string by using the sub()
function:
Finally, let us write a simple tokenizer using regular expressions. We will define a regular expression that matches the necessary patterns for tokenization:
L2: Create a regular expression to match delimiters and a special case:
Delimiters: ','
, '.'
, or whitespaces ('\s+'
).
The special case: 'n't'
(e.g., "can't").
L3: Create an empty list tokens
to store the resulting tokens, and initialize prev_idx
to keep track of the previous token's end position.
L5: Iterate over matches in text
using the regular expression pattern.
L6: Extract the substring between the previous token's end and the current match's start, strip any leading or trailing whitespace, and assign it to t
.
L7: If t
is not empty (i.e., it is not just whitespace), add it to the tokens
list.
L8: Extract the matched token from the match object strip any leading or trailing whitespace, and assign it to t
.
L10: If t
is not empty (i.e., the pattern is matched):
L11-12: Check if the previous token in tokens
is "Mr" or "Ms" and the current token is a period ("."), in which case, combine them into a single token.
L13-14: Otherwise, add t
to tokens
.
L18-19: After the loop, there might be some text left after the last token. Extract it, strip any leading or trailing whitespace, and add it to tokens
.
Test cases for the tokenizer:
Source: regular_expressions.py
Regular Expression, Kuchling, HOWTOs in Python Documentation.*