Class/Object

org.clulab.processors.bionlp.ner

RuleNER

Related Docs: object RuleNER | package ner

Permalink

class RuleNER extends AnyRef

Rule-based NER for the Bio domain If useLemmas is true, tokens are matched using lemmas, otherwise using words knownCaseInsensitives contains single-token entities that can be spelled using lower case, according to the KB(s) The order of the matchers is important: it indicates priority during ties (first has higher priority) User: mihais Date: 5/11/15

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RuleNER
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RuleNER(matchers: Array[(String, HashTrie)], useLemmas: Boolean)

    Permalink

  2. new RuleNER(matchers: Array[(String, HashTrie)], knownCaseInsensitives: Set[String], useLemmas: Boolean = false)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def filterMatches(labels: Array[String], sentence: Sentence): Array[String]

    Permalink

  9. def finalize(): Unit

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

  10. def find(sentence: Sentence): Array[String]

    Permalink

  11. def findByPriority(sentence: Sentence): Array[String]

    Permalink

    Inspects matchers in the order provided in the constructor This means that a matcher with higher priority is preferred even if a longer one (with lower priority) exists!

  12. def findLongestMatch(sentence: Sentence): Array[String]

    Permalink

    Finds the longest match across all matchers.

    Finds the longest match across all matchers. This means that the longest match is always chosen, even if coming from a matcher with lower priority Only ties are disambiguated according to the order provided in the constructor

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

    Permalink
    Definition Classes
    AnyRef → Any

  14. def getTokens(sentence: Sentence): Array[String]

    Permalink

  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  17. val knownCaseInsensitives: Set[String]

    Permalink

  18. val matchers: Array[(String, HashTrie)]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  22. def removeSinglePrepositions(labels: Array[String], sentence: Sentence): Array[String]

    Permalink

    Remove single tokens that are not tagged as nouns

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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. val useLemmas: Boolean

    Permalink

  26. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped