Package | Description |
---|---|
edu.ucla.sspace.dependency |
Modifier and Type | Class and Description |
---|---|
class |
SimpleDependencyRelation
A simple
DependencyRelation implementation holds both related nodes
and their relation. |
Modifier and Type | Method and Description |
---|---|
DependencyRelation |
SimpleDependencyPath.firstRelation()
Returns the relation that connects the first and second nodes in the
path, which are closest to the root.
|
DependencyRelation |
DependencyPath.firstRelation()
Returns the relation that connects the first and second nodes in the
path, which are closest to the root.
|
DependencyRelation |
SimpleDependencyPath.lastRelation()
Returns the relation that connects the last and second to last nodes in
the path, which are furthest from the root.
|
DependencyRelation |
DependencyPath.lastRelation()
Returns the relation that connects the last and second to last nodes in
the path, which are furthest from the root.
|
Modifier and Type | Method and Description |
---|---|
Iterator<DependencyRelation> |
SimpleDependencyPath.iterator()
Returns an iterator over all the relations in the path in order from
closest to the root to furthest.
|
Iterator<DependencyRelation> |
DependencyPath.iterator()
Returns an iterator over all the relations in the path in order from
closest to the root to furthest.
|
List<DependencyRelation> |
SimpleDependencyTreeNode.neighbors()
Returns the list of neighbors to the current node.
|
List<DependencyRelation> |
DependencyTreeNode.neighbors()
Returns the list of neighbors to the current node.
|
Modifier and Type | Method and Description |
---|---|
boolean |
SubjObjRelationAcceptor.accept(DependencyRelation relation)
Returns wether or not the given dependency relation should be accepted.
|
boolean |
UniversalRelationAcceptor.accept(DependencyRelation relation)
Returns wether or not the given dependency relation should be accepted.
|
boolean |
DependencyRelationAcceptor.accept(DependencyRelation relation)
Returns wether or not the given dependency relation should be accepted.
|
void |
SimpleDependencyTreeNode.addNeighbor(DependencyRelation relation)
Adds a relation from node to another node.
|
SimpleDependencyPath |
SimpleDependencyPath.extend(DependencyRelation relation)
Returns a copy of this dependency path that has the provided related
appended to the end of its path sequence.
|
Constructor and Description |
---|
SimpleDependencyPath(DependencyRelation relation,
boolean startFromHead)
Creates a
SimpleDependencyPath from a single relation, optionally
starting at the head node of the relation. |
Constructor and Description |
---|
SimpleDependencyPath(List<DependencyRelation> path)
Creates a
SimpleDependencyPath starting at the head node of the
first relation in the list. |
SimpleDependencyPath(List<DependencyRelation> path,
boolean isHeadFirst)
Creates a
SimpleDependencyPath that starts at either the head
node or dependent node of the first relation in the list. |
SimpleDependencyTreeNode(String word,
String pos,
int index,
List<DependencyRelation> neighbors)
Creates a new
SimpleDependencyTreeNode node for the provided
word, with the provided part of speech and neighbor list. |
SimpleDependencyTreeNode(String word,
String pos,
String lemma,
int index,
List<DependencyRelation> neighbors)
Creates a new
SimpleDependencyTreeNode node for the provided
word, with the provided part of speech and neighbor list. |
Copyright © 2012. All Rights Reserved.