epic.parser

Parser

final case class Parser[L, W](topology: RuleTopology[L], lexicon: Lexicon[L, W], constraintsFactory: Factory[L, W], marginalFactory: Factory[L, W], decoder: ChartDecoder[L, W] = ChartDecoder.apply[L, W]())(implicit debinarizer: Debinarizer[L]) extends (IndexedSeq[W]) ⇒ Tree[L] with Product with Serializable

A Parser produces a syntactic representation of a sentence, called a epic.trees.Tree, which has internal nodes that demarcate syntactic functions

Annotations
@SerialVersionUID( 2L )
Linear Supertypes
Serializable, Serializable, Product, Equals, (IndexedSeq[W]) ⇒ Tree[L], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Parser
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Function1
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Parser(topology: RuleTopology[L], lexicon: Lexicon[L, W], constraintsFactory: Factory[L, W], marginalFactory: Factory[L, W], decoder: ChartDecoder[L, W] = ChartDecoder.apply[L, W]())(implicit debinarizer: Debinarizer[L])

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. def andThen[A](g: (Tree[L]) ⇒ A): (IndexedSeq[W]) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  7. def apply(s: IndexedSeq[W]): Tree[L]

    Returns the best parse (calls bestParse) for the sentence.

    Returns the best parse (calls bestParse) for the sentence.

    s

    the sentence

    Definition Classes
    Parser → Function1

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  9. def bestBinarizedTree(s: IndexedSeq[W]): BinarizedTree[L]

    Returns the best parse for the sentence without debinarizing

    Returns the best parse for the sentence without debinarizing

    s

    sentence

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  11. def compose[A](g: (A) ⇒ IndexedSeq[W]): (A) ⇒ Tree[L]

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  12. val constraintsFactory: Factory[L, W]

  13. implicit val debinarizer: Debinarizer[L]

  14. val decoder: ChartDecoder[L, W]

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

    Definition Classes
    AnyRef

  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. val lexicon: Lexicon[L, W]

  20. def marginal(w: IndexedSeq[W]): ParseMarginal[L, W]

  21. val marginalFactory: Factory[L, W]

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

    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  26. def toString(): String

    Definition Classes
    Function1 → AnyRef → Any

  27. val topology: RuleTopology[L]

  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  30. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from (IndexedSeq[W]) ⇒ Tree[L]

Inherited from AnyRef

Inherited from Any

Ungrouped