Tree

abstract def children: Option[Array[Tree]]

Array of children of this node

abstract def endOffset: Int

Offset of token immediately after this constituent; starts at 0

abstract def head: Int

Offset of *immediate* child that is head for this constituent; starts at 0

abstract def headOffset: Int

Offset of head token; starts at 0

abstract def isLeaf: Boolean

abstract def startOffset: Int

Start token offset in the sentence for this constituent; starts at 0

abstract def value: String

A syntactic label, POS tag, or word for terminal nodes

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

var _parent: Option[NonTerminal]

def ancestors: List[NonTerminal]

returns ancestors sorted from near to far

def apply(address: List[Int]): Tree

def apply(address: Int*): Tree

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findHeadPosition: Int

final def getClass(): Class[_]

def hasLabel(label: String): Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isPreTerminal: Boolean

def isUnary: Boolean

def leftSibling: Option[Tree]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parent: Option[NonTerminal]

def posTags: List[(String, String)]

def preterminals: List[NonTerminal]

def rightSibling: Option[Tree]

def root: Tree

def setParent(p: Option[NonTerminal]): Unit

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

def terminals: List[Terminal]

def toString(): String

def toStringDepth(showHead: Boolean, depth: Int = 0): String

Pretty print, including position of head child

def tokens: List[String]

def treePosition: List[Int]

final def wait(): Unit

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

final def wait(arg0: Long): Unit