Faisal Alvi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Faisal Alvi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- El-Sayed M. El-Alfy
King Fahd University of Petroleum and Minerals
2 shared publications Paul Clough
Information School, University of Sheffield, Sheffield, United Kingdom
2 shared publicationsRadwan E. Abdel-Aal
College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
2 shared publicationsMajed Alhajry
Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
1 shared publicationMark Stevenson
Department of Computer Science, University of Sheffield, Sheffield, United Kingdom
1 shared publication- Mark Stevenson
University of Sheffield, Sheffield, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 4 August 2021
- Published by Springer Nature in International Journal of Educational Technology in Higher Education
- Vol. 18 (1) , 1-25
Paraphrase type identification for plagiarism detection using contexts and word embeddings
Paraphrase types have been proposed by researchers as the paraphrasing mechanisms underlying acts of plagiarism. Synonymous substitution, word reordering and insertion/deletion have been identified as some of the common paraphrasing strategies used by plagiarists. However, similarity reports generated by most plagiarism detection systems provide a similarity score and produce matching sections of text with their possible sources. In this research we propose methods to identify two important paraphrase types – synonymous substitution and word reordering in paraphrased, plagiarised sentence pairs. We propose a three staged approach that uses context matching and pretrained word embeddings for identifying synonymous substitution and word reordering. Our proposed approach indicates that the use of Smith Waterman Algorithm for Plagiarism Detection and ConceptNet Numberbatch pretrained word embeddings produces the best performance in terms of $$\hbox {F}_1$$ scores. This research can be used to complement similarity reports generated by currently available plagiarism detection systems by incorporating methods to identify paraphrase types for plagiarism detection.- 4 August 2021
- Published by Springer Nature in International Journal of Educational Technology in Higher Education
- Vol. 18 (1) , 1-25
Open AccessParaphrase type identification for plagiarism detection using contexts and word embeddings
Paraphrase types have been proposed by researchers as the paraphrasing mechanisms underlying acts of plagiarism. Synonymous substitution, word reordering and insertion/deletion have been identified as some of the common paraphrasing strategies used by plagiarists. However, similarity reports generated by most plagiarism detection systems provide a similarity score and produce matching sections of text with their possible sources. In this research we propose methods to identify two important paraphrase types – synonymous substitution and word reordering in paraphrased, plagiarised sentence pairs. We propose a three staged approach that uses context matching and pretrained word embeddings for identifying synonymous substitution and word reordering. Our proposed approach indicates that the use of Smith Waterman Algorithm for Plagiarism Detection and ConceptNet Numberbatch pretrained word embeddings produces the best performance in terms of $$\hbox {F}_1$$ scores. This research can be used to complement similarity reports generated by currently available plagiarism detection systems by incorporating methods to identify paraphrase types for plagiarism detection. - 8 April 2017
- Published by Springer Nature
- p. 669-675
Plagiarism Detection in Texts Obfuscated with Homoglyphs
- 8 April 2017
- Published by Springer Nature
- p. 669-675
Plagiarism Detection in Texts Obfuscated with Homoglyphs
- 1 January 2015
- Published by Elsevier in Applied Soft Computing
- Vol. 26, 444-453
Boosting paraphrase detection through textual similarity metrics with abductive networks
- 1 January 2015
- Published by Elsevier in Applied Soft Computing
- Vol. 26, 444-453
Boosting paraphrase detection through textual similarity metrics with abductive networks
- Open Access
- 11 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 49-54
Analysis and extraction of sentence-level paraphrase sub-corpus in CS education
Since the advent of the Internet, plagiarism has become a widespread problem in student submissions. Paraphrasing is one of the several types of plagiarism employed by students to mask the original source. In this work, we construct a sub-corpus of paraphrased sentences by extracting all lightly and heavily revised sentences from the Corpus of Plagiarized Short Answers, using modified criteria for sentences. We then apply document similarity measures on this sub-corpus and derive some interesting features of this sub-corpus. Our findings suggest that this sub-corpus is more suited for testing paraphrase detection techniques by providing sentence-level paraphrasing samples instead of the file-level classification provided in the original corpus. Additional sentence samples may also be added to this sub-corpus to achieve variety and scale.
- 11 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 49-54
Open AccessAnalysis and extraction of sentence-level paraphrase sub-corpus in CS education
Since the advent of the Internet, plagiarism has become a widespread problem in student submissions. Paraphrasing is one of the several types of plagiarism employed by students to mask the original source. In this work, we construct a sub-corpus of paraphrased sentences by extracting all lightly and heavily revised sentences from the Corpus of Plagiarized Short Answers, using modified criteria for sentences. We then apply document similarity measures on this sub-corpus and derive some interesting features of this sub-corpus. Our findings suggest that this sub-corpus is more suited for testing paraphrase detection techniques by providing sentence-level paraphrasing samples instead of the file-level classification provided in the original corpus. Additional sentence samples may also be added to this sub-corpus to achieve variety and scale.
- 1 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 83-90
TD(λ) and Q-learning based Ludo players
Reinforcement learning is a popular machine learning technique whose inherent self-learning ability has made it the candidate of choice for game AI. In this work we propose an expert player based by further enhancing our proposed basic strategies on Ludo. We then implement a TD(λ)based Ludo player and use our expert player to train this player. We also implement a Q-learning based Ludo player using the knowledge obtained from building the expert player. Our results show that while our TD(λ) and Q-Learning based Ludo players outperform the expert player, they do so only slightly suggesting that our expert player is a tough opponent. Further improvements to our RL players may lead to the eventual development of a near-optimal player for Ludo.
- 1 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 83-90
TD(λ) and Q-learning based Ludo players
Reinforcement learning is a popular machine learning technique whose inherent self-learning ability has made it the candidate of choice for game AI. In this work we propose an expert player based by further enhancing our proposed basic strategies on Ludo. We then implement a TD(λ)based Ludo player and use our expert player to train this player. We also implement a Q-learning based Ludo player using the knowledge obtained from building the expert player. Our results show that while our TD(λ) and Q-Learning based Ludo players outperform the expert player, they do so only slightly suggesting that our expert player is a tough opponent. Further improvements to our RL players may lead to the eventual development of a near-optimal player for Ludo.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 141-148
Complexity analysis and playing strategies for Ludo and its variant race games
Ludo is a 2-4 player non-deterministic race game with the objective of moving players' pieces through a designated circuit into a winning location, in accordance with die rolls. In this paper we evaluate the state-space complexity of Ludo, and propose and analyze strategies based on four basic moves. We also provide an experimental comparison of pure and mixed versions of these strategies. This research is aimed at enhancing the domain specific knowledge for Ludo and its variant race games, which can then be used for performance improvement in temporal difference learning networks or in evolutionary game analysis for race games.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 141-148
Complexity analysis and playing strategies for Ludo and its variant race games
Ludo is a 2-4 player non-deterministic race game with the objective of moving players' pieces through a designated circuit into a winning location, in accordance with die rolls. In this paper we evaluate the state-space complexity of Ludo, and propose and analyze strategies based on four basic moves. We also provide an experimental comparison of pure and mixed versions of these strategies. This research is aimed at enhancing the domain specific knowledge for Ludo and its variant race games, which can then be used for performance improvement in temporal difference learning networks or in evolutionary game analysis for race games.