Tool (Advanced) to search and find dictionary words matching regular expressions. Simplify your searches for words with complex criteria thanks to the search by Regex (Regexp).
Regex Word Search - dCode
Tag(s) : Word Search
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Regex Word Search
Search Word with Regular Expression
Answers to Questions (FAQ)
What is a word search with a regular expression? (Definition)
The search for words by regular expression (or regex) is a powerful word search method capable of going through an entire dictionary, and of checking if these correspond to the set accepted by the regex.
A regular expression is a tool that describes from a pattern (a character string written according to a precise syntax) a whole set of possible character strings/word.
It is then possible to search for words with complex criteria (length, pattern, repetition, etc.). Knowledge of the syntax of regular expressions (regexp) is mandatory.
How to find a word with a regular expression?
Regular expression word search allows complex patterns to be searched in the dictionary, providing great flexibility in specifying search criterion/criteria.
dCode allows you to search the exhaustive list of words corresponding to a regular expression in a given dictionary.
The user creates a regular expression that describes the pattern of words they want to search for and clicks the Search button.
Example: To find a word of 4 letters starting with R or T and ending with its initial letter: ^([RT])..\1$
Example: To find a word with four consecutive vowels: [AEIOUY]{4}
How to write a regular expression?
To write a regular expression, the user must understand the special characters and the associated rules. Here are some basics:
. : Matches any letter.
*: Matches zero or more occurrences of the previous character.
+: Matches one or more occurrences of the previous character.
? : Matches zero or one occurrence of the previous character.
[·]: Matches any of the letters written between the brackets (instead of ·).
[^·]: Matches none of the letters written between the brackets (instead of ·).
^···: Indicates the beginning of a word
···$: Indicates an end of word
dCode uses the PCRE (Perl Compatible Regular Expressions) engine and follows its rules described here
See Wikipedia for more details here
dCode is case insensitive, ignores diacritics and modifiers
Source code
dCode retains ownership of the "Regex Word Search" source code. Any algorithm for the "Regex Word Search" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Regex Word Search" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Regex Word Search" or any other element are not public (except explicit open source licence). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
Cite dCode
The content of the page "Regex Word Search" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Regex Word Search on dCode.fr [online website], retrieved on 2025-07-15,
