epic.trees.annotations

TreeAnnotator

trait TreeAnnotator[L, W, M] extends (BinarizedTree[L], Seq[W]) ⇒ BinarizedTree[M] with (TreeInstance[L, W]) ⇒ TreeInstance[M, W] with Serializable

Linear Supertypes
Serializable, Serializable, (TreeInstance[L, W]) ⇒ TreeInstance[M, W], (BinarizedTree[L], Seq[W]) ⇒ BinarizedTree[M], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TreeAnnotator
  2. Serializable
  3. Serializable
  4. Function1
  5. Function2
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def apply(tree: BinarizedTree[L], words: Seq[W]): BinarizedTree[M]

    Definition Classes
    TreeAnnotator → Function2

Concrete 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. final def andThen[N](other: TreeAnnotator[M, W, N]): ComposedAnnotator[L, W, M, N]

  5. def andThen[A](g: (TreeInstance[M, W]) ⇒ A): (TreeInstance[L, W]) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  6. def apply(ti: TreeInstance[L, W]): TreeInstance[M, W]

    Definition Classes
    TreeAnnotator → Function1
  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def compose[N](other: TreeAnnotator[N, W, L]): ComposedAnnotator[N, W, L, M]

  10. def compose[A](g: (A) ⇒ TreeInstance[L, W]): (A) ⇒ TreeInstance[M, W]

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  11. def curried: (BinarizedTree[L]) ⇒ (Seq[W]) ⇒ BinarizedTree[M]

    Definition Classes
    Function2
    Annotations
    @unspecialized()
  12. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    Definition Classes
    Any
  18. def latent: (BinarizedTree[L], IndexedSeq[W]) ⇒ BinarizedTree[IndexedSeq[M]]

  19. def localized[C](proj: ProjectionIndexer[C, M]): (BinarizedTree[L], IndexedSeq[W]) ⇒ BinarizedTree[(C, Int)]

  20. def map[N](other: TreeAnnotator[M, W, N]): ComposedAnnotator[L, W, M, N]

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

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

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

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

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    TreeAnnotator → Function1 → Function2 → AnyRef → Any
  26. def tupled: ((BinarizedTree[L], Seq[W])) ⇒ BinarizedTree[M]

    Definition Classes
    Function2
    Annotations
    @unspecialized()
  27. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from (TreeInstance[L, W]) ⇒ TreeInstance[M, W]

Inherited from (BinarizedTree[L], Seq[W]) ⇒ BinarizedTree[M]

Inherited from AnyRef

Inherited from Any

Ungrouped