通过迭代优化查询词,显著提升职业服务领域文档检索效果。
Iterative NLP Query Refinement for Enhancing Domain-Specific Information Retrieval: A Case Study in Career Services
- 用专业术语和教育描述自动扩展查询词,增强语义匹配
- 平均最高相似度从0.18提升至0.42,性能明显改善
- 适合需精准检索特定领域信息的教育类应用开发者
在小众领域中,基于TF-IDF的传统文档检索系统常因语义相关性差导致相似度低、性能不佳。本文针对汉伯学院职业服务网页,提出一种迭代式半自动化查询优化方法。初始通用查询(如面试准备)的顶级文档相似度仅为0.2–0.3。通过引入领域专有词汇(如resources-online-learning、student-online-services、career-advising)及结构化教育描述(如online resume and interview improvement tools),并自动从高排名文档提取关键词用于查询扩展,实验显示五组基线查询的平均最高相似度由约0.18提升至0.42,检索性能显著增强。代码与实验设置已在GitHub公开:https://github.com/Elipei88/HumberChatbotBackend 与 https://github.com/Nisarg851/HumberChatbot。论文还讨论了当前方法局限,并建议未来结合神经检索模型。
原文摘要 · Abstract (English)
Retrieving semantically relevant documents in niche domains poses significant challenges for traditional TF-IDF-based systems, often resulting in low similarity scores and suboptimal retrieval performance. This paper addresses these challenges by introducing an iterative and semi-automated query refinement methodology tailored to Humber College's career services webpages. Initially, generic queries related to interview preparation yield low top-document similarities (approximately 0.2--0.3). To enhance retrieval effectiveness, we implement a two-fold approach: first, domain-aware query refinement by incorporating specialized terms such as resources-online-learning, student-online-services, and career-advising; second, the integration of structured educational descriptors like "online resume and interview improvement tools." Additionally, we automate the extraction of domain-specific keywords from top-ranked documents to suggest relevant terms for query expansion. Through experiments conducted on five baseline queries, our semi-automated iterative refinement process elevates the average top similarity score from approximately 0.18 to 0.42, marking a substantial improvement in retrieval performance. The implementation details, including reproducible code and experimental setups, are made available in our GitHub repositories \url{https://github.com/Elipei88/HumberChatbotBackend} and \url{https://github.com/Nisarg851/HumberChatbot}. We also discuss the limitations of our approach and propose future directions, including the integration of advanced neural retrieval models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。