Hello,
Roberto, thank you for mentioning the drools wrapper for UIMA, drools seems to
be a very mature and stable system.
I'm evaluating drools for rule based text analysis but I'm missing a key
concept. How do you model annotation sequences? For instance I want to write a
rule:
If Mr. is
On Mon, Nov 19, 2012 at 10:06 AM, Yasen Kiprov yasenkip...@yahoo.com wrote:
Hello,
[cut]
when
Token with text == Mr. and number i
Token with capital letter and number i + 1
...
But it doesn't look right.
Does anyone have any idea how such patterns can be modeled with Drools?
We use
Hi Yason, Roberto and others,
we ran into the same problem after one day of using Drools. Using an artificial
index however doesn't work for us since we have many Annotations and a complex
TypeSystem, we had to retouch all our AEs to get this index working - not
possible for us.
What do you
Hi all (and especially the good folks working on TextMarker in the sandbox),
1. I am interested in implementing the type of text simplification rules set
out in this paper [1].
2. I would prefer to use TextMarker (and its language) natively in UIMA than
use the UIMA-GATE integration and JAPE
I can see only one attached file: TextSimplifier.xml
Can you send me the input file, the rules and the type systems.
Peter
On 19.11.2012 13:45, Monaghan, Fergal wrote:
I've attached here the descriptor (TextSimplifier.xml: configuration
for TextMarkerEngine), the test input data
Ah ok, the attachment was removed.
Here's the script file:
PACKAGE com.sap.research.bd.ta;
//TYPESYSTEM ExternalTypeSystem;
ENGINE utils.Modifier;
// some helper annotations
DECLARE SimpleSentence;
//TreebankNode{FEATURE(nodeType, S) - MARK(S)};
ANY+{-PARTOF(SimpleSentence), -PARTOF(PERIOD)
