2020-07-22 14:42:59 +03:00
|
|
|
# cython: infer_types=True, profile=True, binding=True
|
2021-01-06 14:02:32 +03:00
|
|
|
from collections import defaultdict
|
2020-07-22 14:42:59 +03:00
|
|
|
from typing import Optional, Iterable
|
2020-07-31 00:30:54 +03:00
|
|
|
from thinc.api import Model, Config
|
2020-07-22 14:42:59 +03:00
|
|
|
|
2020-07-31 00:30:54 +03:00
|
|
|
from .transition_parser cimport Parser
|
|
|
|
from ._parser_internals.ner cimport BiluoPushDown
|
2020-07-22 14:42:59 +03:00
|
|
|
|
|
|
|
from ..language import Language
|
2020-09-24 21:38:57 +03:00
|
|
|
from ..scorer import get_ner_prf, PRFScore
|
2020-09-09 11:31:03 +03:00
|
|
|
from ..training import validate_examples
|
2020-07-22 14:42:59 +03:00
|
|
|
|
|
|
|
|
|
|
|
default_model_config = """
|
|
|
|
[model]
|
2020-12-18 13:56:57 +03:00
|
|
|
@architectures = "spacy.TransitionBasedParser.v2"
|
2020-09-23 14:35:09 +03:00
|
|
|
state_type = "ner"
|
|
|
|
extra_state_tokens = false
|
2020-07-22 14:42:59 +03:00
|
|
|
hidden_width = 64
|
|
|
|
maxout_pieces = 2
|
2020-12-18 13:56:57 +03:00
|
|
|
use_upper = true
|
2020-07-22 14:42:59 +03:00
|
|
|
|
|
|
|
[model.tok2vec]
|
2021-04-22 11:04:15 +03:00
|
|
|
@architectures = "spacy.HashEmbedCNN.v2"
|
2020-07-22 14:42:59 +03:00
|
|
|
pretrained_vectors = null
|
|
|
|
width = 96
|
|
|
|
depth = 4
|
|
|
|
embed_size = 2000
|
|
|
|
window_size = 1
|
|
|
|
maxout_pieces = 3
|
|
|
|
subword_features = true
|
|
|
|
"""
|
|
|
|
DEFAULT_NER_MODEL = Config().from_str(default_model_config)["model"]
|
|
|
|
|
|
|
|
|
|
|
|
@Language.factory(
|
|
|
|
"ner",
|
|
|
|
assigns=["doc.ents", "token.ent_iob", "token.ent_type"],
|
|
|
|
default_config={
|
|
|
|
"moves": None,
|
|
|
|
"update_with_oracle_cut_size": 100,
|
|
|
|
"model": DEFAULT_NER_MODEL,
|
2020-07-26 14:18:43 +03:00
|
|
|
},
|
2020-09-24 11:27:33 +03:00
|
|
|
default_score_weights={"ents_f": 1.0, "ents_p": 0.0, "ents_r": 0.0, "ents_per_type": None},
|
2020-07-27 13:27:40 +03:00
|
|
|
|
2020-07-22 14:42:59 +03:00
|
|
|
)
|
|
|
|
def make_ner(
|
|
|
|
nlp: Language,
|
|
|
|
name: str,
|
|
|
|
model: Model,
|
|
|
|
moves: Optional[list],
|
|
|
|
update_with_oracle_cut_size: int,
|
|
|
|
):
|
2020-08-09 15:46:13 +03:00
|
|
|
"""Create a transition-based EntityRecognizer component. The entity recognizer
|
|
|
|
identifies non-overlapping labelled spans of tokens.
|
2020-08-12 00:29:31 +03:00
|
|
|
|
2020-08-09 15:46:13 +03:00
|
|
|
The transition-based algorithm used encodes certain assumptions that are
|
|
|
|
effective for "traditional" named entity recognition tasks, but may not be
|
|
|
|
a good fit for every span identification problem. Specifically, the loss
|
|
|
|
function optimizes for whole entity accuracy, so if your inter-annotator
|
|
|
|
agreement on boundary tokens is low, the component will likely perform poorly
|
|
|
|
on your problem. The transition-based algorithm also assumes that the most
|
|
|
|
decisive information about your entities will be close to their initial tokens.
|
|
|
|
If your entities are long and characterised by tokens in their middle, the
|
|
|
|
component will likely do poorly on your task.
|
|
|
|
|
|
|
|
model (Model): The model for the transition-based parser. The model needs
|
|
|
|
to have a specific substructure of named components --- see the
|
|
|
|
spacy.ml.tb_framework.TransitionModel for details.
|
|
|
|
moves (list[str]): A list of transition names. Inferred from the data if not
|
|
|
|
provided.
|
|
|
|
update_with_oracle_cut_size (int):
|
|
|
|
During training, cut long sequences into shorter segments by creating
|
|
|
|
intermediate states based on the gold-standard history. The model is
|
|
|
|
not very sensitive to this parameter, so you usually won't need to change
|
|
|
|
it. 100 is a good default.
|
|
|
|
"""
|
2020-07-22 14:42:59 +03:00
|
|
|
return EntityRecognizer(
|
|
|
|
nlp.vocab,
|
|
|
|
model,
|
|
|
|
name,
|
|
|
|
moves=moves,
|
|
|
|
update_with_oracle_cut_size=update_with_oracle_cut_size,
|
2020-08-09 15:46:13 +03:00
|
|
|
multitasks=[],
|
|
|
|
min_action_freq=1,
|
|
|
|
learn_tokens=False,
|
2020-12-13 04:08:32 +03:00
|
|
|
beam_width=1,
|
|
|
|
beam_density=0.0,
|
|
|
|
beam_update_prob=0.0,
|
|
|
|
)
|
|
|
|
|
|
|
|
@Language.factory(
|
|
|
|
"beam_ner",
|
|
|
|
assigns=["doc.ents", "token.ent_iob", "token.ent_type"],
|
|
|
|
default_config={
|
|
|
|
"moves": None,
|
|
|
|
"update_with_oracle_cut_size": 100,
|
|
|
|
"model": DEFAULT_NER_MODEL,
|
|
|
|
"beam_density": 0.01,
|
|
|
|
"beam_update_prob": 0.5,
|
|
|
|
"beam_width": 32
|
|
|
|
},
|
|
|
|
default_score_weights={"ents_f": 1.0, "ents_p": 0.0, "ents_r": 0.0, "ents_per_type": None},
|
|
|
|
)
|
|
|
|
def make_beam_ner(
|
|
|
|
nlp: Language,
|
|
|
|
name: str,
|
|
|
|
model: Model,
|
|
|
|
moves: Optional[list],
|
|
|
|
update_with_oracle_cut_size: int,
|
|
|
|
beam_width: int,
|
|
|
|
beam_density: float,
|
|
|
|
beam_update_prob: float,
|
|
|
|
):
|
|
|
|
"""Create a transition-based EntityRecognizer component that uses beam-search.
|
|
|
|
The entity recognizer identifies non-overlapping labelled spans of tokens.
|
|
|
|
|
|
|
|
The transition-based algorithm used encodes certain assumptions that are
|
|
|
|
effective for "traditional" named entity recognition tasks, but may not be
|
|
|
|
a good fit for every span identification problem. Specifically, the loss
|
|
|
|
function optimizes for whole entity accuracy, so if your inter-annotator
|
|
|
|
agreement on boundary tokens is low, the component will likely perform poorly
|
|
|
|
on your problem. The transition-based algorithm also assumes that the most
|
|
|
|
decisive information about your entities will be close to their initial tokens.
|
|
|
|
If your entities are long and characterised by tokens in their middle, the
|
|
|
|
component will likely do poorly on your task.
|
|
|
|
|
|
|
|
model (Model): The model for the transition-based parser. The model needs
|
|
|
|
to have a specific substructure of named components --- see the
|
|
|
|
spacy.ml.tb_framework.TransitionModel for details.
|
|
|
|
moves (list[str]): A list of transition names. Inferred from the data if not
|
|
|
|
provided.
|
|
|
|
update_with_oracle_cut_size (int):
|
|
|
|
During training, cut long sequences into shorter segments by creating
|
|
|
|
intermediate states based on the gold-standard history. The model is
|
|
|
|
not very sensitive to this parameter, so you usually won't need to change
|
|
|
|
it. 100 is a good default.
|
|
|
|
beam_width (int): The number of candidate analyses to maintain.
|
|
|
|
beam_density (float): The minimum ratio between the scores of the first and
|
|
|
|
last candidates in the beam. This allows the parser to avoid exploring
|
|
|
|
candidates that are too far behind. This is mostly intended to improve
|
|
|
|
efficiency, but it can also improve accuracy as deeper search is not
|
|
|
|
always better.
|
|
|
|
beam_update_prob (float): The chance of making a beam update, instead of a
|
|
|
|
greedy update. Greedy updates are an approximation for the beam updates,
|
|
|
|
and are faster to compute.
|
|
|
|
"""
|
|
|
|
return EntityRecognizer(
|
|
|
|
nlp.vocab,
|
|
|
|
model,
|
|
|
|
name,
|
|
|
|
moves=moves,
|
|
|
|
update_with_oracle_cut_size=update_with_oracle_cut_size,
|
|
|
|
multitasks=[],
|
|
|
|
min_action_freq=1,
|
|
|
|
learn_tokens=False,
|
|
|
|
beam_width=beam_width,
|
|
|
|
beam_density=beam_density,
|
|
|
|
beam_update_prob=beam_update_prob,
|
2020-07-22 14:42:59 +03:00
|
|
|
)
|
|
|
|
|
|
|
|
|
|
|
|
cdef class EntityRecognizer(Parser):
|
|
|
|
"""Pipeline component for named entity recognition.
|
|
|
|
|
2021-01-30 12:09:38 +03:00
|
|
|
DOCS: https://spacy.io/api/entityrecognizer
|
2020-07-22 14:42:59 +03:00
|
|
|
"""
|
|
|
|
TransitionSystem = BiluoPushDown
|
|
|
|
|
|
|
|
def add_multitask_objective(self, mt_component):
|
2020-08-09 15:46:13 +03:00
|
|
|
"""Register another component as a multi-task objective. Experimental."""
|
2020-07-22 14:42:59 +03:00
|
|
|
self._multitasks.append(mt_component)
|
|
|
|
|
2020-09-29 19:33:16 +03:00
|
|
|
def init_multitask_objectives(self, get_examples, nlp=None, **cfg):
|
2020-08-09 15:46:13 +03:00
|
|
|
"""Setup multi-task objective components. Experimental and internal."""
|
2020-07-22 14:42:59 +03:00
|
|
|
# TODO: transfer self.model.get_ref("tok2vec") to the multitask's model ?
|
|
|
|
for labeller in self._multitasks:
|
|
|
|
labeller.model.set_dim("nO", len(self.labels))
|
|
|
|
if labeller.model.has_ref("output_layer"):
|
|
|
|
labeller.model.get_ref("output_layer").set_dim("nO", len(self.labels))
|
2020-09-29 19:33:16 +03:00
|
|
|
labeller.initialize(get_examples, nlp=nlp)
|
2020-07-22 14:42:59 +03:00
|
|
|
|
|
|
|
@property
|
|
|
|
def labels(self):
|
|
|
|
# Get the labels from the model by looking at the available moves, e.g.
|
|
|
|
# B-PERSON, I-PERSON, L-PERSON, U-PERSON
|
|
|
|
labels = set(move.split("-")[1] for move in self.move_names
|
|
|
|
if move[0] in ("B", "I", "L", "U"))
|
|
|
|
return tuple(sorted(labels))
|
Refactor the Scorer to improve flexibility (#5731)
* Refactor the Scorer to improve flexibility
Refactor the `Scorer` to improve flexibility for arbitrary pipeline
components.
* Individual pipeline components provide their own `evaluate` methods
that score a list of `Example`s and return a dictionary of scores
* `Scorer` is initialized either:
* with a provided pipeline containing components to be scored
* with a default pipeline containing the built-in statistical
components (senter, tagger, morphologizer, parser, ner)
* `Scorer.score` evaluates a list of `Example`s and returns a dictionary
of scores referring to the scores provided by the components in the
pipeline
Significant differences:
* `tags_acc` is renamed to `tag_acc` to be consistent with `token_acc`
and the new `morph_acc`, `pos_acc`, and `lemma_acc`
* Scoring is no longer cumulative: `Scorer.score` scores a list of
examples rather than a single example and does not retain any state
about previously scored examples
* PRF values in the returned scores are no longer multiplied by 100
* Add kwargs to Morphologizer.evaluate
* Create generalized scoring methods in Scorer
* Generalized static scoring methods are added to `Scorer`
* Methods require an attribute (either on Token or Doc) that is
used to key the returned scores
Naming differences:
* `uas`, `las`, and `las_per_type` in the scores dict are renamed to
`dep_uas`, `dep_las`, and `dep_las_per_type`
Scoring differences:
* `Doc.sents` is now scored as spans rather than on sentence-initial
token positions so that `Doc.sents` and `Doc.ents` can be scored with
the same method (this lowers scores since a single incorrect sentence
start results in two incorrect spans)
* Simplify / extend hasattr check for eval method
* Add hasattr check to tokenizer scoring
* Simplify to hasattr check for component scoring
* Reset Example alignment if docs are set
Reset the Example alignment if either doc is set in case the
tokenization has changed.
* Add PRF tokenization scoring for tokens as spans
Add PRF scores for tokens as character spans. The scores are:
* token_acc: # correct tokens / # gold tokens
* token_p/r/f: PRF for (token.idx, token.idx + len(token))
* Add docstring to Scorer.score_tokenization
* Rename component.evaluate() to component.score()
* Update Scorer API docs
* Update scoring for positive_label in textcat
* Fix TextCategorizer.score kwargs
* Update Language.evaluate docs
* Update score names in default config
2020-07-25 13:53:02 +03:00
|
|
|
|
|
|
|
def score(self, examples, **kwargs):
|
2020-07-27 19:11:45 +03:00
|
|
|
"""Score a batch of examples.
|
|
|
|
|
|
|
|
examples (Iterable[Example]): The examples to score.
|
2020-09-24 21:38:57 +03:00
|
|
|
RETURNS (Dict[str, Any]): The NER precision, recall and f-scores.
|
2020-07-27 19:11:45 +03:00
|
|
|
|
2021-01-30 12:09:38 +03:00
|
|
|
DOCS: https://spacy.io/api/entityrecognizer#score
|
2020-07-27 19:11:45 +03:00
|
|
|
"""
|
2020-08-12 00:29:31 +03:00
|
|
|
validate_examples(examples, "EntityRecognizer.score")
|
2020-11-03 17:47:18 +03:00
|
|
|
return get_ner_prf(examples)
|
2021-01-06 14:02:32 +03:00
|
|
|
|
|
|
|
def scored_ents(self, beams):
|
|
|
|
"""Return a dictionary of (start, end, label) tuples with corresponding scores
|
|
|
|
for each beam/doc that was processed.
|
|
|
|
"""
|
|
|
|
entity_scores = []
|
|
|
|
for beam in beams:
|
|
|
|
score_dict = defaultdict(float)
|
|
|
|
for score, ents in self.moves.get_beam_parses(beam):
|
|
|
|
for start, end, label in ents:
|
|
|
|
score_dict[(start, end, label)] += score
|
|
|
|
entity_scores.append(score_dict)
|
|
|
|
return entity_scores
|