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 addHorizontalMarkovization(tree: BinarizedTree[String], order: Int): BinarizedTree[String]
5.  def addHorizontalMarkovization[T](tree: BinarizedTree[T], order: Int, join: (T, IndexedSeq[Either[T, T]]) ⇒ T, isIntermediate: (T) ⇒ Boolean): BinarizedTree[T]

   Adds horizontal markovization to an already binarized tree with no markovization.

   Adds horizontal markovization to an already binarized tree with no markovization.

   The sibling history of a node is: If one of its children is an intermediate, then its history concatenated with its sibling (if it exists), markovizing. if neither is an intermediate, and it is an intermediate, then the right child. Otherwise it is empty

6.  def annotateParents(tree: Tree[String], depth: Int): Tree[String]
7.  def annotateParents[L](tree: Tree[L], join: (L, L) ⇒ L, depth: Int, history: List[L] = List.empty): Tree[L]
8.  def annotateParentsBinarized(tree: BinarizedTree[String], depth: Int): BinarizedTree[String]
9.  def annotateParentsBinarized[L](tree: BinarizedTree[L], join: (L, Seq[L]) ⇒ L, isIntermediate: (L) ⇒ Boolean, dontAnnotate: (Tree[L]) ⇒ Boolean, depth: Int): BinarizedTree[L]

   Adds parent-markovization to an already binarized tree.

   Adds parent-markovization to an already binarized tree. Also handles the unary layering we do by ignoring identity unary transitions in the history

   L

   type of the tree

   tree

   the tree

   join

   join: join two elements of the history into a single label. (child,parent)=>newChild

   isIntermediate

   is this an intermediate symbol? Determines whether or not we should include the immediate parent of this label in the history

   depth

   how much history to keep

10.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

11.  def binarize(tree: Tree[String], headFinder: HeadFinder[String] = HeadFinder.collins): BinarizedTree[String]
12.  def binarize[L](tree: Tree[L], makeIntermediate: (L, L) ⇒ L, extendIntermediate: (L, Either[L, L]) ⇒ L, headFinder: HeadFinder[L]): BinarizedTree[L]
13.  def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

14.  def deannotate(tree: BinarizedTree[String]): BinarizedTree[String]
15.  def deannotate(tree: Tree[String]): Tree[String]
16.  def deannotateLabel(l: String): String
17.  def debinarize(tree: Tree[String]): Tree[String]
18.  def debinarize[L](tree: Tree[L], isBinarized: (L) ⇒ Boolean): Tree[L]
19.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

21.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

22.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

23.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

24.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

25.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

26.  final def notify(): Unit

    Definition Classes

    AnyRef

27.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

29.  def toString(): String

    Definition Classes

    AnyRef → Any

30.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33.  object Transforms
34.  object Zipper extends Serializable