You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@uima.apache.org by Diego Buoro <jk...@gmail.com> on 2015/05/15 20:53:25 UTC

Accessing a string array child tag in UIMA-RUTA

Hello, guys!
How is everyone doing? Hope everything is fine.

I have just posted in stackoverflow this question <
http://stackoverflow.com/questions/30266328/how-to-access-a-string-array-child-tag-in-uima-ruta>.
I am having trouble to access a string array child tag using the UIMA-RUTA
technology. Please, can someone have a quick look at my problem?

Thanks in advance!

Re: Accessing a string array child tag in UIMA-RUTA

Posted by Peter Klügl <pe...@averbis.com>.
Hi,

unfortunately, I have to admit that UIMA Ruta language lacks support for 
accessing UIMA arrays. This functionality was neglected so far.

I will try to find the time to implement it for the next upcoming 
release, but I cannot promise that it will be included. The 
corresponding jira issue can be found here: 
https://issues.apache.org/jira/browse/UIMA-4399

You are welcome to add here or in the comment section of the issue a 
wish list of functionality that should be added, e.g., do you want to 
operate with regular expressions in the array or is a simple string 
equals/contains sufficient?

Right now, there are no optimal solutions for your problem. You could 
either use an adapted type system without arrays, e.g., use a subtype of 
token with a string feature containing an comma-separated enumeration of 
the lexemes, or implement a condition extension for accessing the array 
on java level.

Best,

Peter

Am 15.05.2015 um 20:53 schrieb Diego Buoro:
> Hello, guys!
> How is everyone doing? Hope everything is fine.
>
> I have just posted in stackoverflow this question <
> http://stackoverflow.com/questions/30266328/how-to-access-a-string-array-child-tag-in-uima-ruta>.
> I am having trouble to access a string array child tag using the UIMA-RUTA
> technology. Please, can someone have a quick look at my problem?
>
> Thanks in advance!
>