Answering Complex Queries on Legal Networks: A Direct and a Structured IR Approaches

Abstract

This paper highlights the benefit of semantic information retrieval in legal networks. User queries get more complex when they combine constraints on semantic content and intertextual links between documents. Comparing two methods of search in legal collection networks, we present new functionalities of search and browsing. Relying on a structured representation of the collection graph, the first approach allows for approximate answers and knowledge discovery. The second one supports richer semantics and scalability but offers fewer search functionalities. We indicate how those approaches could be combined to get the best of both.