Appellate Court Modifications Extraction for Portuguese

被引:9
作者
Fernandes, William Paulo Ducca [1 ]
Silva, Luiz Jose Schirmer [1 ]
Frajhof, Isabella Zalcberg [1 ]
Couto Fernandes de Almeida, Guilherme da Franca [1 ]
Konder, Carlos Nelson [1 ]
Nasser, Rafael Barbosa [1 ]
de Carvalho, Gustavo Robichez [1 ]
Barbosa, Simone Diniz Junqueira [1 ]
Lopes, Helio Cortes Vieira [1 ]
机构
[1] Pontificia Univ Catolica Rio de Janeiro PUC Rio, Rua Marques de Sao Vicente,225 Gavea, BR-22451045 Rio De Janeiro, RJ, Brazil
关键词
Natural language processing; Deep Learning; Recurrent Neural Networks; Long Short-Term Memory; Gated Recurrent Units; Machine Learning; Conditional Random Fields; Information extraction; Law; Modificatory provisions; CLASSIFICATION;
D O I
10.1007/s10506-019-09256-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Appellate Court Modifications Extraction consists of, given an Appellate Court decision, identifying the proposed modifications by the upper Court of the lower Court judge's decision. In this work, we propose a system to extract Appellate Court Modifications for Portuguese. Information extraction for legal texts has been previously addressed using different techniques and for several languages. Our proposal differs from previous work in two ways: (1) our corpus is composed of Brazilian Appellate Court decisions, in which we look for a set of modifications provided by the Court; and (2) to automatically extract the modifications, we use a traditional Machine Learning approach and a Deep Learning approach, both as alternative solutions and as a combined solution. We tackle the Appellate Court Modifications Extraction task, experimenting with a wide variety of methods. In order to train and evaluate the system, we have built theKauaneJuniorcorpus, using public data disclosed by the Appellate State Court of Rio de Janeiro jurisprudence database. Our best method, which is a Bidirectional Long Short-Term Memory network combined with Conditional Random Fields, obtained an F-beta=1 score of 94.79%.
引用
收藏
页码:327 / 360
页数:34
相关论文
共 47 条
[1]   Named Entity Recognition, Linking and Generation for Greek Legislation [J].
Angelidis, Iosif ;
Chalkidis, Ilias ;
Koubarakis, Manolis .
LEGAL KNOWLEDGE AND INFORMATION SYSTEMS (JURIX 2018), 2018, 313 :1-10
[2]  
[Anonymous], 2003, P 41 ANN M ASS COMP
[3]  
[Anonymous], 2007, P 45 ANN M ASS COMP
[4]  
[Anonymous], 2011, P 49 ANN M ASS COMP
[5]   LEARNING LONG-TERM DEPENDENCIES WITH GRADIENT DESCENT IS DIFFICULT [J].
BENGIO, Y ;
SIMARD, P ;
FRASCONI, P .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (02) :157-166
[6]  
Bevan D, 2018, INT SYMP INERT SENSO, P171
[7]   Learning from syntax generalizations for automatic semantic annotation [J].
Boella, Guido ;
Di Caro, Luigi ;
Ruggeri, Alice ;
Robaldo, Livio .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2014, 43 (02) :231-246
[8]  
Brasil, 2008, COD CIV BRAS LEG COR
[9]  
Carletta J, 1996, COMPUT LINGUIST, V22, P249
[10]   A Deep Learning Approach to Contract Element Extraction [J].
Chalkidis, Ilias ;
Androutsopoulos, Ion .
LEGAL KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 302 :155-164