class
DependencyGraph extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
adjacentComponents(pred: (Edge[DependencyNode]) ⇒ Boolean): Set[Set[DependencyNode]]
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
def
collapseNounGroups(dividors: List[String] = List.empty): DependencyGraph
-
-
-
val
dependencies: SortedSet[Dependency]
-
def
directedAdjacentCollapse(label: String): DependencyGraph
-
def
directedAdjacentCollapse(labels: Set[String]): DependencyGraph
-
def
dot(title: String, nodeStyle: Map[DependencyNode, String], edgeStyle: Map[Edge[DependencyNode], String]): String
-
def
dot(title: String = this.text): String
-
def
dotWithHighlights(title: String, specialNodes: Set[DependencyNode], specialEdges: Set[Edge[DependencyNode]]): String
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
-
def
hashCode(): Int
-
def
interval: Interval
-
final
def
isInstanceOf[T0]: Boolean
-
def
length: Int
-
-
-
def
mapPostags(f: (String) ⇒ String): DependencyGraph
-
final
def
ne(arg0: AnyRef): Boolean
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
printDependencies(): Unit
-
def
printDot(writer: Appendable, title: String, nodeStyle: Map[DependencyNode, String], edgeStyle: Map[Edge[DependencyNode], String]): Unit
-
def
printDot(writer: Appendable, title: String = this.text): Unit
-
def
printDotWithHighlights(writer: Appendable, title: String, specialNodes: Set[DependencyNode], specialEdges: Set[Edge[DependencyNode]]): Unit
-
def
serializeSeq: Iterator[String]
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
val
text: String
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Deprecated Value Members
-
def
serialize: String
Inherited from AnyRef
Inherited from Any
A representation of a graph over dependencies. This richer representation may include the text of the original sentence, the original nodes (before collapsing), and the original dependencies.