| Modifier and Type | Method and Description |
|---|---|
static SNode |
SaltFactory.createSNode()
|
SNode |
ISaltFactory.createSNode()
|
| Modifier and Type | Method and Description |
|---|---|
static SRelation<SNode,SNode> |
SaltFactory.createSRelation()
|
static SRelation<SNode,SNode> |
SaltFactory.createSRelation()
|
SRelation<SNode,SNode> |
ISaltFactory.createSRelation()
Creates a new
SRelation object of type SRelationImpl. |
SRelation<SNode,SNode> |
ISaltFactory.createSRelation()
Creates a new
SRelation object of type SRelationImpl. |
| Modifier and Type | Interface and Description |
|---|---|
interface |
SSequentialRelation<S extends SNode,T extends SNode,P extends Number> |
interface |
SSequentialRelation<S extends SNode,T extends SNode,P extends Number> |
interface |
STextOverlappingRelation<S extends SNode,T extends SNode> |
interface |
STextOverlappingRelation<S extends SNode,T extends SNode> |
interface |
STimeOverlappingRelation<S extends SNode,T extends SNode> |
interface |
STimeOverlappingRelation<S extends SNode,T extends SNode> |
| Modifier and Type | Interface and Description |
|---|---|
interface |
SCorpus
In Salt a corpus is represented by this class.
|
interface |
SDocument
In Salt a document is represented by this class.
|
interface |
SMedialDS |
interface |
SSequentialDS<D,P extends Number> |
interface |
SSpan
A span is used to group a couple of tokens together to give them exactly the
same annotation or to connect them as a bunch with a 3rd node at once.
|
interface |
SStructure
Hierarchies are a useful mechanism to express tree-like or hierarchical
structures behind a text.
|
interface |
SStructuredNode
This class bundles the node types
SToken, SSpan and
SStructure to be used as target in a SDominanceRelation. |
interface |
STextualDS |
interface |
STimeline |
interface |
SToken
In general, it is not totally clear in linguistics what a token is.
|
| Modifier and Type | Method and Description |
|---|---|
List<SNode> |
SDocumentGraph.getChildren(SNode parent,
SALT_TYPE relationType)
Returns a list of nodes in base document.
|
List<SNode> |
SDocumentGraph.getNodes(Class<?> clazz)
Returns all nodes of the passed class.
|
List<SNode> |
SDocumentGraph.getNodes(SALT_TYPE type)
Returns all nodes of the passed type.
|
List<SNode> |
SDocumentGraph.getNodesBySequence(DataSourceSequence sequence)
Returns all
SNode objects which refer to the passed
DataSourceSequence object. |
List<SNode> |
SDocumentGraph.getRootsByRelation(SALT_TYPE... type)
|
com.google.common.collect.Multimap<String,SNode> |
SDocumentGraph.getRootsByRelationType(SALT_TYPE type)
Returns all nodes, which are roots for the given relation-class respects
to the given SType of the traversed relation.
|
List<SNode> |
SDocumentGraph.getSharedParent(List<SNode> children,
SALT_TYPE nodeType)
Returns a list of nodes that are the parents of every node in the given
base list.
|
| Modifier and Type | Method and Description |
|---|---|
SRelation |
SDocumentGraph.addNode(SNode source,
SNode target,
SALT_TYPE relationType)
Creates and returns a 'SRelation' of the type given by
sRelationType between source and target.
|
SRelation |
SDocumentGraph.createRelation(SNode source,
SNode target,
SALT_TYPE relationType,
String annotations)
Creates a
SRelation object, and sets its sSource and sTarget to
the passed ones. |
List<SNode> |
SDocumentGraph.getChildren(SNode parent,
SALT_TYPE relationType)
Returns a list of nodes in base document.
|
List<DataSourceSequence> |
SDocumentGraph.getOverlappedDataSourceSequence(SNode node,
SALT_TYPE... relationTypes)
Returns the sequences as
DataSourceSequence which are overlapped
by the given SNode node. |
List<SToken> |
SDocumentGraph.getOverlappedTokens(SNode overlappingNode)
Returns all tokens in the graph, which are overlapped by the passed node
and are reachable via
SALT_TYPE.STEXT_OVERLAPPING_RELATION having
at least one of the passed types. |
List<SToken> |
SDocumentGraph.getOverlappedTokens(SNode overlappingNode,
SALT_TYPE... overlappingRelationTypes)
Returns all tokens in the graph, which are overlapped by the passed node
and are reachable via relations having at least one of the passed types.
|
String |
SDocumentGraph.getText(SNode sNode)
This method returns the exact text overlapped in the
STextualDS
by the given SNode. |
| Modifier and Type | Method and Description |
|---|---|
List<DataSourceSequence> |
SDocumentGraph.getOverlappedDataSourceSequence(List<SNode> nodes,
SALT_TYPE... relationTypes)
Returns the sequences as
DataSourceSequence which are overlapped
by the given SNode node. |
List<SNode> |
SDocumentGraph.getSharedParent(List<SNode> children,
SALT_TYPE nodeType)
Returns a list of nodes that are the parents of every node in the given
base list.
|
boolean |
SDocumentGraph.isContinuousByText(List<SNode> subNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
boolean |
SDocumentGraph.isContinuousByText(List<SNode> subNodeList,
List<SNode> fullNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
boolean |
SDocumentGraph.isContinuousByText(List<SNode> subNodeList,
List<SNode> fullNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
| Modifier and Type | Class and Description |
|---|---|
class |
SSequentialRelationImpl<S extends SNode,T extends SNode,P extends Number> |
class |
SSequentialRelationImpl<S extends SNode,T extends SNode,P extends Number> |
| Modifier and Type | Class and Description |
|---|---|
class |
SCorpusImpl |
class |
SDocumentImpl |
class |
SMedialDSImpl |
class |
SSequentialDSImpl<D,P extends Number> |
class |
SSpanImpl |
class |
SStructureImpl |
class |
STextualDSImpl |
class |
STimelineImpl |
class |
STokenImpl |
| Modifier and Type | Method and Description |
|---|---|
List<SNode> |
SDocumentGraphImpl.getChildren(SNode parent,
SALT_TYPE relationType)
Returns a list of nodes in base document.
|
List<SNode> |
SDocumentGraphImpl.getNodes(Class<?> clazz)
Returns all nodes of the passed class.
|
List<SNode> |
SDocumentGraphImpl.getNodes(SALT_TYPE type)
Returns all nodes of the passed type.
|
List<SNode> |
SDocumentGraphImpl.getNodesBySequence(DataSourceSequence sequence)
Returns all
SNode objects which refer to the passed
DataSourceSequence object. |
List<SNode> |
SDocumentGraphImpl.getRootsByRelation(SALT_TYPE... type)
|
com.google.common.collect.Multimap<String,SNode> |
SDocumentGraphImpl.getRootsByRelationType(SALT_TYPE type)
Returns all nodes, which are roots for the given relation-class respects
to the given SType of the traversed relation.
|
List<SNode> |
SDocumentGraphImpl.getSharedParent(List<SNode> children,
SALT_TYPE nodeType)
Returns a list of nodes that are the parents of every node in the given
base list.
|
| Modifier and Type | Method and Description |
|---|---|
SRelation |
SDocumentGraphImpl.addNode(SNode source,
SNode target,
SALT_TYPE sRelationType)
Creates and returns a 'SRelation' of the type given by
sRelationType between source and target.
|
protected void |
SCorpusGraphImpl.basicAddNode(SNode node)
Calls the super method an puts the given node into a node type index. an
exception will be thrown.
|
protected void |
SDocumentGraphImpl.basicAddNode(SNode node)
Calls the super method an puts the given node into a node type index. an
exception will be thrown.
|
SRelation |
SDocumentGraphImpl.createRelation(SNode sSource,
SNode sTarget,
SALT_TYPE sRelationType,
String sAnnotations)
Creates a
SRelation object, and sets its sSource and sTarget to
the passed ones. |
List<SNode> |
SDocumentGraphImpl.getChildren(SNode parent,
SALT_TYPE relationType)
Returns a list of nodes in base document.
|
List<DataSourceSequence> |
SDocumentGraphImpl.getOverlappedDataSourceSequence(SNode node,
SALT_TYPE... relationTypes)
Returns the sequences as
DataSourceSequence which are overlapped
by the given SNode node. |
List<SToken> |
SDocumentGraphImpl.getOverlappedTokens(SNode overlappingNode)
Returns all tokens in the graph, which are overlapped by the passed node
and are reachable via
SALT_TYPE.STEXT_OVERLAPPING_RELATION having
at least one of the passed types. |
List<SToken> |
SDocumentGraphImpl.getOverlappedTokens(SNode overlappingNode,
SALT_TYPE... relationTypes)
Returns all tokens in the graph, which are overlapped by the passed node
and are reachable via relations having at least one of the passed types.
|
String |
SDocumentGraphImpl.getText(SNode sNode)
This method returns the exact text overlapped in the
STextualDS
by the given SNode. |
| Modifier and Type | Method and Description |
|---|---|
List<DataSourceSequence> |
SDocumentGraphImpl.getOverlappedDataSourceSequence(List<SNode> nodes,
SALT_TYPE... relationTypes)
Returns the sequences as
DataSourceSequence which are overlapped
by the given SNode node. |
List<SNode> |
SDocumentGraphImpl.getSharedParent(List<SNode> children,
SALT_TYPE nodeType)
Returns a list of nodes that are the parents of every node in the given
base list.
|
boolean |
SDocumentGraphImpl.isContinuousByText(List<SNode> subNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
boolean |
SDocumentGraphImpl.isContinuousByText(List<SNode> subNodeList,
List<SNode> fullNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
boolean |
SDocumentGraphImpl.isContinuousByText(List<SNode> subNodeList,
List<SNode> fullNodeList)
Returns true, if the given list of nodes subNodeList is
continuous respecting the overlapped text.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
SRelation<S extends SNode,T extends SNode> |
interface |
SRelation<S extends SNode,T extends SNode> |
| Modifier and Type | Method and Description |
|---|---|
List<SNode> |
SGraph.getLeafs()
Returns all leaf nodes, if exist.
|
List<SNode> |
SGraph.getNodesByName(String nodeName)
Searches for a node or a set of nodes having the given node name.
|
List<SNode> |
SGraph.getRoots()
Returns all root nodes, if exist.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
GraphTraverseHandler.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order)
This method is called during a traversal to check if the current node and
eventually its sub-graph shall be traversed or not.
|
void |
GraphTraverseHandler.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is left, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and the method
#nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
has been invoked. |
void |
GraphTraverseHandler.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is reached, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and before the method
#nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
is invoked. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
GraphTraverseHandler.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order)
This method is called during a traversal to check if the current node and
eventually its sub-graph shall be traversed or not.
|
boolean |
GraphTraverseHandler.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order)
This method is called during a traversal to check if the current node and
eventually its sub-graph shall be traversed or not.
|
void |
GraphTraverseHandler.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is left, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and the method
#nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
has been invoked. |
void |
GraphTraverseHandler.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is left, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and the method
#nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
has been invoked. |
void |
GraphTraverseHandler.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is reached, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and before the method
#nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
is invoked. |
void |
GraphTraverseHandler.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is reached, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and before the method
#nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
is invoked. |
void |
SGraph.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Attention: When isCycleSafe is set to false, this
method does not take care about cycles, and it eventually runs into
endless loops.
|
void |
SGraph.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
| Modifier and Type | Class and Description |
|---|---|
class |
SRelationImpl<S extends SNode,T extends SNode> |
class |
SRelationImpl<S extends SNode,T extends SNode> |
| Modifier and Type | Class and Description |
|---|---|
class |
SNodeImpl |
| Modifier and Type | Method and Description |
|---|---|
List<SNode> |
SGraphImpl.getLeafs()
Returns all leaf nodes, if exist.
|
List<SNode> |
SGraphImpl.getNodesByName(String nodeName)
Searches for a node or a set of nodes having the given node name.
|
List<SNode> |
SGraphImpl.getRoots()
Returns all root nodes, if exist.
|
| Modifier and Type | Method and Description |
|---|---|
void |
GraphTraverserModule.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
void |
SGraphImpl.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Attention: When isCycleSafe is set to false, this
method does not take care about cycles, and it eventually runs into
endless loops.
|
void |
GraphTraverserModule.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
void |
SGraphImpl.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
| Modifier and Type | Method and Description |
|---|---|
SNode |
SaltFactoryImpl.createSNode()
|
| Modifier and Type | Method and Description |
|---|---|
SRelation<SNode,SNode> |
SaltFactoryImpl.createSRelation()
Creates a new
SRelation object of type SRelationImpl. |
SRelation<SNode,SNode> |
SaltFactoryImpl.createSRelation()
Creates a new
SRelation object of type SRelationImpl. |
| Modifier and Type | Method and Description |
|---|---|
com.google.common.collect.BiMap<SNode,SNode> |
Diff.getIsoNodes()
Return BiMap with isomorphic
SNodes key= template, value= other |
com.google.common.collect.BiMap<SNode,SNode> |
Diff.getIsoNodes()
Return BiMap with isomorphic
SNodes key= template, value= other |
static List<SNode> |
DataSourceAccessor.getNodeBySequence(SDocumentGraph documentGraph,
DataSourceSequence DataSourceSequence)
Returns all
SNode objects which refer to the passed
DataSourceSequence object. |
static List<SNode> |
DataSourceAccessor.getRootsByRelation(SDocumentGraph documentGraph,
SALT_TYPE... saltTypes)
|
static com.google.common.collect.Multimap<String,SNode> |
DataSourceAccessor.getRootsByRelationType(SDocumentGraph documentGraph,
Class<? extends SRelation> clazz)
for each relation R of type class
for each foregoing relation P (incoming relation of R'source)
check whether P is a parent of R (true, if they have the same class and the same type)
if R has no parents store R corresponding to it's type in returned table
|
static com.google.common.collect.Multimap<String,SNode> |
DataSourceAccessor.getRootsByRelationType(SDocumentGraph documentGraph,
SALT_TYPE sType)
Returns all nodes, which are roots for the given relation-class respects
to the given SType of the traversed relation.
|
| Modifier and Type | Method and Description |
|---|---|
static List<DataSourceSequence> |
DataSourceAccessor.getOverlappedDataSourceSequence(SDocumentGraph documentGraph,
SNode sNode,
SALT_TYPE... relationTypes) |
static List<SToken> |
DataSourceAccessor.getOverlappedSTokens(SDocumentGraph documentGraph,
SNode overlappingNode,
SALT_TYPE... relationTypes)
|
| Modifier and Type | Method and Description |
|---|---|
static List<DataSourceSequence> |
DataSourceAccessor.getOverlappedDataSourceSequence(SDocumentGraph documentGraph,
List<SNode> nodes,
SALT_TYPE... relationTypes) |
static boolean |
DataSourceAccessor.isContinuousByText(SDocumentGraph documentGraph,
List<? extends SNode> subSNodList,
List<? extends SNode> fullSNodList)
First sorts the
given lists, than searches first occurance of first node in subSNodList
in fullSNodList.
|
static boolean |
DataSourceAccessor.isContinuousByText(SDocumentGraph documentGraph,
List<? extends SNode> subSNodList,
List<? extends SNode> fullSNodList)
First sorts the
given lists, than searches first occurance of first node in subSNodList
in fullSNodList.
|
static boolean |
DataSourceAccessor.isContinuousByText(SDocumentGraph documentGraph,
List<SNode> subSNodList) |
| Modifier and Type | Method and Description |
|---|---|
void |
SaltXML10Writer.writeLayer(XMLStreamWriter xml,
Layer layer,
Map<SNode,Integer> nodePositions,
Map<SRelation<SNode,SNode>,Integer> relPositions)
Writes the passed relation object to the passed
XMLStreamWriter. |
void |
SaltXML10Writer.writeLayer(XMLStreamWriter xml,
Layer layer,
Map<SNode,Integer> nodePositions,
Map<SRelation<SNode,SNode>,Integer> relPositions)
Writes the passed relation object to the passed
XMLStreamWriter. |
void |
SaltXML10Writer.writeLayer(XMLStreamWriter xml,
Layer layer,
Map<SNode,Integer> nodePositions,
Map<SRelation<SNode,SNode>,Integer> relPositions)
Writes the passed relation object to the passed
XMLStreamWriter. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
SDocumentGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order) |
boolean |
SCorpusGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation edge,
SNode currNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order) |
void |
SCorpusGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation edge,
SNode fromNode,
long order) |
void |
SCorpusGraphDOTWriter.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currSNode,
SRelation relation,
SNode fromSNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation relation,
SNode fromNode,
long order) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
SDocumentGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order) |
boolean |
SDocumentGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order) |
Copyright © 2009–2015 Humboldt-Universität zu Berlin, INRIA. All rights reserved.