              if chunk[0].isalpha() and chunk[0].islower():
                  chunk = chunk[0].title() + chunk[1:]
                  lex = lex[0].title() + lex[1:]
                  seen.add(chunk)
                  entries.append((chunk, lex, pieces))
      return entries
 
</s> remove                 lex = lex[0].title() + lex[1:]
 </s> add                 pieces[0] = pieces[0][0].title() + pieces[0][1:] </s> remove             entries.append((chunk, lex, pieces))
 </s> add             entries.append((chunk, list(pieces))) </s> remove             lex = pieces.pop(0)
 </s> add  </s> remove     cdef Lexeme* new_lexeme(self, unicode key, unicode string) except NULL:
 </s> add     cdef Lexeme** lookup_chunk(self, unicode string) except NULL:
        assert len(string) != 0
        cdef Lexeme** chunk = <Lexeme**>self.chunks[hash(string)]
        cdef int split
        if chunk == NULL:
            chunk = self.new_chunk(string, self.find_substrings(string))
        return chunk

    cdef Lexeme** new_chunk(self, unicode string, list substrings) except NULL:
        cdef Lexeme** chunk = <Lexeme**>calloc(len(substrings) + 1, sizeof(Lexeme*))
        for i, substring in enumerate(substrings):
            chunk[i] = self.lookup(substring)
        chunk[i + 1] = NULL
        self.chunks[hash(string)] = <size_t>chunk
        return chunk

    cdef Lexeme* new_lexeme(self, unicode string) except NULL: </s> remove     chunk, lex, pieces = aint
 </s> add     chunk, pieces = aint
                entries.append((chunk, pieces))
              if chunk[0].isalpha() and chunk[0].islower():
                  chunk = chunk[0].title() + chunk[1:]
                  lex = lex[0].title() + lex[1:]
                  seen.add(chunk)
                entries.append((chunk, pieces))
      return entries
keep keep keep keep replace keep
 * Refactor spacy so that chunks return arrays of lexemes, so that there is properly one lexeme per word. 
spacy/util.py