|
Returns a list of tuples (start, end, signtup). These
represent spans to be added to the chart, start and
end being the start and end nodes.
Each signtup is a (sign,tag,probability) tuple representing a sign
that the tagger wishes to add to the chart in this position. How many are
returned is up to the tagger (it may wish to return more in cases where
there are no clear winners, for example). If the tag is not found in the
grammar, sign will be None.
Returned list is sorted by probability, highest first.
offset may be set >0 in order to retrieve further signs once some
have already been returned. If offset=k, the tagger should disregard all
the signs that would have been returned for offset<k and return the
next bunch - as many as it sees fit. offset is incremented each time the
parse fails.
The simplest approach, and that employed by most taggers, has some
signs for each word and none spanning more than one word. That is, the
tuples in the list would be of the form (wordnum, wordnum+1,
signtup). This is by no means required, though: some taggers will
want to add multi-node spans to the chart.
- Overrides:
tagger.Tagger.get_signs
- (inherited documentation)
|