{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T22:12:47Z","timestamp":1771539167638,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61690205, 61772071,61529201"],"award-info":[{"award-number":["61690205, 61772071,61529201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,12]]},"DOI":"10.1145\/3338906.3338929","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T12:21:03Z","timestamp":1565353263000},"page":"131-141","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Semantic relation based expansion of abbreviations"],"prefix":"10.1145","author":[{"given":"Yanjie","family":"Jiang","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Hui","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Lu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. https:\/\/www.webpages.uidaho.edu\/~jory\/babel.html.  {n. d.}. https:\/\/www.webpages.uidaho.edu\/~jory\/babel.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg439"},{"key":"e_1_3_2_1_3_1","volume-title":"Bayesian Unigram-Based Inference for Expanding Abbreviations in Source Code. In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 543\u2013 550","author":"Alatawi Abdulrahman","year":"2017","unstructured":"Abdulrahman Alatawi , Weifeng Xu , and Dianxiang Xu . 2017 . Bayesian Unigram-Based Inference for Expanding Abbreviations in Source Code. In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 543\u2013 550 . Abdulrahman Alatawi, Weifeng Xu, and Dianxiang Xu. 2017. Bayesian Unigram-Based Inference for Expanding Abbreviations in Source Code. In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 543\u2013 550."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2018.10260"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635883"},{"key":"e_1_3_2_1_6_1","unstructured":"Giuliano Antoniol Gerardo Canfora A De Lucia and G Casazza. 2000.  Giuliano Antoniol Gerardo Canfora A De Lucia and G Casazza. 2000."},{"key":"e_1_3_2_1_7_1","volume-title":"icsm","author":"Information","unstructured":"Information retrieval models for recovering traceability links between code and documentation. In icsm . IEEE , 40. Information retrieval models for recovering traceability links between code and documentation. In icsm. IEEE, 40."},{"key":"e_1_3_2_1_8_1","unstructured":"A Apostolio and C Guerra. 1985. A fast linear space algorithm for computing longest common subsequences. (1985).  A Apostolio and C Guerra. 1985. A fast linear space algorithm for computing longest common subsequences. (1985)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647812.738138"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.1710"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032497.2032507"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Bruno Caprile and Paolo Tonella. 2000. Restructuring Program Identifier Names.. In icsm. 97\u2013107.   Bruno Caprile and Paolo Tonella. 2000. Restructuring Program Identifier Names.. In icsm. 97\u2013107.","DOI":"10.1109\/ICSM.2000.883022"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/832306.837072"},{"key":"e_1_3_2_1_14_1","volume-title":"Pedro Rangel Henriques, and Maria Jo\u00e3o Varanda.","author":"Carvalho Nuno Ramos","year":"2015","unstructured":"Nuno Ramos Carvalho , Jos\u00e9 Jo\u00e3o Almeida , Pedro Rangel Henriques, and Maria Jo\u00e3o Varanda. 2015 . Nuno Ramos Carvalho, Jos\u00e9 Jo\u00e3o Almeida, Pedro Rangel Henriques, and Maria Jo\u00e3o Varanda. 2015."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2014.10.013"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2012.6405277"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-006-9219-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91662-0_3"},{"key":"e_1_3_2_1_19_1","unstructured":"Marc Eaddy Alfred V Aho Giuliano Antoniol and Yann-Ga\u00ebl Gu\u00e9h\u00e9neuc. 2008.  Marc Eaddy Alfred V Aho Giuliano Antoniol and Yann-Ga\u00ebl Gu\u00e9h\u00e9neuc. 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2008.39"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Eric Enslen Emily Hill Lori Pollock and K Vijay-Shanker. 2009. Mining source code to automatically split identifiers for software analysis. (2009).  Eric Enslen Emily Hill Lori Pollock and K Vijay-Shanker. 2009. Mining source code to automatically split identifiers for software analysis. (2009).","DOI":"10.1109\/MSR.2009.5069482"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of IASTED International Conference on Software Engineering and Applications (SEA\u201906)","author":"Feild Henry","year":"2006","unstructured":"Henry Feild , David Binkley , and Dawn Lawrie . 2006 . An empirical comparison of techniques for extracting concept abbreviations from identifiers . In Proceedings of IASTED International Conference on Software Engineering and Applications (SEA\u201906) . Henry Feild, David Binkley, and Dawn Lawrie. 2006. An empirical comparison of techniques for extracting concept abbreviations from identifiers. In Proceedings of IASTED International Conference on Software Engineering and Applications (SEA\u201906)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.539"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2012.20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1370750.1370771"},{"key":"e_1_3_2_1_26_1","volume-title":"Jia Qi Zhu, and Lu Zhang","author":"Jiang Yanjie","year":"2018","unstructured":"Yanjie Jiang , Hui Liu , Jia Qi Zhu, and Lu Zhang . 2018 . Yanjie Jiang, Hui Liu, Jia Qi Zhu, and Lu Zhang. 2018."},{"key":"e_1_3_2_1_27_1","volume-title":"IEEE Transactions on Software Engineering","author":"Accurate Automatic","year":"2018","unstructured":"Automatic and Accurate Expansion of Abbreviations in Parameters . IEEE Transactions on Software Engineering ( 2018 ). Automatic and Accurate Expansion of Abbreviations in Parameters. IEEE Transactions on Software Engineering (2018)."},{"key":"e_1_3_2_1_28_1","unstructured":"Danae Pla Karidi. 2016.  Danae Pla Karidi. 2016."},{"key":"e_1_3_2_1_29_1","volume-title":"Data Engineering Workshops (ICDEW), 2016 IEEE 32nd International Conference on. IEEE, 121\u2013123","author":"From","unstructured":"From user graph to Topics Graph: Towards twitter followee recommendation based on knowledge graphs . In Data Engineering Workshops (ICDEW), 2016 IEEE 32nd International Conference on. IEEE, 121\u2013123 . From user graph to Topics Graph: Towards twitter followee recommendation based on knowledge graphs. In Data Engineering Workshops (ICDEW), 2016 IEEE 32nd International Conference on. IEEE, 121\u2013123."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Dawn Lawrie and Dave Binkley. 2011. Expanding identifiers to normalize source code vocabulary. (2011).  Dawn Lawrie and Dave Binkley. 2011. Expanding identifiers to normalize source code vocabulary. (2011).","DOI":"10.1109\/ICSM.2011.6080778"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2010.10"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2007.9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11334-007-0031-2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2018.00028"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2010.31"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70768"},{"key":"e_1_3_2_1_37_1","volume-title":"Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web 8, 3","author":"Paulheim Heiko","year":"2017","unstructured":"Heiko Paulheim . 2017. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web 8, 3 ( 2017 ), 489\u2013508. Heiko Paulheim. 2017. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web 8, 3 (2017), 489\u2013508."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1177\/0539018403042001798"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2010.41"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/792024"},{"key":"e_1_3_2_1_41_1","volume-title":"Introducing the knowledge graph: things, not strings. Official google blog 5","author":"Singhal Amit","year":"2012","unstructured":"Amit Singhal . 2012. Introducing the knowledge graph: things, not strings. Official google blog 5 ( 2012 ). Amit Singhal. 2012. Introducing the knowledge graph: things, not strings. Official google blog 5 (2012)."},{"key":"e_1_3_2_1_42_1","unstructured":"Angus Stevenson. 2010.  Angus Stevenson. 2010."},{"key":"e_1_3_2_1_43_1","unstructured":"Oxford dictionary of English. Oxford University Press USA.  Oxford dictionary of English. Oxford University Press USA."},{"key":"e_1_3_2_1_44_1","unstructured":"Ashish Sureka. 2012.  Ashish Sureka. 2012."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384416.2384417"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-C.2017.102"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052558"}],"event":{"name":"ESEC\/FSE '19: 27th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Tallinn Estonia","acronym":"ESEC\/FSE '19","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338906.3338929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338906.3338929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:20Z","timestamp":1750206380000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338906.3338929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":47,"alternative-id":["10.1145\/3338906.3338929","10.1145\/3338906"],"URL":"https:\/\/doi.org\/10.1145\/3338906.3338929","relation":{},"subject":[],"published":{"date-parts":[[2019,8,12]]},"assertion":[{"value":"2019-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}