首页 > 最新文献

Artificial Intelligence and Law最新文献

英文 中文
AI, Law and beyond. A transdisciplinary ecosystem for the future of AI & Law 人工智能、法律及其他。人工智能与法律未来的跨学科生态系统
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-16 DOI: 10.1007/s10506-024-09404-y
Floris J. Bex

We live in exciting times for AI and Law: technical developments are moving at a breakneck pace, and at the same time, the call for more robust AI governance and regulation grows stronger. How should we as an AI & Law community navigate these dramatic developments and claims? In this Presidential Address, I present my ideas for a way forward: researching, developing and evaluating real AI systems for the legal field with researchers from AI, Law and beyond. I will demonstrate how we at the Netherlands National Police Lab AI are developing responsible AI by combining insights from different disciplines, and how this connects to the future of our field.

{"title":"AI, Law and beyond. A transdisciplinary ecosystem for the future of AI & Law","authors":"Floris J. Bex","doi":"10.1007/s10506-024-09404-y","DOIUrl":"10.1007/s10506-024-09404-y","url":null,"abstract":"<div><p>We live in exciting times for AI and Law: technical developments are moving at a breakneck pace, and at the same time, the call for more robust AI governance and regulation grows stronger. How should we as an AI &amp; Law community navigate these dramatic developments and claims? In this Presidential Address, I present my ideas for a way forward: researching, developing and evaluating real AI systems for the legal field with researchers from AI, Law and beyond. I will demonstrate how we at the Netherlands National Police Lab AI are developing responsible AI by combining insights from different disciplines, and how this connects to the future of our field.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"253 - 270"},"PeriodicalIF":3.1,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10506-024-09404-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140969820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to: Reasoning with inconsistent precedents 更正:根据不一致的先例进行推理
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-02-16 DOI: 10.1007/s10506-024-09392-z
Ilaria Canavotto
{"title":"Correction to: Reasoning with inconsistent precedents","authors":"Ilaria Canavotto","doi":"10.1007/s10506-024-09392-z","DOIUrl":"10.1007/s10506-024-09392-z","url":null,"abstract":"","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"167 - 170"},"PeriodicalIF":3.1,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139961378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Toward representing interpretation in factor-based models of precedent 在基于因素的先例模型中体现解释力
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-01-12 DOI: 10.1007/s10506-023-09384-5
Adam Rigoni

This article discusses the desirability and feasibility of modeling precedents with multiple interpretations within factor-based models of precedential constraint. The main idea is that allowing multiple reasonable interpretations of cases and modeling precedential constraint as a function of what all reasonable interpretations compel may be advantageous. The article explains the potential benefits of extending the models in this way with a focus on incorporating a theory of vertical precedent in U.S. federal appellate courts. It also considers the costs of extending the models in this way, such as the significant increase in the functional size of the case base and the need to provide some kind of ordering on interpretations to select a “best” interpretation. Finally, the article suggests partially incorporating multiple interpretations of dimensions as a realistic starting point for incorporating interpretations generally, and shows how doing so can help address difficulties with dimensions. The conclusion remarks on the use of interpretations to deal with inconsistent precedents.

{"title":"Toward representing interpretation in factor-based models of precedent","authors":"Adam Rigoni","doi":"10.1007/s10506-023-09384-5","DOIUrl":"10.1007/s10506-023-09384-5","url":null,"abstract":"<div><p>This article discusses the desirability and feasibility of modeling precedents with multiple interpretations within factor-based models of precedential constraint. The main idea is that allowing multiple reasonable interpretations of cases and modeling precedential constraint as a function of what all reasonable interpretations compel may be advantageous. The article explains the potential benefits of extending the models in this way with a focus on incorporating a theory of vertical precedent in U.S. federal appellate courts. It also considers the costs of extending the models in this way, such as the significant increase in the functional size of the case base and the need to provide some kind of ordering on interpretations to select a “best” interpretation. Finally, the article suggests partially incorporating multiple interpretations of dimensions as a realistic starting point for incorporating interpretations generally, and shows how doing so can help address difficulties with dimensions. The conclusion remarks on the use of interpretations to deal with inconsistent precedents.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"199 - 226"},"PeriodicalIF":3.1,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139533373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DiscoLQA: zero-shot discourse-based legal question answering on European Legislation DiscoLQA:关于欧洲立法的基于零镜头话语的法律问题解答
IF 4.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-01-10 DOI: 10.1007/s10506-023-09387-2
Francesco Sovrano, Monica Palmirani, Salvatore Sapienza, Vittoria Pistone
{"title":"DiscoLQA: zero-shot discourse-based legal question answering on European Legislation","authors":"Francesco Sovrano, Monica Palmirani, Salvatore Sapienza, Vittoria Pistone","doi":"10.1007/s10506-023-09387-2","DOIUrl":"https://doi.org/10.1007/s10506-023-09387-2","url":null,"abstract":"","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"4 23","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139439836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A neural network to identify requests, decisions, and arguments in court rulings on custody 识别法院监护权裁决中的请求、决定和论据的神经网络
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-01-09 DOI: 10.1007/s10506-023-09380-9
José Félix Muñoz-Soro, Rafael del Hoyo Alonso, Rosa Montañes, Francisco Lacueva

Court rulings are among the most important documents in all legal systems. This article describes a study in which natural language processing is used for the automatic characterization of Spanish judgments that deal with the physical custody (joint or individual) of minors. The model was trained to identify a set of elements: the type of custody requested by the plaintiff, the type of custody decided on by the court, and eight of the most commonly used arguments in this type of judgment. Two jurists independently annotated more than 3000 judgments, which were used to train a model based on transformers. The main difficulties encountered in this task were the complexity of the judicial language and the need to work with appellate court rulings that have a more complicated structure than decisions at first instance. For the complete court rulings, the F1 score of the inter-annotator agreement ranged from 0.60 to 0.86 and the Kappa index from 0.33 to 0.73. The F1 score of the agreement between the model and the annotators ranged from 0.66 to 0.93 and the Kappa index from 0.57 to 0.80. These results in which the model performance exceeds even the inter-annotator agreement show the high ability of transformers to identify abstract entities in legal texts.

{"title":"A neural network to identify requests, decisions, and arguments in court rulings on custody","authors":"José Félix Muñoz-Soro,&nbsp;Rafael del Hoyo Alonso,&nbsp;Rosa Montañes,&nbsp;Francisco Lacueva","doi":"10.1007/s10506-023-09380-9","DOIUrl":"10.1007/s10506-023-09380-9","url":null,"abstract":"<div><p>Court rulings are among the most important documents in all legal systems. This article describes a study in which natural language processing is used for the automatic characterization of Spanish judgments that deal with the physical custody (joint or individual) of minors. The model was trained to identify a set of elements: the type of custody requested by the plaintiff, the type of custody decided on by the court, and eight of the most commonly used arguments in this type of judgment. Two jurists independently annotated more than 3000 judgments, which were used to train a model based on transformers. The main difficulties encountered in this task were the complexity of the judicial language and the need to work with appellate court rulings that have a more complicated structure than decisions at first instance. For the complete court rulings, the F1 score of the inter-annotator agreement ranged from 0.60 to 0.86 and the Kappa index from 0.33 to 0.73. The F1 score of the agreement between the model and the annotators ranged from 0.66 to 0.93 and the Kappa index from 0.57 to 0.80. These results in which the model performance exceeds even the inter-annotator agreement show the high ability of transformers to identify abstract entities in legal texts.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"101 - 135"},"PeriodicalIF":3.1,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10506-023-09380-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139444496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cytomorphological traits of fine-needle aspirates of hyalinizing trabecular tumor of the thyroid gland: A brief report. 甲状腺透明小梁瘤细针穿刺细胞形态学特征:简要报告。
IF 1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-01-01 DOI: 10.4103/ijpm.ijpm_405_22
Fei Wang, Yufei Liu

Background: The incidence of thyroid tumor is increasing, and preoperative diagnosis of hyalinizing trabecular tumor (HTT) is difficult.

Aim: To investigate the cytological features of HTT of the thyroid gland.

Settings and design: A retrospective observational study.

Materials and methods: Ultrasonography, preoperative needle aspiration cytology, postoperative histopathology, immunohistochemistry, and BRAF V600E gene test were performed in five patients with HTT to analyze the pathological characteristics of the patients and review the relevant literature.

Results: Four female and one male patients with HTT were recruited. Fine-needle aspiration cytology (FNAC) showed bloodstained background tumor cells with multiple morphologies. The tumor cells exhibited ovoid nuclei, abundant cytoplasm, fine chromatin, nuclear crowding and overlapping, and small nucleoli. Focal nuclear pseudoinclusions and grooves were present. No papillary structures or psammoma bodies were observed. In all cases, tumor cells were radially distributed around the eosinophilic extracellular matrix. In 40% (2 in 5) of cases, trabecular patterns of elongated tumor cells were present, with their nuclei staggered along the longitudinal axis of tumor cells in the trabeculae. FNAC suggested two cases of HTT and three cases of papillary thyroid cancer. Post-operational biopsy indicated they were HTT cases.

Conclusion: HTT is a rare thyroid tumor with non-specific clinical manifestations. It can be misinterpreted as papillary thyroid carcinoma by FNAC. However, its cytomorphological traits are helpful in the diagnosis. In combination with FNAC, immunohistochemistry, and molecular testing, HTT can be accurately diagnosed.

背景:甲状腺肿瘤的发病率越来越高,而透明小梁瘤(HTT)的术前诊断非常困难。目的:研究甲状腺HTT的细胞学特征:材料与方法:超声波检查、术前小梁瘤细胞学检查:对5例HTT患者进行超声波检查、术前针吸细胞学检查、术后组织病理学检查、免疫组化检查和BRAF V600E基因检测,分析患者的病理特征并回顾相关文献:结果:共招募了四名女性和一名男性 HTT 患者。细针穿刺细胞学检查(FNAC)显示血染的背景肿瘤细胞具有多种形态。肿瘤细胞核呈卵圆形,胞浆丰富,染色质细腻,核拥挤和重叠,核小。存在局灶性核假包涵体和核沟纹。未观察到乳头状结构或脓肿体。在所有病例中,肿瘤细胞围绕嗜酸性细胞外基质呈放射状分布。40%的病例(每5例中有2例)存在细长的肿瘤细胞小梁形态,细胞核沿小梁中肿瘤细胞的纵轴交错分布。FNAC提示2例为HTT,3例为甲状腺乳头状癌。术后活检结果显示它们均为HTT病例:HTT是一种罕见的甲状腺肿瘤,具有非特异性临床表现。结论:HTT是一种罕见的甲状腺肿瘤,临床表现无特异性,可通过FNAC误诊为甲状腺乳头状癌。不过,其细胞形态学特征有助于诊断。结合FNAC、免疫组化和分子检测,可以准确诊断HTT。
{"title":"Cytomorphological traits of fine-needle aspirates of hyalinizing trabecular tumor of the thyroid gland: A brief report.","authors":"Fei Wang, Yufei Liu","doi":"10.4103/ijpm.ijpm_405_22","DOIUrl":"10.4103/ijpm.ijpm_405_22","url":null,"abstract":"<p><strong>Background: </strong>The incidence of thyroid tumor is increasing, and preoperative diagnosis of hyalinizing trabecular tumor (HTT) is difficult.</p><p><strong>Aim: </strong>To investigate the cytological features of HTT of the thyroid gland.</p><p><strong>Settings and design: </strong>A retrospective observational study.</p><p><strong>Materials and methods: </strong>Ultrasonography, preoperative needle aspiration cytology, postoperative histopathology, immunohistochemistry, and BRAF V600E gene test were performed in five patients with HTT to analyze the pathological characteristics of the patients and review the relevant literature.</p><p><strong>Results: </strong>Four female and one male patients with HTT were recruited. Fine-needle aspiration cytology (FNAC) showed bloodstained background tumor cells with multiple morphologies. The tumor cells exhibited ovoid nuclei, abundant cytoplasm, fine chromatin, nuclear crowding and overlapping, and small nucleoli. Focal nuclear pseudoinclusions and grooves were present. No papillary structures or psammoma bodies were observed. In all cases, tumor cells were radially distributed around the eosinophilic extracellular matrix. In 40% (2 in 5) of cases, trabecular patterns of elongated tumor cells were present, with their nuclei staggered along the longitudinal axis of tumor cells in the trabeculae. FNAC suggested two cases of HTT and three cases of papillary thyroid cancer. Post-operational biopsy indicated they were HTT cases.</p><p><strong>Conclusion: </strong>HTT is a rare thyroid tumor with non-specific clinical manifestations. It can be misinterpreted as papillary thyroid carcinoma by FNAC. However, its cytomorphological traits are helpful in the diagnosis. In combination with FNAC, immunohistochemistry, and molecular testing, HTT can be accurately diagnosed.</p>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"27 1","pages":"128-132"},"PeriodicalIF":1.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70762852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automating petition classification in Brazil’s legal system: a two-step deep learning approach 巴西法律系统中的请愿分类自动化:两步式深度学习方法
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-15 DOI: 10.1007/s10506-023-09385-4
Yuri D. R. Costa, Hugo Oliveira, Valério Nogueira Jr., Lucas Massa, Xu Yang, Adriano Barbosa, Krerley Oliveira, Thales Vieira

Automated classification of legal documents has been the subject of extensive research in recent years. However, this is still a challenging task for long documents, since it is difficult for a model to identify the most relevant information for classification. In this paper, we propose a two-stage supervised learning approach for the classification of petitions, a type of legal document that requests a court order. The proposed approach is based on a word-level encoder–decoder Seq2Seq deep neural network, such as a Bidirectional Long Short-Term Memory (BiLSTM) or a Bidirectional Encoder Representations from Transformers (BERT) model, and a document-level Support Vector Machine classifier. To address the challenges posed by the lengthy legal documents, the approach introduces a human-in-the-loop approach, whose task is to localize and tag relevant segments of text in the word-level training part, which dramatically reduces the dimension of the document classifier input vector. We performed experiments to validate our approach using a real-world dataset comprised of 270 intermediate petitions, which were carefully annotated by specialists from the 15th civil unit of the State of Alagoas, Brazil. Our results revealed that both BiLSTM and BERT-Convolutional Neural Networks variants achieved an accuracy of up to 95.49%, and also outperformed baseline classifiers based on the Term Frequency–Inverse Document Frequency test vectorizer. The proposed approach is currently being utilized to automate the aforementioned justice unit, thereby increasing its efficiency in handling repetitive tasks.

{"title":"Automating petition classification in Brazil’s legal system: a two-step deep learning approach","authors":"Yuri D. R. Costa,&nbsp;Hugo Oliveira,&nbsp;Valério Nogueira Jr.,&nbsp;Lucas Massa,&nbsp;Xu Yang,&nbsp;Adriano Barbosa,&nbsp;Krerley Oliveira,&nbsp;Thales Vieira","doi":"10.1007/s10506-023-09385-4","DOIUrl":"10.1007/s10506-023-09385-4","url":null,"abstract":"<div><p>Automated classification of legal documents has been the subject of extensive research in recent years. However, this is still a challenging task for long documents, since it is difficult for a model to identify the most relevant information for classification. In this paper, we propose a two-stage supervised learning approach for the classification of petitions, a type of legal document that requests a court order. The proposed approach is based on a word-level encoder–decoder Seq2Seq deep neural network, such as a Bidirectional Long Short-Term Memory (BiLSTM) or a Bidirectional Encoder Representations from Transformers (BERT) model, and a document-level Support Vector Machine classifier. To address the challenges posed by the lengthy legal documents, the approach introduces a human-in-the-loop approach, whose task is to localize and tag relevant segments of text in the word-level training part, which dramatically reduces the dimension of the document classifier input vector. We performed experiments to validate our approach using a real-world dataset comprised of 270 intermediate petitions, which were carefully annotated by specialists from the 15th civil unit of the State of Alagoas, Brazil. Our results revealed that both BiLSTM and BERT-Convolutional Neural Networks variants achieved an accuracy of up to 95.49%, and also outperformed baseline classifiers based on the Term Frequency–Inverse Document Frequency test vectorizer. The proposed approach is currently being utilized to automate the aforementioned justice unit, thereby increasing its efficiency in handling repetitive tasks.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"227 - 251"},"PeriodicalIF":3.1,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138999292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reasoning with inconsistent precedents 根据不一致的先例进行推理
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-14 DOI: 10.1007/s10506-023-09382-7
Ilaria Canavotto

Computational models of legal precedent-based reasoning developed in AI and Law are typically based on the simplifying assumption that the background set of precedent cases is consistent. Besides being unrealistic in the legal domain, this assumption is problematic for recent promising applications of these models to the development of explainable AI methods. In this paper I explore a model of legal precedent-based reasoning that, unlike existing models, does not rely on the assumption that the background set of precedent cases is consistent. The model is a generalization of the reason model of precedential constraint. I first show that the model supports an interesting deontic logic, where consistent obligations can be derived from inconsistent case bases. I then provide an explanation of this surprising result by proposing a reformulation of the model in terms of cases that support a new potential decision and cases that conflict with it. Finally, I show that the reformulation of the model allows us to verify that inconsistent case bases do not make verification that a decision is permissible substantially more complex than consistent case bases and to introduce intuitive criteria to compare different permissible decisions.

{"title":"Reasoning with inconsistent precedents","authors":"Ilaria Canavotto","doi":"10.1007/s10506-023-09382-7","DOIUrl":"10.1007/s10506-023-09382-7","url":null,"abstract":"<div><p>Computational models of legal precedent-based reasoning developed in AI and Law are typically based on the simplifying assumption that the background set of precedent cases is consistent. Besides being unrealistic in the legal domain, this assumption is problematic for recent promising applications of these models to the development of explainable AI methods. In this paper I explore a model of legal precedent-based reasoning that, unlike existing models, does not rely on the assumption that the background set of precedent cases is consistent. The model is a generalization of the reason model of precedential constraint. I first show that the model supports an interesting deontic logic, where consistent obligations can be derived from inconsistent case bases. I then provide an explanation of this surprising result by proposing a reformulation of the model in terms of cases that support a new potential decision and cases that conflict with it. Finally, I show that the reformulation of the model allows us to verify that inconsistent case bases do not make verification that a decision is permissible substantially more complex than consistent case bases and to introduce intuitive criteria to compare different permissible decisions.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"137 - 166"},"PeriodicalIF":3.1,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139002537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decision support for detecting sensitive text in government records 为检测政府档案中的敏感文本提供决策支持
IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-10 DOI: 10.1007/s10506-023-09383-6
Karl Branting, Bradford Brown, Chris Giannella, James Van Guilder, Jeff Harrold, Sarah Howell, Jason R. Baron

Freedom of information laws promote transparency by permitting individuals and organizations to obtain government documents. However, exemptions from disclosure are necessary to protect privacy and to permit government officials to deliberate freely. Deliberative language is often the most challenging and burdensome exemption to detect, leading to high processing costs and delays in responding to open-records requests. This paper describes a novel deliberative-language detection model trained on a new annotated training set. The deliberative-language detection model is a component of a decision-support system for open-records requests under the US Freedom of Information Act, the FOIA Assistant, that ingests documents responsive to an open-records requests, suggests passages likely to be subject to deliberative language, privacy, or other exemptions, and assists analysts in rapidly redacting suggested passages. The tool’s interface is based on extensive human-factors and usability studies with analysts and is currently in operational testing by multiple US federal agencies.

{"title":"Decision support for detecting sensitive text in government records","authors":"Karl Branting,&nbsp;Bradford Brown,&nbsp;Chris Giannella,&nbsp;James Van Guilder,&nbsp;Jeff Harrold,&nbsp;Sarah Howell,&nbsp;Jason R. Baron","doi":"10.1007/s10506-023-09383-6","DOIUrl":"10.1007/s10506-023-09383-6","url":null,"abstract":"<div><p>Freedom of information laws promote transparency by permitting individuals and organizations to obtain government documents. However, exemptions from disclosure are necessary to protect privacy and to permit government officials to deliberate freely. Deliberative language is often the most challenging and burdensome exemption to detect, leading to high processing costs and delays in responding to open-records requests. This paper describes a novel deliberative-language detection model trained on a new annotated training set. The deliberative-language detection model is a component of a decision-support system for open-records requests under the US Freedom of Information Act, the <i>FOIA Assistant</i>, that ingests documents responsive to an open-records requests, suggests passages likely to be subject to deliberative language, privacy, or other exemptions, and assists analysts in rapidly redacting suggested passages. The tool’s interface is based on extensive human-factors and usability studies with analysts and is currently in operational testing by multiple US federal agencies.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"33 1","pages":"171 - 197"},"PeriodicalIF":3.1,"publicationDate":"2023-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10506-023-09383-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138982323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing legal judgment summarization with integrated semantic and structural information 利用综合语义和结构信息加强法律判决摘要分析
IF 4.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-26 DOI: 10.1007/s10506-023-09381-8
Jingpei Dan, Weixuan Hu, Yuming Wang
{"title":"Enhancing legal judgment summarization with integrated semantic and structural information","authors":"Jingpei Dan, Weixuan Hu, Yuming Wang","doi":"10.1007/s10506-023-09381-8","DOIUrl":"https://doi.org/10.1007/s10506-023-09381-8","url":null,"abstract":"","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"46 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2023-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139235415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Artificial Intelligence and Law
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1