              """
              cdef int nr_iter = 0
              cdef const TokenC* ptr = self.c - (self.i - self.c.l_edge)
              while ptr < self.c:
                  # If this head is still to the right of us, we can skip to it
                  # No token that's between this token and this head could be our
                  # child.
                  if (ptr.head >= 1) and (ptr + ptr.head) < self.c:
                      ptr += ptr.head
  
                  elif ptr + ptr.head == self.c:
                      yield self.doc[ptr - (self.c - self.i)]
                      ptr += 1
                  else:
                      ptr += 1
                  nr_iter += 1
 
</s> remove                 # If this head is still to the right of us, we can skip to it
                # No token that's between this token and this head could be our
                # child.
                if (ptr.head < 0) and ((ptr + ptr.head) > self.c):
                    ptr += ptr.head
                elif ptr + ptr.head == self.c:
 </s> add                 if ptr + ptr.head == self.c: </s> remove                     ptr += 1
                else:
                    ptr += 1
 </s> add                 ptr += 1 </s> remove                     ptr -= 1
                else:
                    ptr -= 1
 </s> add                 ptr -= 1
                nr_iter += 1 </s> remove         smallest_np_arc = self._get_smallest_nonproj_arc(proj_heads)
 </s> add         smallest_np_arc = cls._get_smallest_nonproj_arc(proj_heads) </s> remove         newheads, newlabels = copy(heads), copy(labels)
        spans = None
        for tokenid, head in enumerate(heads):
            if labels[tokenid].find('||') != -1:
                newlabel,_,headlabel = labels[tokenid].partition('||')
                newhead = self._find_new_head(head,tokenid,headlabel,heads,labels,spans=spans)
                newheads[tokenid] = newhead
                newlabels[tokenid] = newlabel
        return newheads, newlabels


    def _decorate(self, heads, proj_heads, labels):
 </s> add         parse = tokens.to_array([HEAD, DEP])
        labels = [ tokens.vocab.strings[int(p[1])] for p in parse ]
        for token in tokens:
            if cls.is_decorated(token.dep_):
                newlabel,headlabel = cls.decompose(token.dep_)
                newhead = cls._find_new_head(token,headlabel)
                parse[token.i,1] = tokens.vocab.strings[newlabel]
                parse[token.i,0] = newhead.i - token.i
        tokens.from_array([HEAD, DEP],parse)


    @classmethod
    def _decorate(cls, heads, proj_heads, labels):
                if ptr + ptr.head == self.c:
              """
              cdef int nr_iter = 0
              cdef const TokenC* ptr = self.c - (self.i - self.c.l_edge)
              while ptr < self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                if ptr + ptr.head == self.c:
                      yield self.doc[ptr - (self.c - self.i)]
                      ptr += 1
                  else:
                      ptr += 1
                  nr_iter += 1
keep keep keep keep replace replace replace replace replace replace replace keep keep keep keep keep
 integrated pseudo-projective parsing into parser

- nonproj.pyx holds a class PseudoProjectivity which currently holds
  all functionality to implement Nivre & Nilsson 2005's pseudo-projective
  parsing using the HEAD decoration scheme
- changed lefts/rights in Token to account for possible non-projective
  structures 
spacy/tokens/token.pyx