EnsembleModel

Instance Constructors

new EnsembleModel(individualOutputs: Array[DirectedGraph[String]])

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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
val individualOutputs: Array[DirectedGraph[String]]
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def parse(): DirectedGraph[String]
def parseAttardi(): DirectedGraph[String]

Produces an ensemble parse that is guaranteed to not have cycles (using the Attardi algorithm) Based on the paper: "Reverse Revision and Linear Tree Combination for Dependency Parsing" by Attardi and Dell'Orletta
Produces an ensemble parse that is guaranteed to not have cycles (using the Attardi algorithm) Based on the paper: "Reverse Revision and Linear Tree Combination for Dependency Parsing" by Attardi and Dell'Orletta
returns
the DirectedGraph corresponding to the ensemble parse
def parseVoting(): DirectedGraph[String]

Produces an ensemble parse using the word-by-word voting scheme from Surdeanu et al.
Produces an ensemble parse using the word-by-word voting scheme from Surdeanu et al. (2010) Note: this works well and is fast, but it does not guarantee that the output is a tree
returns
the DirectedGraph corresponding to the ensemble parse
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toDependencyList(individualOutputs: Array[DirectedGraph[String]]): List[Dependency]
def toDependencyMap(individualOutputs: Array[DirectedGraph[String]]): Map[(Int, Int, String), HashSet[Int]]
def toDirectedGraph(deps: List[Dependency]): DirectedGraph[String]
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

Related Doc: package syntax

class EnsembleModel extends AnyRef

Instance Constructors

new EnsembleModel(individualOutputs: Array[DirectedGraph[String]])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val individualOutputs: Array[DirectedGraph[String]]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parse(): DirectedGraph[String]

def parseAttardi(): DirectedGraph[String]

def parseVoting(): DirectedGraph[String]

final def synchronized[T0](arg0: ⇒ T0): T0

def toDependencyList(individualOutputs: Array[DirectedGraph[String]]): List[Dependency]

def toDependencyMap(individualOutputs: Array[DirectedGraph[String]]): Map[(Int, Int, String), HashSet[Int]]

def toDirectedGraph(deps: List[Dependency]): DirectedGraph[String]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped