Machine Learning Models for Paraphrase Identification and its Applications on Plagiarism Detection

E. Hunt, Binay Dahal, J. Zhan, L. Gewali, Paul Y. Oh, Ritvik Janamsetty, Chanana Kinares, Chanel Koh, Alexis Sanchez, Felix Zhan, Murat Özdemir, Shabnam Waseem, Osman Yolcu
{"title":"Machine Learning Models for Paraphrase Identification and its Applications on Plagiarism Detection","authors":"E. Hunt, Binay Dahal, J. Zhan, L. Gewali, Paul Y. Oh, Ritvik Janamsetty, Chanana Kinares, Chanel Koh, Alexis Sanchez, Felix Zhan, Murat Özdemir, Shabnam Waseem, Osman Yolcu","doi":"10.1109/ICBK.2019.00021","DOIUrl":null,"url":null,"abstract":"Paraphrase Identification or Natural Language Sentence Matching (NLSM) is one of the important and challenging tasks in Natural Language Processing where the task is to identify if a sentence is a paraphrase of another sentence in a given pair of sentences. Paraphrase of a sentence conveys the same meaning but its structure and the sequence of words varies. It is a challenging task as it is difficult to infer the proper context about a sentence given its short length. Also, coming up with similarity metrics for the inferred context of a pair of sentences is not straightforward as well. Whereas, its applications are numerous. This work explores various machine learning algorithms to model the task and also applies different input encoding scheme. Specifically, we created the models using Logistic Regression, Support Vector Machines, and different architectures of Neural Networks. Among the compared models, as expected, Recurrent Neural Network (RNN) is best suited for our paraphrase identification task. Also, we propose that Plagiarism detection is one of the areas where Paraphrase Identification can be effectively implemented.","PeriodicalId":383917,"journal":{"name":"2019 IEEE International Conference on Big Knowledge (ICBK)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Big Knowledge (ICBK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK.2019.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

Paraphrase Identification or Natural Language Sentence Matching (NLSM) is one of the important and challenging tasks in Natural Language Processing where the task is to identify if a sentence is a paraphrase of another sentence in a given pair of sentences. Paraphrase of a sentence conveys the same meaning but its structure and the sequence of words varies. It is a challenging task as it is difficult to infer the proper context about a sentence given its short length. Also, coming up with similarity metrics for the inferred context of a pair of sentences is not straightforward as well. Whereas, its applications are numerous. This work explores various machine learning algorithms to model the task and also applies different input encoding scheme. Specifically, we created the models using Logistic Regression, Support Vector Machines, and different architectures of Neural Networks. Among the compared models, as expected, Recurrent Neural Network (RNN) is best suited for our paraphrase identification task. Also, we propose that Plagiarism detection is one of the areas where Paraphrase Identification can be effectively implemented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
释义识别的机器学习模型及其在抄袭检测中的应用
意译识别或自然语言句子匹配(NLSM)是自然语言处理中重要且具有挑战性的任务之一,其任务是在给定的一对句子中识别一个句子是否为另一个句子的意译。一个句子的释义传达的意思是相同的,但它的结构和单词的顺序不同。这是一项具有挑战性的任务,因为由于句子的长度很短,很难推断出正确的上下文。此外,为一对句子的推断上下文提出相似性度量也不是直截了当地的。然而,它的应用是众多的。这项工作探索了各种机器学习算法来模拟任务,并应用了不同的输入编码方案。具体来说,我们使用逻辑回归、支持向量机和不同的神经网络架构来创建模型。在比较的模型中,如预期的那样,递归神经网络(RNN)最适合我们的意译识别任务。此外,我们建议抄袭检测是释义识别可以有效实施的领域之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Two-Stage Clustering Algorithm Based on Improved K-Means and Density Peak Clustering Matrix Profile XX: Finding and Visualizing Time Series Motifs of All Lengths using the Matrix Profile A Spatial Co-location Pattern Mining Algorithm Without Distance Thresholds Adaptive Structural Co-regularization for Unsupervised Multi-view Feature Selection Which Patient to Treat Next? Probabilistic Stream-Based Reasoning for Decision Support and Monitoring
×
引用
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