Regular Expressions 101

Pro

\ban ASCII word boundary

Positive Lookahead(?=\w{4,}\D)

\w{4,}any word character, repeated at least 4 times

\Dany character that's not a digit

Group 1(beautifÃ¼l tree|[Ã¤Ã¶Ã¼Ã„Ã–ÃœÃŸ\w]+.*?)

1st AlternativebeautifÃ¼l tree

beautifÃ¼l treethe literal text beautifÃ¼l tree (case insensitive)

2nd Alternative[Ã¤Ã¶Ã¼Ã„Ã–ÃœÃŸ\w]+.*?

Character Class[Ã¤Ã¶Ã¼Ã„Ã–ÃœÃŸ\w]+

+matches at least one character from the set below:

Ãthe literal Ã (195₁₀ / 303₈ / C3₁₆) (case insensitive)

¤the literal ¤ (164₁₀ / 244₈ / A4₁₆)

¶the literal ¶ (182₁₀ / 266₈ / B6₁₆)

¼the literal ¼ (188₁₀ / 274₈ / BC₁₆)

„the literal „ (8222₁₀ / 20036₈ / 201E₁₆)

–the literal – (8211₁₀ / 20023₈ / 2013₁₆)

œthe literal œ (339₁₀ / 523₈ / 153₁₆) (case insensitive)

Ÿthe literal Ÿ (376₁₀ / 570₈ / 178₁₆) (case insensitive)

\wany word character

.*?any character (except for line terminators), repeated any number of times

\ban ASCII word boundary

Global pattern flags

g modifier: global. Finds all matches instead of stopping after the first

i modifier: insensitive. Matches without distinguishing uppercase and lowercase letters

No unit tests · Add a test to get started

25 tokens

\b(?=\w{4,}\D)(beautifÃ¼l tree|[Ã¤Ã¶Ã¼Ã„Ã–ÃœÃŸ\w]+.*?)\b

There are no unit tests, click to add some.