Inspiration:

Our Fundies teachers' strict adherence to plagiarism. #kingoffundamentals1

What it does:

Checks the source codes in a file and compares them to the rest in the file by giving it a score from 0 to 100. 100 means it is exactly alike and 0 means it is completely different.

How we built it:

Using Java and NetBeans.

Challenges we ran into:

Levenshtein distance was a struggle and is not bulletproof.

Accomplishments that we're proud of:

Works with any text file and most source code files.

What we learned:

Comparing two large files with Java I/O is a painful process. NetBeans is very picky.

What's next for Deja Vu:

Fixing the holes that Levenshtein distance doesn't account for by including other string comparison algorithms like fuzzy search. Adding exceptions is also something we would work on.

Built With

Share this project:
×

Updates