Retrieving API Knowledge from Tutorials and Stack Overflow Based on Natural Language Queries

计算机科学 应用程序编程接口 片段(逻辑) 情报检索 自然语言 知识库 万维网 程序设计语言 自然语言处理
作者
Di Wu,Xiao‐Yuan Jing,Hongyu Zhang,Yang Feng,Haowen Chen,Yuming Zhou,Baowen Xu
出处
期刊:ACM Transactions on Software Engineering and Methodology [Association for Computing Machinery]
卷期号:32 (5): 1-36 被引量:1
标识
DOI:10.1145/3565799
摘要

When encountering unfamiliar APIs, developers tend to seek help from API tutorials and Stack Overflow (SO). API tutorials help developers understand the API knowledge in a general context, while SO often explains the API knowledge in a specific programming task. Thus, tutorials and SO posts together can provide more API knowledge. However, it is non-trivial to retrieve API knowledge from both API tutorials and SO posts based on natural language queries. Two major problems are irrelevant API knowledge in two different resources and the lexical gap between the queries and documents. In this article, we regard a fragment in tutorials and a Question and Answering (Q&A) pair in SO as a knowledge item (KI). We generate ⟨ API, FRA ⟩ pairs (FRA stands for fragment) from tutorial fragments and APIs and build ⟨ API, QA ⟩ pairs based on heuristic rules of SO posts. We fuse ⟨ API, FRA ⟩ pairs and ⟨ API, QA ⟩ pairs to generate API knowledge (AK for short) datasets, where each data item is an ⟨ API, KI ⟩ pair. We propose a novel approach, called PLAN, to automatically retrieve API knowledge from both API tutorials and SO posts based on natural language queries. PLAN contains three main stages: (1) API knowledge modeling, (2) query mapping, and (3) API knowledge retrieving. It first utilizes a deep-transfer-metric-learning-based relevance identification (DTML) model to effectively find relevant ⟨ API, KI ⟩ pairs containing two different knowledge items (⟨ API, QA ⟩ pairs and ⟨ API, FRA ⟩ pairs) simultaneously. Then, PLAN generates several potential APIs as a way to reduce the lexical gap between the query and ⟨ API, KI ⟩ pairs. According to potential APIs, we can select relevant ⟨ API, KI ⟩ pairs to generate potential results. Finally, PLAN returns a list of ranked ⟨ API, KI ⟩ pairs that are related to the query. We evaluate the effectiveness of PLAN with 270 queries on Java and Android AK datasets containing 10,072 ⟨ API, KI ⟩ pairs. Our experimental results show that PLAN is effective and outperforms the state-of-the-art approaches. Our user study further confirms the effectiveness of PLAN in locating useful API knowledge.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
桐桐应助cunzhang采纳,获得10
刚刚
jiajiajai完成签到,获得积分10
1秒前
wks666666完成签到,获得积分10
1秒前
Ava应助wang采纳,获得10
4秒前
4秒前
完美世界应助yuqinghui98采纳,获得10
4秒前
汉堡包应助科研通管家采纳,获得10
5秒前
lulu应助科研通管家采纳,获得10
5秒前
Biu忒佛完成签到,获得积分10
5秒前
6秒前
siqilinwillbephd完成签到 ,获得积分10
7秒前
stacy完成签到 ,获得积分10
8秒前
Hz完成签到,获得积分10
8秒前
10秒前
cheng发布了新的文献求助10
11秒前
AireenBeryl531应助LL采纳,获得10
13秒前
爱听歌寄云完成签到 ,获得积分10
13秒前
14秒前
jar7989发布了新的文献求助50
15秒前
酷波er应助小闵采纳,获得10
16秒前
17秒前
17秒前
悦悦完成签到,获得积分10
18秒前
20秒前
20秒前
向日魁发布了新的文献求助10
21秒前
BJY完成签到 ,获得积分10
21秒前
21秒前
小二郎应助清水小镇采纳,获得10
22秒前
22秒前
bbbus应助lj采纳,获得10
23秒前
大力山槐完成签到,获得积分10
23秒前
欣喜黄蜂完成签到,获得积分20
24秒前
25秒前
mhs完成签到 ,获得积分10
25秒前
吃鸡蛋不吃鸡蛋黄完成签到,获得积分10
25秒前
25秒前
鲜于飞薇发布了新的文献求助10
25秒前
风雨中飘摇应助lxlcx采纳,获得30
26秒前
wood发布了新的文献求助10
26秒前
高分求助中
Impact of Mitophagy-Related Genes on the Diagnosis and Development of Esophageal Squamous Cell Carcinoma via Single-Cell RNA-seq Analysis and Machine Learning Algorithms 1600
Exploring Mitochondrial Autophagy Dysregulation in Osteosarcoma: Its Implications for Prognosis and Targeted Therapy 1500
LNG地下式貯槽指針(JGA指-107) 1000
什么是会话分析 888
QMS18Ed2 | process management. 2nd ed 600
LNG as a marine fuel—Safety and Operational Guidelines - Bunkering 560
Clinical Interviewing, 7th ed 400
热门求助领域 (近24小时)
化学 医学 材料科学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 免疫学 细胞生物学 电极
热门帖子
关注 科研通微信公众号,转发送积分 2942198
求助须知:如何正确求助?哪些是违规求助? 2601184
关于积分的说明 7004369
捐赠科研通 2242284
什么是DOI,文献DOI怎么找? 1190099
版权声明 590254
科研通“疑难数据库(出版商)”最低求助积分说明 582657