Object

epic.trees

Trees

Related Doc: package trees

Permalink

object Trees

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Trees
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final case class Zipper[+L](tree: BinarizedTree[L], location: Location[L] = Zipper.Root) extends Product with Serializable

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object Transforms

    Permalink
  5. object Zipper extends Serializable

    Permalink
  6. def addHorizontalMarkovization(tree: BinarizedTree[String], order: Int): BinarizedTree[String]

    Permalink
  7. def addHorizontalMarkovization[T](tree: BinarizedTree[T], order: Int, join: (T, IndexedSeq[Either[T, T]]) ⇒ T, isIntermediate: (T) ⇒ Boolean): BinarizedTree[T]

    Permalink

    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

  8. def annotateParents(tree: Tree[String], depth: Int): Tree[String]

    Permalink
  9. def annotateParents[L](tree: Tree[L], join: (L, L) ⇒ L, depth: Int, history: List[L] = List.empty): Tree[L]

    Permalink
  10. def annotateParentsBinarized(tree: BinarizedTree[String], depth: Int): BinarizedTree[String]

    Permalink
  11. def annotateParentsBinarized[L](tree: BinarizedTree[L], join: (L, Seq[L]) ⇒ L, isIntermediate: (L) ⇒ Boolean, dontAnnotate: (Tree[L]) ⇒ Boolean, depth: Int): BinarizedTree[L]

    Permalink

    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

  12. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  13. def binarize(tree: Tree[String], headFinder: HeadFinder[String] = HeadFinder.collins): BinarizedTree[String]

    Permalink
  14. def binarize[L](tree: Tree[L], makeIntermediate: (L, L) ⇒ L, extendIntermediate: (L, Either[L, L]) ⇒ L, headFinder: HeadFinder[L]): BinarizedTree[L]

    Permalink
  15. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def deannotate(tree: BinarizedTree[String]): BinarizedTree[String]

    Permalink
  17. def deannotate(tree: Tree[String]): Tree[String]

    Permalink
  18. def deannotateLabel(l: String): String

    Permalink
  19. def debinarize(tree: Tree[String]): Tree[String]

    Permalink
  20. def debinarize[L](tree: Tree[L], isBinarized: (L) ⇒ Boolean): Tree[L]

    Permalink
  21. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  22. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  23. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  24. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  25. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  27. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  30. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  31. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  32. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped