Some remarks on vector representations of legal documents

Vector representation of legal documents is still the best way for computing classification clusters and labelling of its contents. This paper deals with the problem of diversity of legal documents making vector representation a difficult task. Extensive experiments with three text corpora of about 580 documents in three languages have shown that binary or weighted vector representation may not be sufficient. Even quite successful approaches of similarity computation have problems in identifying the best context of classification. The LabelSOM method can be seen as a very efficient tool for verification of similarity because common elements are explicitly identified. Finally, some proposals for the “best” vector representation are discussed: weighted vectors, feature vectors and hierarchies of vectors using XML information for identifying similar contexts