mirror of
https://github.com/explosion/spaCy.git
synced 2024-09-21 19:39:13 +03:00
827b5af697
Model is good, but code is messy. Currently requires Chainer, which may cause the build to fail on machines without a GPU. Outline of the model: We first predict context-sensitive vectors for each word in the input: (embed_lower | embed_prefix | embed_suffix | embed_shape) >> Maxout(token_width) >> convolution ** 4 This convolutional layer is shared between the tagger and the parser. This prevents the parser from needing tag features. To boost the representation, we make a "super tag" with POS, morphology and dependency label. The tagger predicts this by adding a softmax layer onto the convolutional layer --- so, we're teaching the convolutional layer to give us a representation that's one affine transform from this informative lexical information. This is obviously good for the parser (which backprops to the convolutions too). The parser model makes a state vector by concatenating the vector representations for its context tokens. Current results suggest few context tokens works well. Maybe this is a bug. The current context tokens: * S0, S1, S2: Top three words on the stack * B0, B1: First two words of the buffer * S0L1, S0L2: Leftmost and second leftmost children of S0 * S0R1, S0R2: Rightmost and second rightmost children of S0 * S1L1, S1L2, S1R2, S1R, B0L1, B0L2: Likewise for S1 and B0 This makes the state vector quite long: 13*T, where T is the token vector width (128 is working well). Fortunately, there's a way to structure the computation to save some expense (and make it more GPU friendly). The parser typically visits 2*N states for a sentence of length N (although it may visit more, if it back-tracks with a non-monotonic transition). A naive implementation would require 2*N (B, 13*T) @ (13*T, H) matrix multiplications for a batch of size B. We can instead perform one (B*N, T) @ (T, 13*H) multiplication, to pre-compute the hidden weights for each positional feature wrt the words in the batch. (Note that our token vectors come from the CNN -- so we can't play this trick over the vocabulary. That's how Stanford's NN parser works --- and why its model is so big.) This pre-computation strategy allows a nice compromise between GPU-friendliness and implementation simplicity. The CNN and the wide lower layer are computed on the GPU, and then the precomputed hidden weights are moved to the CPU, before we start the transition-based parsing process. This makes a lot of things much easier. We don't have to worry about variable-length batch sizes, and we don't have to implement the dynamic oracle in CUDA to train. Currently the parser's loss function is multilabel log loss, as the dynamic oracle allows multiple states to be 0 cost. This is defined as: (exp(score) / Z) - (exp(score) / gZ) Where gZ is the sum of the scores assigned to gold classes. I'm very interested in regressing on the cost directly, but so far this isn't working well. Machinery is in place for beam-search, which has been working well for the linear model. Beam search should benefit greatly from the pre-computation trick.
88 lines
2.6 KiB
Cython
88 lines
2.6 KiB
Cython
# coding: utf-8
|
|
# cython: infer_types=True
|
|
from __future__ import unicode_literals
|
|
|
|
from libc.string cimport memcpy, memset
|
|
from libc.stdint cimport uint32_t, uint64_t
|
|
|
|
from ..vocab cimport EMPTY_LEXEME
|
|
from ..structs cimport Entity
|
|
from ..lexeme cimport Lexeme
|
|
from ..symbols cimport punct
|
|
from ..attrs cimport IS_SPACE
|
|
from ..attrs cimport attr_id_t
|
|
from ..tokens.token cimport Token
|
|
|
|
|
|
cdef class StateClass:
|
|
def __init__(self, int length):
|
|
cdef Pool mem = Pool()
|
|
self.mem = mem
|
|
|
|
def __dealloc__(self):
|
|
del self.c
|
|
|
|
@property
|
|
def stack(self):
|
|
return {self.S(i) for i in range(self.c._s_i)}
|
|
|
|
@property
|
|
def queue(self):
|
|
return {self.B(i) for i in range(self.c.buffer_length())}
|
|
|
|
@property
|
|
def token_vector_lenth(self):
|
|
return self.doc.tensor.shape[1]
|
|
|
|
def py_is_final(self):
|
|
return self.c.is_final()
|
|
|
|
def print_state(self, words):
|
|
words = list(words) + ['_']
|
|
top = words[self.S(0)] + '_%d' % self.S_(0).head
|
|
second = words[self.S(1)] + '_%d' % self.S_(1).head
|
|
third = words[self.S(2)] + '_%d' % self.S_(2).head
|
|
n0 = words[self.B(0)]
|
|
n1 = words[self.B(1)]
|
|
return ' '.join((third, second, top, '|', n0, n1))
|
|
|
|
@classmethod
|
|
def nr_context_tokens(cls, int nF, int nB, int nS, int nL, int nR):
|
|
return 13
|
|
|
|
def set_context_tokens(self, int[:] output, nF=1, nB=0, nS=2,
|
|
nL=2, nR=2):
|
|
output[0] = self.B(0)
|
|
output[1] = self.B(1)
|
|
output[2] = self.S(0)
|
|
output[3] = self.S(1)
|
|
output[4] = self.S(2)
|
|
output[5] = self.L(self.S(0), 1)
|
|
output[6] = self.L(self.S(0), 2)
|
|
output[6] = self.R(self.S(0), 1)
|
|
output[7] = self.L(self.B(0), 1)
|
|
output[8] = self.R(self.S(0), 2)
|
|
output[9] = self.L(self.S(1), 1)
|
|
output[10] = self.L(self.S(1), 2)
|
|
output[11] = self.R(self.S(1), 1)
|
|
output[12] = self.R(self.S(1), 2)
|
|
|
|
def set_attributes(self, uint64_t[:, :] vals, int[:] tokens, int[:] names):
|
|
cdef int i, j, tok_i
|
|
for i in range(tokens.shape[0]):
|
|
tok_i = tokens[i]
|
|
if tok_i >= 0:
|
|
token = &self.c._sent[tok_i]
|
|
for j in range(names.shape[0]):
|
|
vals[i, j] = Token.get_struct_attr(token, <attr_id_t>names[j])
|
|
else:
|
|
vals[i] = 0
|
|
|
|
def set_token_vectors(self, tokvecs,
|
|
all_tokvecs, int[:] indices):
|
|
for i in range(indices.shape[0]):
|
|
if indices[i] >= 0:
|
|
tokvecs[i] = all_tokvecs[indices[i]]
|
|
else:
|
|
tokvecs[i] = 0
|