Is it possible to support quantifier (n,m) for rule matching?

! | Negate the pattern, by requiring it to match exactly 0 times.
-- | --
? | Make the pattern optional, by allowing it to match 0 or 1 times.
+ | Require the pattern to match 1 or more times.
* | Allow the pattern to match zero or mo

In addition to the operators above, is it possible to support the {n,m} quantifier in the rule matcher? Or least {n} times. The reason is that, for linear matching, there is often a need to restrict how far two tokens occur in a piece of text. The shorter the distance, the more reliable the pattern. For example:

pattern = [{"LOWER": "hello"},
           {"LOWER": "world"}] 

For this pattern, I want to add an additional condition to require that the two words ‘hello’ and ‘world’ will be within a distance of no more than 12 words. Is there a way to express this logic for the current matcher? If not, how likely this can be supported by introducing the RE quantifier {n,m}? This is very useful for pattern matching in practical applications.

[svlandeg]

Hi! The matcher code can be found here: https://github.com/explosion/spaCy/blob/master/spacy/matcher/matcher.pyx

[github-actions[bot]]

This thread has been automatically locked since there has not been any recent activity after it was closed. Please open a new issue for related bugs.