Abstract��There are many programming resources on the Internet.Although these programming resources have internal relations,there are often no hyperlinks connecting them.Getting the terms of algorithmic knowledge,organizing the terms to an expert file,which is used for recognizing the knowledge in the programming resources,the programming resources can be connected by the knowledge.To get the terms of algorithmic knowledge,this paper proposes a method to discover terms of algorithmic knowledge based on natural language processing.This method consists of discovering the patterns of strings which contain terms of algorithmic knowledge,extracting from programming resources that probably contain terms of algorithmic knowledge according to the discovered patterns,finding the word segmentation most likely appearing in the terms of algorithmic knowledge,and fetching the terms of algorithmic knowledge according to the word segmentation.This method increases 11.2% algorithmic knowledge and 13.6% terms of algorithmic knowledge in comparison with the manual collection of terms of algorithmic knowledge which is obtained by previous work.
[1] Zhu Guojin,Fu Lichao.Automatic Organization of Programming Resources on the Web[M]//Jin D,Lin S.Advances in Computer Science and Information Engineering.Berlin,Germany:Springer,2012. [2] Zhu Guojin.Automatic Discovery of Solutions to Programming Problems on the Web[C]//Proceedings of IEEE International Conference on Information Science and Technology.Phuket,Thailand:[s.n.],2013. [3] Han Jiawei,Cheng Hong,Xin Dong,et al.Frequent Pattern Mining:Current Status and Future Directions[J].Data Mining and Knowledge Discovery,2007,15(1):55-86. [4] Yuan Junsong,Wu Ying,Yang Ming.Discovery of Collocation Patterns:From Visual Words to Visual Phrases[C]//Proceedings of the 25th IEEE Conference on Computer Vision and Pattern Recognition.[S.l.]:IEEE Press,2007:1-8. [5] Jiao Hui,Liu Qian,Jia Huibo.Chinese Keyword Extraction Based on N-gram and Word Cooccurrence[C]//Pro-ceedings of International Conference on Computational Intelligence and Security Workshops.[S.l.]:IEEE Press,2007:152-155. [6] Resnik P.Semantic Similarity in a Taxonomy:An Information-based Measure and Its Application to Problems of Ambiguity in Natural Language[J].Journal of Artificial Intelligence Research,1998,11:95-130. [7] Collobert R,Weston J,Bottou L,et al.Natural Language Processing (Almost) from Scratch[J].Journal of Machine Learning Research,2011,12:2493-2537. [8] Maccartney B.Stanford Parser[EB/OL].(2013-06-20).http://nlp.stanford.edu /software/lex-parser.shtml. [9] Sproat R,Emerson T.The First International Chinese Word Segmentation Bakeoff[C]//Proceedings of the 2nd SIGHAN Workshop on Chinese Language Processing.Sapporo,Japan:[s.n.],2003:133-143. [10] Li Juanzi,Fan Qi��na,Zhang Kuo.Keyword Extraction Based on TF/IDF for Chinese News Document[J].Wuhan University Journal of Natural Sciences:English Vision,2007,12(5):917-921. [11] Rajaraman A,Ullman J D.Mining of Massive Datasets[M].Cambridge,UK:Cambridge University Press,2011.
2014, Vol. 40 
