This Java project compares Linear, Binary, and HashSet Search algorithms, evaluating efficiency in large datasets. It also analyzes word proximity to uncover relationships and patterns. HashSet Search is fastest (6 ms), followed by Binary (14 ms), with Linear Search taking 3,229 ms.