A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15
Stores all the coreference chains extracted in one document
Stores a single coreference mention
Counts elements of type T User: mihais Date: 3/18/13
A generic graph where the nodes have Int identifiers and edges have type E The node ids are offsets in an array thus they must start at 0 This class is designed to be as immutable as possible, thus no operations to modify it are provided Each edge in edges stores (head, modifier, label) User: mihais Date: 3/5/13
An inverted index of the DirectedGraph, so we can efficiently implement enhanced dependencies User: mihais Date: 8/2/17
Validates if the span identified as a named entity entity is actually valid User: mihais Date: 10/24/16
Validates if the span identified as a named entity entity is actually valid User: mihais Date: 10/24/16
A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15
A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15
Replicates the functionality of Java's String.intern() but using heap memory and any object type not just String User: mihais Date: 3/1/13
An interval of integers.
An interval of integers.
Generic lexicon: maps objects of type T to Ints, both ways User: mihais Date: 3/1/13
Stores a mutable number of type T User: mihais Date: 3/18/13
Stores a tree structure; used generally to store constituent trees User: marcov, mihais Date: 4/1/13, modified 10/13/14
Any span is considered as a valid entity See org.clulab.processors.bio.BioLexiconEntityValidator for a more complicated validator.
Any span is considered as a valid entity See org.clulab.processors.bio.BioLexiconEntityValidator for a more complicated validator.
Operations on Counter(s) User: mihais Date: 3/18/13
A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15