Write me a program
Budget: $30 – $250 USD
I need a java program for string matching
Either
1. Simple Plagiarism detection using String matching algorithms. In this project, you will implement a very simple plagiarism detector. Your input will be a corpus of existing documents and a potentially plagiarized document. Your output will be the set of documents from which the document was plagiarized from. Implement the following basic detectors and compare their performance Normal KMP and Modified KMP. Given a test file, treat each sentence in the file as a potential pattern. Search for the pattern in the existing documents and find the matches. The modified KMP search backward and uses a different failure function, that need to be computed.
Compare it with Normal KMP vs Modified KMP in term of plagiarism detection and efficiency.
OR
2. Task allocation using Bipartite Graph:
In this project, you are given two sets : set of employees and tasks. For each task, you are also given the list of employees who can complete the task. Model this scenario as a bipartite graph and allocate work in such a way that the job is completed as soon as possible. You must also utilize your workforce as much as possible. Solve this problem using Network flow. Implement both Ford-Fulkerson and Edmond-Karp algorithms
Either
1. Simple Plagiarism detection using String matching algorithms. In this project, you will implement a very simple plagiarism detector. Your input will be a corpus of existing documents and a potentially plagiarized document. Your output will be the set of documents from which the document was plagiarized from. Implement the following basic detectors and compare their performance Normal KMP and Modified KMP. Given a test file, treat each sentence in the file as a potential pattern. Search for the pattern in the existing documents and find the matches. The modified KMP search backward and uses a different failure function, that need to be computed.
Compare it with Normal KMP vs Modified KMP in term of plagiarism detection and efficiency.
OR
2. Task allocation using Bipartite Graph:
In this project, you are given two sets : set of employees and tasks. For each task, you are also given the list of employees who can complete the task. Model this scenario as a bipartite graph and allocate work in such a way that the job is completed as soon as possible. You must also utilize your workforce as much as possible. Solve this problem using Network flow. Implement both Ford-Fulkerson and Edmond-Karp algorithms