从博彩规则中自动提取和分类老虎机要求

Michael Prendergast
{"title":"从博彩规则中自动提取和分类老虎机要求","authors":"Michael Prendergast","doi":"10.1109/SysCon48628.2021.9447144","DOIUrl":null,"url":null,"abstract":"In well-regulated industries, important technical requirements can often be found in state and federal laws and regulations. This paper examines how natural language processing can be used during requirements analysis to analyze government regulations. The examples used in this paper are drawn from casino industry regulations for slot machine development, but are applicable to analyses of government regulations in other industries as well. More specifically, this paper analyzes South Dakota and Nevada regulations for slot machines and applies natural language processing to extract and analyze technical requirements derived from them using four techniques. First, key words and key phrases are drawn from the regulations using the Rapid Automatic Keyword Extraction algorithm so that they can be imported into a program glossary. Second, requirements are extracted from the regulations. Many of these requirements do not have the word “shall”, so a 12-rule transformation algorithm is used to convert the text into “shall” or “may” statements. Third, a Naive Bayes model is developed from the South Dakota regulations to predict which of the extracted Nevada requirements are functional, and which are not. Finally, a Dice similarity metric weighted with term frequency-inverse document frequency scores is used to identify related and equivalent requirements between the South Dakota and Nevada regulation sets.","PeriodicalId":384949,"journal":{"name":"2021 IEEE International Systems Conference (SysCon)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Automated Extraction and Classification of Slot Machine Requirements from Gaming Regulations\",\"authors\":\"Michael Prendergast\",\"doi\":\"10.1109/SysCon48628.2021.9447144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In well-regulated industries, important technical requirements can often be found in state and federal laws and regulations. This paper examines how natural language processing can be used during requirements analysis to analyze government regulations. The examples used in this paper are drawn from casino industry regulations for slot machine development, but are applicable to analyses of government regulations in other industries as well. More specifically, this paper analyzes South Dakota and Nevada regulations for slot machines and applies natural language processing to extract and analyze technical requirements derived from them using four techniques. First, key words and key phrases are drawn from the regulations using the Rapid Automatic Keyword Extraction algorithm so that they can be imported into a program glossary. Second, requirements are extracted from the regulations. Many of these requirements do not have the word “shall”, so a 12-rule transformation algorithm is used to convert the text into “shall” or “may” statements. Third, a Naive Bayes model is developed from the South Dakota regulations to predict which of the extracted Nevada requirements are functional, and which are not. Finally, a Dice similarity metric weighted with term frequency-inverse document frequency scores is used to identify related and equivalent requirements between the South Dakota and Nevada regulation sets.\",\"PeriodicalId\":384949,\"journal\":{\"name\":\"2021 IEEE International Systems Conference (SysCon)\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Systems Conference (SysCon)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SysCon48628.2021.9447144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Systems Conference (SysCon)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SysCon48628.2021.9447144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在规范良好的行业中,重要的技术要求通常可以在州和联邦法律法规中找到。本文探讨了如何在需求分析中使用自然语言处理来分析政府法规。本文所使用的例子来自赌场行业对老虎机开发的法规,但也适用于分析其他行业的政府法规。更具体地说,本文分析了南达科他州和内华达州对老虎机的规定,并使用四种技术应用自然语言处理来提取和分析从中得出的技术要求。首先,使用快速自动关键字提取算法从规则中提取关键字和关键短语,以便将其导入程序术语表。其次,从法规中提取需求。这些需求中有许多没有“shall”这个词,因此使用12条规则转换算法将文本转换为“shall”或“may”语句。第三,从南达科他州的法规中开发了一个朴素贝叶斯模型,以预测提取的内华达州要求中哪些是有效的,哪些是无效的。最后,使用术语频率逆文档频率分数加权的Dice相似性度量来确定南达科他州和内华达州法规集之间的相关和等效要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automated Extraction and Classification of Slot Machine Requirements from Gaming Regulations
In well-regulated industries, important technical requirements can often be found in state and federal laws and regulations. This paper examines how natural language processing can be used during requirements analysis to analyze government regulations. The examples used in this paper are drawn from casino industry regulations for slot machine development, but are applicable to analyses of government regulations in other industries as well. More specifically, this paper analyzes South Dakota and Nevada regulations for slot machines and applies natural language processing to extract and analyze technical requirements derived from them using four techniques. First, key words and key phrases are drawn from the regulations using the Rapid Automatic Keyword Extraction algorithm so that they can be imported into a program glossary. Second, requirements are extracted from the regulations. Many of these requirements do not have the word “shall”, so a 12-rule transformation algorithm is used to convert the text into “shall” or “may” statements. Third, a Naive Bayes model is developed from the South Dakota regulations to predict which of the extracted Nevada requirements are functional, and which are not. Finally, a Dice similarity metric weighted with term frequency-inverse document frequency scores is used to identify related and equivalent requirements between the South Dakota and Nevada regulation sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信