uima-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Matthias Wendt <matthias.we...@neofonie.de>
Subject Re: Representing parse trees in the CAS
Date Thu, 22 Jan 2009 13:11:17 GMT

storing pointers to the subconstituents (top down) might be an 
alternative - which is quite straightforward. However, if you don't plan 
to disambiguate the tree there may be sets of pointers.
There is also a second alternative that works without saving the 
pointers in the feature structures at all: the method tree 

in the AnnotationIndex. However, care has to be taken in order to avoid 
endless recursion (in case of multiple annotations having the same span) 
here. To achieve this consult the reference manual 

about type priorities.

I would be glad to hear, what solution you chose
Good luck

Ramon Ziai schrieb:
> Hi UIMAers,
> I was wondering about the best way to go about representing parse
> constituents in the CAS. What are the common practices?
> I'm aware of the approach taken by the JULIE lab (Hahn et al., 2007a)
> which involves storing parent pointers in constituent annotations.
> However, that seems to imply "collecting" the trees bottom-up which may
> be inconvenient. Also, it's unclear to me how multiple possible parses
> are to be stored and retrieved.
> Any ideas or pointers are welcome.
> Best,
> Ramon

Matthias Wendt
Junior Softwareentwickler

Technologieentwicklung und
Informationsmanagement GmbH
Robert-Koch-Platz 4
10115 Berlin
fon: +49.30 24627 529
fax: +49.30 24627 120

Berlin-Charlottenburg: HRB 67460

Helmut Hoffer von Ankershoffen
Nurhan Yildirim
Uwe-Gernot Fasold

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message