🤖 AI Summary
To address insufficient relevance in Top-N results for semantic document retrieval, this paper proposes a semantic matching framework integrated with evolutionary optimization. First, dense semantic vectors for queries and documents are generated using the Universal Sentence Encoder. Then, genetic algorithms (GA) and differential evolution (DE) are jointly and innovatively incorporated into the similarity ranking process to end-to-end optimize the matching function within the semantic space. This work is the first to systematically integrate both GA and DE into a semantic retrieval framework, thereby significantly enhancing ranking robustness and accuracy. Experimental evaluation on the SQuAD dataset demonstrates substantial improvements in Top-N accuracy over conventional static distance metrics—such as Manhattan distance—validating the effectiveness of evolutionary optimization in strengthening semantic matching performance.
📝 Abstract
Advancements in cloud computing and distributed computing have fostered research activities in Computer science. As a result, researchers have made significant progress in Neural Networks, Evolutionary Computing Algorithms like Genetic, and Differential evolution algorithms. These algorithms are used to develop clustering, recommendation, and question-and-answering systems using various text representation and similarity measurement techniques. In this research paper, Universal Sentence Encoder (USE) is used to capture the semantic similarity of text; And the transfer learning technique is used to apply Genetic Algorithm (GA) and Differential Evolution (DE) algorithms to search and retrieve relevant top N documents based on user query. The proposed approach is applied to the Stanford Question and Answer (SQuAD) Dataset to identify a user query. Finally, through experiments, we prove that text documents can be efficiently represented as sentence embedding vectors using USE to capture the semantic similarity, and by comparing the results of the Manhattan Distance, GA, and DE algorithms we prove that the evolutionary algorithms are good at finding the top N results than the traditional ranking approach.