edu.arizona.sista.processors.bionlp.ner

RuleNER

Related Docs: object RuleNER | package ner

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) 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
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

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

Value Members

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

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

  9. def finalize(): Unit

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

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

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

    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]

    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[_]

    Definition Classes
    AnyRef → Any

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

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. val knownCaseInsensitives: Set[String]

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

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

    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Remove single tokens that are not tagged as nouns

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

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    AnyRef → Any

  25. val useLemmas: Boolean

  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped