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

  • SEARCH
  • Home
  • 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 5983525
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T22:14:37+00:00 2026-05-22T22:14:37+00:00

I would like to know how to match a string against an array of

  • 0

I would like to know how to match a string against an array of regular expressions.
I know how to do this looping through the array.
I also know how to do this by making a long regular expression separated by |
I was hoping for a more efficient way like

if (string contains one of the values in array) {

For example:

string = "the word tree is in this sentence";  
array[0] = "dog";  
array[1] = "cat";  
array[2] = "bird";  
array[3] = "birds can fly";  

In the above example, the condition would be false.
However, string = "She told me birds can fly and I agreed" would return true.

  • 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-22T22:14:37+00:00Added an answer on May 22, 2026 at 10:14 pm

    How about creating a regular expression on the fly when you need it (assuming the array changes over time)

    if( (new RegExp( '\\b' + array.join('\\b|\\b') + '\\b') ).test(string) ) {
      alert('match');
    }
    

    demo:

    string = "the word tree is in this sentence"; 
    var array = [];
    array[0] = "dog";  
    array[1] = "cat";  
    array[2] = "bird";  
    array[3] = "birds can fly";  
    
    if( (new RegExp( '\\b' + array.join('\\b|\\b') + '\\b') ).test(string) ){
        alert('match');
    }
    else{
        alert('no match');
    }

    For browsers that support javascript version 1.6 you can use the some() method

    if ( array.some(function(item){return (new RegExp('\\b'+item+'\\b')).test(string);}) ) {
     alert('match');
    }
    

    demo:

    string = "the word tree is in this sentence"; 
    var array = [];
    array[0] = "dog";  
    array[1] = "tree";  
    array[2] = "bird";  
    array[3] = "birds can fly";  
    
    if ( array.some(function(i){return (new RegExp('\\b'+i+'\\b')).test(string);}) ) {
     alert('match');
    }
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I would like to use a Perl regular expression to match strings like this:
Iceland :Country\nEurope::Continent\nReykjavik:City with the above string, i would like to match words that appear
I would like to know if anyone know a good algorithm to match 2
I would like to know after much searching how I would match different variations
I have a pipe delimited string like this: blah|blah|blah|blah|blah|blah|blah|blah|blah|oldDate|blah|blah| I would like replace the
i would like know some reference. I know i can googling it. but prefer
Would like to know what a programmer should know to become a good at
Would like to know the c# code to actually retrieve the IP type: Static
I would like to know if I can open 2 different diagrams using MS
I would like to know which dependency described in my pom.xml brings a transitive

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.