On natural language processing of laws

Abstract

To make legal texts machine processable, the texts may be represented as linked documents, semantically tagged text, or translated to formal representations that can be automatically reasoned with. The paper considers the latter, which is key to testing consistency of laws, drawing inferences, and providing explanations relative to input. To translate laws to a form that can be reasoned with by a com- puter, sentences must be parsed and formally represented. The paper presents the state-of-the-art in automatic translation of law to a machine readable formal rep- resentation, provides corpora, outlines some key problems, and proposes tasks to address the problems.