Designing and implementing an advanced GUI$-$based word search application that makes use of the Brute Force and Knuth$-$Morris$-$Pratt $($KMP$)$ string$-$searching algorithms is the main goal of this project. Users will be able to effectively search for particular words or word combinations inside a wide variety of text files with this program. The project's objectives

to offer a thorough analysis of the two algorithms' performance traits in terms of efficiency and time complexity over a range of matching circumstances.

$2.$ Advanced Matching Options: The program must be in Java and include a set of advanced matching options to enhance the flexibility and usability of the search functionality:

$$ Whole Word Match: $$ Unchecked Option: The application should return all instances of the search term, including substrings within larger words.

For example, searching for $$pak$$ should yield results such as $$Pakistan$,$adampak$,$abnopakis$,$ and $$pak$.$

$$ Checked Option: The application should restrict results to exact matches of the search term, ensuring that only whole words are returned. For example, searching for $$pak$$ should return only $$pak$.$

$$ Case Sensitivity: $$ Unchecked Option: The application should be case$-$insensitive, meaning that variations in the upper and lower case should not affect the search results. For example, a search for $$bilal$$ should return $$Bilal$,$bilaL$,$ and $$bIlaL$.$

$$ Checked Option: The application should be case$-$sensitive$,$ returning results that match the case of the search term exactly. For example, searching for $$bilal$$ should yield only $$bilal$,$ while $$BilaL$$ should be returned for $$BilaL$.$ code should be in Java