This is in python

#A common problem in academic settings is plagiarism

#detection. Fortunately, software can make this pretty easy!

#

#In this problem, you'll be given two files with text in

#them. Write a function called check$\_$plagiarism with two

#parameters, each representing a filename. The function

#should find if there are any instances of $5$ or more

#consecutive words appearing in both files. If there are,

#return the longest such string of words $($in terms of number

#of words, not length of the string$).$ If there are not,

#return the boolean False.

#

#For simplicity, the files will be lower$-$case text and spaces

#only: there will be no punctuation, upper$-$case text, or

#line breaks.

#

#We've given you three files to experiment with. file$\_1.$txt

#and file$\_2.$txt share a series of $5$ words: we would expect

#check$\_$plagiarism$("$file$\_1.$txt$",$ "file$\_2.$txt$")$ to return the

#string $"$if i go crazy then". file$\_1.$txt and file$\_3.$txt

#share two series of $5$ words, and one series of $11$ words:

#we would expect check$\_$plagiarism$("$file$\_1.$txt$",$ "file$\_3.$txt$")$

#to return the string "i left my body lying somewhere in the

#sands of time". file$\_2.$txt and file$\_3.$txt do not share any

#text, so we would expect check$\_$plagiarism$("$file$\_2.$txt$",$

#"file$\_3.$txt$")$ to return the boolean False.

#

#Be careful: there are a lot of ways to do this problem, but

#some would be massively time$-$ or memory$-$intensive. If you

#get a MemoryError, it means that your solution requires

#storing too much in memory for the code to ever run to

#completion. If you get a message that says "KILLED", it

#means your solution takes too long to run.

#Add your code here!

def check$\_$plagiarism$($file$1\_$name, file$2\_$name$)$:

with open$($file$1\_$name, $\text{'}$r$\text{'})$ as file$1,$ open$($file$2\_$name, $\text{'}$r$\text{'})$ as file$2$:

text$1=$ file$1.$read$().$split$()$

text$2=$ file$2.$read$().$split$()$

longest$\_$match $=[]$

current$\_$match $=[]$

for word$1$ in text$1$:

if word$1$ in text$2$:

current$\_$match.append$($word$1)$

else:

if len$($current$\_$match$)>$ len$($longest$\_$match$)$:

longest$\_$match $=$ current$\_$match

current$\_$match $=[]$

if len$($current$\_$match$)>$ len$($longest$\_$match$)$:

longest$\_$match $=$ current$\_$match

if len$($longest$\_$match$)>=5$:

return $\text{'}\text{'}.$join$($longest$\_$match$)$

else:

return False

#Below are some lines of code that will test your function.

#You can change the value of the variable$($s$)$ to test your

#function with different inputs.

#

#If your function works correctly, this will originally

#print:

#if i go crazy then

#i left my body lying somewhere in the sands of time

#False

print$($check$\_$plagiarism$("$file$\_1.$txt$",$ "file$\_2.$txt$"))$

print$($check$\_$plagiarism$("$file$\_1.$txt$",$ "file$\_3.$txt$"))$

print$($check$\_$plagiarism$("$file$\_2.$txt$",$ "file$\_3.$txt$"))$

I receive this output:

if i go crazy then

i left my body lying somewhere in the sands of time i watched the world float to the

False

the part where it says "I watched the world float to the $"$ is not supposed to be there, how can I fix this?