tokens: I 'd like to find for each row in the big list the ' closest ' row in the little list , as defined by the euclidean norm ( i.e . sum of squared distances between the corresponding values in the k =3 dimension ) .
ner_tags: O O O O O O O B-Data_Structure O O O B-Data_Structure O O O O B-Data_Structure O O O B-Data_Structure O O O O O O O O O O O O O O O O O O O O B-Code_Block I-Code_Block O O O