JoinedDependencyGraph

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def adjacentComponents(pred: (Edge[JoinedDependencyNode]) ⇒ Boolean): Set[Set[JoinedDependencyNode]]

   

   Find components that are connected by the predicate.

   Find components that are connected by the predicate. Then, split components into subcomponents in which all vertices correspond to adjacent words in the source sentence.

5. def areConnected(vertices: Iterable[JoinedDependencyNode]): Boolean

   

   Test if the nodes are connected.

   Test if the nodes are connected. In other words, for each node, there exists another node in the set that is its neighbor.

   Definition Classes

   Graph

6. def areNeighbors(a: JoinedDependencyNode, b: JoinedDependencyNode): Boolean

   

   Test if the two nodes border each other.

   Test if the two nodes border each other.

   Definition Classes

   Graph

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def bipaths(vertices: Set[JoinedDependencyNode], maxLength: Option[Int] = None): Set[Bipath[JoinedDependencyNode]]

   

   Definition Classes

   Graph

9. def bipaths(start: JoinedDependencyNode, end: JoinedDependencyNode): List[Bipath[JoinedDependencyNode]]

   

   Definition Classes

   Graph

10. def canEqual(that: Any): Boolean

    

    Definition Classes

    Graph

11. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. def collapse(set: Set[JoinedDependencyNode])(implicit merge: (Traversable[JoinedDependencyNode]) ⇒ JoinedDependencyNode): Graph[JoinedDependencyNode]

    

    Definition Classes

    Graph

13. def collapse(collapsable: (E) ⇒ Boolean)(implicit merge: (Traversable[JoinedDependencyNode]) ⇒ JoinedDependencyNode): G

    

    Definition Classes

    Graph

14. def collapseGroups(groups: Iterable[Set[JoinedDependencyNode]])(implicit merge: (Traversable[JoinedDependencyNode]) ⇒ JoinedDependencyNode): Graph[JoinedDependencyNode]

    

    Definition Classes

    Graph

15. def collapseNNPOf(tokens: Seq[PostaggedToken]): G

    

    Join NNPs connected by "of" into a single node.

16. def collapseWeakLeaves: JoinedDependencyGraph

    

17. def components(pred: (Edge[JoinedDependencyNode]) ⇒ Boolean): Set[Set[JoinedDependencyNode]]

    

    Definition Classes

    Graph

18. def connected(v: JoinedDependencyNode, pred: (DirectedEdge[JoinedDependencyNode]) ⇒ Boolean): Set[JoinedDependencyNode]

    

    Definition Classes

    Graph

19. def dedges(vertex: JoinedDependencyNode): Set[DirectedEdge[JoinedDependencyNode]]

    

    Definition Classes

    Graph

20. def degree(v: JoinedDependencyNode): Int

    

    Definition Classes

    Graph

21. val dependencies: Set[Edge[JoinedDependencyNode]]

    

22. def directedAdjacentCollapse(labels: Set[String]): JoinedDependencyGraph

    

23. def edges(vertex: JoinedDependencyNode): Set[E]

    

    Definition Classes

    Graph

24. val edges: Set[Edge[JoinedDependencyNode]]

    

    Definition Classes

    Graph

25. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

26. def equals(that: Any): Boolean

    

    Definition Classes

    Graph → AnyRef → Any

27. def expand(vertices: Set[JoinedDependencyNode], pred: (DirectedEdge[JoinedDependencyNode]) ⇒ Boolean): Set[JoinedDependencyNode]

    

    Definition Classes

    Graph

28. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

29. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

30. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

31. val incoming: Map[JoinedDependencyNode, Set[Edge[JoinedDependencyNode]]]

    

    Definition Classes

    Graph

32. def indegree(v: JoinedDependencyNode): Int

    

    Definition Classes

    Graph

33. def inferiors(v: JoinedDependencyNode, cond: (E) ⇒ Boolean = x => true): Set[JoinedDependencyNode]

    

    Iteratively expand a vertex to all vertices beneath it.

    Iteratively expand a vertex to all vertices beneath it.

    returns

    the set of vertices beneath vertex

    Definition Classes

    Graph

34. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

35. def isTree(): Boolean

    

    Definition Classes

    Graph

36. def map[U](f: (JoinedDependencyNode) ⇒ U): Graph[U]

    

    Definition Classes

    Graph

37. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

38. def neighbors(v: JoinedDependencyNode): Set[JoinedDependencyNode]

    

    all vertices seperated from v.

    all vertices seperated from v.

    Definition Classes

    Graph

39. def neighbors(v: JoinedDependencyNode, pred: (DirectedEdge[JoinedDependencyNode]) ⇒ Boolean): Set[JoinedDependencyNode]

    

    all vertices seperated from v by a single edge that satisfied pred.

    all vertices seperated from v by a single edge that satisfied pred.

    Definition Classes

    Graph

40. val nodes: Set[JoinedDependencyNode]

    

41. final def notify(): Unit

    

    Definition Classes

    AnyRef

42. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

43. def outdegree(v: JoinedDependencyNode): Int

    

    Definition Classes

    Graph

44. val outgoing: Map[JoinedDependencyNode, Set[Edge[JoinedDependencyNode]]]

    

    Definition Classes

    Graph

45. def predecessors(v: JoinedDependencyNode, pred: (Edge[JoinedDependencyNode]) ⇒ Boolean): Set[JoinedDependencyNode]

    

    all vertices before incoming edges to v that satisfy the supplied predicate.

    all vertices before incoming edges to v that satisfy the supplied predicate.

    Definition Classes

    Graph

46. def predecessors(v: JoinedDependencyNode): Set[JoinedDependencyNode]

    

    all vertices before incoming edges to v.

    all vertices before incoming edges to v.

    Definition Classes

    Graph

47. def print(): Unit

    

    Definition Classes

    Graph

48. def print(writer: Appendable): Unit

    

    Definition Classes

    Graph

49. def successors(v: JoinedDependencyNode, pred: (Edge[JoinedDependencyNode]) ⇒ Boolean): Set[JoinedDependencyNode]

    

    all vertices after outgoing edges to v that satisfy the supplied predicate.

    all vertices after outgoing edges to v that satisfy the supplied predicate.

    Definition Classes

    Graph

50. def successors(v: JoinedDependencyNode): Set[JoinedDependencyNode]

    

    all vertices after outgoing edges to v.

    all vertices after outgoing edges to v.

    Definition Classes

    Graph

51. def superior(vertices: Set[JoinedDependencyNode]): JoinedDependencyNode

    

    Find the node which is most superior.

    Find the node which is most superior.

    Definition Classes

    Graph

    Exceptions thrown

    IllegalArgumentException nodes are not connected or no one superior

52. def superiors(v: JoinedDependencyNode, cond: (E) ⇒ Boolean = x => true): Set[JoinedDependencyNode]

    

    Iteratively expand a vertex to all vertices above it.

    Iteratively expand a vertex to all vertices above it.

    returns

    the set of vertices beneath vertex

    Definition Classes

    Graph

53. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

54. def toDot(): String

    

    Definition Classes

    Graph

55. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

56. def vertexBipaths(start: JoinedDependencyNode, end: JoinedDependencyNode): List[List[JoinedDependencyNode]]

    

    Find a path from vertex (start) to vertex (end).

    Find a path from vertex (start) to vertex (end).

    Definition Classes

    Graph

57. val vertices: Set[JoinedDependencyNode]

    

    Definition Classes

    Graph

58. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

59. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

60. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )