epic.trees

Trees

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
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

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

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. object Transforms

  7. object Zipper extends Serializable

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

  9. 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

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

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

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

  13. 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

    returns

  14. final def asInstanceOf[T0]: T0

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

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

  17. def clone(): AnyRef

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

  19. def deannotate(tree: Tree[String]): Tree[String]

  20. def deannotateLabel(l: String): String

  21. def debinarize(tree: Tree[String]): Tree[String]

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

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

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

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

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

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

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

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

    Definition Classes
    AnyRef
  30. final def notify(): Unit

    Definition Classes
    AnyRef
  31. final def notifyAll(): Unit

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

    Definition Classes
    AnyRef
  33. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped