case class ComposedAnnotator[L, W, M, N](a: TreeAnnotator[L, W, M], b: TreeAnnotator[M, W, N]) extends TreeAnnotator[L, W, N] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ComposedAnnotator
- Product
- Equals
- TreeAnnotator
- Serializable
- Serializable
- Function1
- Function2
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new ComposedAnnotator(a: TreeAnnotator[L, W, M], b: TreeAnnotator[M, W, N])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val a: TreeAnnotator[L, W, M]
-
final
def
andThen[N](other: TreeAnnotator[N, W, N]): ComposedAnnotator[L, W, N, N]
- Definition Classes
- TreeAnnotator
-
def
andThen[A](g: (TreeInstance[N, W]) ⇒ A): (TreeInstance[L, W]) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(tree: BinarizedTree[L], words: Seq[W]): BinarizedTree[N]
- Definition Classes
- ComposedAnnotator → TreeAnnotator → Function2
-
def
apply(ti: TreeInstance[L, W]): TreeInstance[N, W]
- Definition Classes
- TreeAnnotator → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val b: TreeAnnotator[M, W, N]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
compose[N](other: TreeAnnotator[N, W, L]): ComposedAnnotator[N, W, L, N]
- Definition Classes
- TreeAnnotator
-
def
compose[A](g: (A) ⇒ TreeInstance[L, W]): (A) ⇒ TreeInstance[N, W]
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
curried: (BinarizedTree[L]) ⇒ (Seq[W]) ⇒ BinarizedTree[N]
- Definition Classes
- Function2
- Annotations
- @unspecialized()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
latent: (BinarizedTree[L], IndexedSeq[W]) ⇒ BinarizedTree[IndexedSeq[N]]
- Definition Classes
- TreeAnnotator
-
def
localized[C](proj: ProjectionIndexer[C, N]): (BinarizedTree[L], IndexedSeq[W]) ⇒ BinarizedTree[(C, Int)]
- Definition Classes
- TreeAnnotator
-
def
map[N](other: TreeAnnotator[N, W, N]): ComposedAnnotator[L, W, N, N]
- Definition Classes
- TreeAnnotator
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- TreeAnnotator → Function1 → Function2 → AnyRef → Any
-
def
tupled: ((BinarizedTree[L], Seq[W])) ⇒ BinarizedTree[N]
- Definition Classes
- Function2
- Annotations
- @unspecialized()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )