RegEx for matching words only formed with a list of letters

Question

Given a set of words, I need to know which words are formed only by a set of letters. This word can not have more letters than allowed, even if this letter is part of the verification set.

Example:

Char set: a, a, ã, c, e, l, m, m, m, o, o, o, o, t (fixed set)

Words set: mom, ace, to, toooo, ten, all, aaa (variable set)

Result:

mom = true
ace = true
to = true
toooo = true
ten = false (n is not in the set)
all = false (there is only 1 L in the set)
aaa = false (theres is only 2 A in the set)

How to generate this regular expression in Javascript? (Case sensitive is not a problem).

I have tried this code without success:

var str = "ten"
var patt = new RegExp("^[a, a, ã, c, e, l, m, m, m, o, o, o, o, t]*");
console.log(patt.test(str));

This is not a code writing service. Show us what you have come up with till now. And then maybe we can help fix that code — A Rogue Otaku, May 07 '19 at 17:38
You use a character class white matches one of the listed characters which can also be written as `[aãcelmot]` if you don't want to match the comma. Do you have to use a regex? — The fourth bird, May 07 '19 at 17:48
@G.aziz, yes. If there's 5 O this will be tooooo = true, but, toooooo = false. — Eduardo Arruda Pimentel, May 07 '19 at 17:55
I don't think this problem can be solved using Regex. Regex is a finite state machine without memory and as such cannot keep memory of how many times a character was matched in a sequence — Neb, May 07 '19 at 17:55
@Thefourthbird, I don't need to user a regex, but my words set it's big. So I decided to user Regex instead of loops. — Eduardo Arruda Pimentel, May 07 '19 at 17:55
@Neb, my question is quite similar to this: https://stackoverflow.com/questions/22261147/regex-to-limit-the-instance-count-of-any-character-in-a-string The difference, is I have a specific char set. — Eduardo Arruda Pimentel, May 07 '19 at 17:59

Pushpesh Kumar Rajwanshi · Accepted Answer · 2019-05-07T18:17:44.717

Although I feel this task is more suited by writing some code and not using regex. But one approach I can think, that should work is using negative look ahead.

Let's take your character set as the example, that your allowed words can have following letters and not exceeding the amount as they are present in the list.

a, a, ã, c, e, l, m, m, m, o, o, o, o, t

We can write following regex which uses negative lookahead to discard strings which contain more number of characters than allowed as per above set for each character, and finally capture the word using allowed character set from 1 to N number of characters where N is the total number of characters.

^(?!([^a]*a){3})(?!([^ã]*ã){2})(?!([^c]*c){2})(?!([^e]*e){2})(?!([^l]*l){2})(?!([^m]*m){4})(?!([^o]*o){5})(?!([^t]*t){2})[aãcelmot]{1,14}$

Explanation:

^ - Start of string
(?!([^a]*a){3}) - This negative lookahead will reject input if number of a in the string is 3 or more as total number of a in set is only 2.
(?!([^ã]*ã){2}) - Similarly, this negative lookahead will reject input if number of ã in the string is 2 or more as in the set total number of ã is only one.
And so on for all the characters
[aãcelmot]{1,14} - This character set captures allowed characters at least one to max 14, although we can also simply write + as check for max number of allowed characters is already done using negative look ahead.
$ - End of string

JS Code Demo,

const arr = ['mom','ace','to','toooo','ten','all','aaa']

arr.forEach(x => console.log(x + " --> " +/^(?!([^a]*a){3})(?!([^ã]*ã){2})(?!([^c]*c){2})(?!([^e]*e){2})(?!([^l]*l){2})(?!([^m]*m){4})(?!([^o]*o){5})(?!([^t]*t){2})[aãcelmot]{1,14}$/.test(x)))

@EduardoArrudaPimentel: Sure, let me know if any of your tests fail, although shouldn't. — Pushpesh Kumar Rajwanshi, May 07 '19 at 18:18
I have marked, as solved. It work for me, after testing. Thank you again. — Eduardo Arruda Pimentel, May 07 '19 at 18:20

RegEx for matching words only formed with a list of letters

1 Answers1