[
https://issues.apache.org/jira/browse/UIMA-5422?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16002184#comment-16002184
]
Peter Klügl commented on UIMA-5422:
-----------------------------------
It's a current limitation of the implementation of the rule inference.
Quantifier iterations on composed/disjunctive/conjunctive rule elements still
relies on recursion, which will lead of course to this stackoverflow dependent
on the document.
There is a configuration parameter 'simpleGreedyForComposed' which switches to
a loop but the implementation is still buggy. I did not have the time to fix it.
Right now, my best advice (until it is fixed) it to avoid unrestricted
quantifiers at composed rule elements if the input is not well known.
> Simple rule causes stack overflow
> ---------------------------------
>
> Key: UIMA-5422
> URL: https://issues.apache.org/jira/browse/UIMA-5422
> Project: UIMA
> Issue Type: Bug
> Components: Ruta
> Affects Versions: 2.6.0ruta
> Environment: MacOS X, Linux
> Reporter: Hugues de Mazancourt
> Assignee: Peter Klügl
>
> The following simple rule :
> {{W (PM|SPECIAL)* W;}}
> Generates a stack overflow error on the attached example text (this is a
> simplified version of an output of a Tika conversion on a bogus RTF file).
> I don't see any obvious fix for Ruta, but a limit on the number of possible
> matches for a rule would be a workaround.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
