edu.knowitall.openparse

BuildPatterns

object BuildPatterns

A main method for creating patterns from a lemma grep. A lemma grep is a file that has an extraction and a sentence that contains the lemmas in the extraction.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BuildPatterns
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class InvalidBipathException extends RuntimeException

  2. class NoRelationNodeException extends NoSuchElementException

  3. class Settings extends AnyRef

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. val CHUNK_SIZE: Int

  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 eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

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

  12. def findBipaths(lemmas: Set[String], graph: DependencyGraph, maxLength: Option[Int]): Set[Bipath[DependencyNode]]

  13. def findPattern(graph: DependencyGraph, lemmas: Set[String], replacements: Map[String, String], maxLength: Option[Int]): Set[ExtractorPattern]

  14. def findPatterns(graph: DependencyGraph, lemmas: Set[String], replacements: Map[String, String], rel: String, maxLength: Option[Int]): List[(ExtractorPattern, List[String])]

  15. def findRelationPatterns(graph: DependencyGraph, rel: String, arg1: String, arg2: String, lemmas: Set[String], maxLength: Option[Int] = None): List[(ExtractorPattern, List[String])]

    Find patterns in the graph that connect arg1, rel, and arg2.

    Find patterns in the graph that connect arg1, rel, and arg2.

    graph

    the graph to find the pattern in.

    rel

    the relation

    arg1

    the argument 1

    arg2

    the argument 2

    lemmas

    all lemmas in rel, arg1, and arg2

    maxLength

    the maximum path length, in edges

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

    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. val logger: Logger

  20. def main(settings: Settings): Unit

  21. def main(args: Array[String]): Unit

  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
    AnyRef → Any

  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 AnyRef

Inherited from Any

Ungrouped