Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7077333
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T06:24:38+00:00 2026-05-28T06:24:38+00:00

I am interested in finding 7 words in a string. These should appear in

  • 0

I am interested in finding 7 words in a string.
These should appear in order separated by space.

Assuming that String regex has a string with the 7 words, I was interested if a match did not occur to reduce to 6,5,4 etc words.

A first regex I thought was:
\\b(?:word1(\\s+)word2(\\s+)word3(\\s+)word4(\\s+)word5(\\s+)word6(\\s+)word7)\\b

  1. The above would occur by using a StringBuffer and after
    splitting the variable regex by space, I would construct the
    regular expression by append.
  2. If I got no match I would loop again contructing the expression up
    to word6 etc and further reducing to word5 etc until I hit a match.

I am not sure I really like this approach.Can I improve it or do it in a more efficient way?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T06:24:38+00:00Added an answer on May 28, 2026 at 6:24 am

    the greedy (default) will do what you want

    \\b(?:word1(?:(\\s+)word2(?:(\\s+)(?:word3(\\s+)(?:word4(\\s+)(?:word5(\\s+)(?:word6(?:(\\s+)word7)?)?)?)?)?)?)?)\\b
    

    this will first attempt to match everything and then leave off word7 then leave off word6 …

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm interested in finding out why this is used on some Web sites for
I'm interested in finding out how to interface a .NET app (or even just
I'm interested in finding the most precise decimal values in a database field. I'd
I'm interested in finding out more about the Microsoft Office Communicator IM client, and
Following on from this question , I am interested in finding out how you
Interested if anyone has used VSTS Database Edition extensively and, if so, which features
Please help me in finding the optimized solutions to these interesting data structure questions:
I have an algorithm that searches through all of my sites users, finding those
I am interested in finding a more efficient way of selecting the proper select
I'm interested in finding the most elegant and 'correct' solution to this problem. I'm

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.