Abstract
In large-scale network, using the weighted shortest path length to evaluate the relatedness between two terms is factually infeasible because of the actual time and space consumption, despite the fact that the related classic algorithm runs at complexity of \( o\left( {n^{3} } \right) \). However, in many natural language processing tasks, what we need to do is merely obtain the terms which are most related to a given term rather than obtain relatedness between every pair of terms, which makes it possible for using shortest path length between two terms within a large-scale complex network to evaluate semantic relatedness between two terms. Furthermore, one of the semantic field network’s important properties—scale-free distribution of node degree makes it much more feasible to use the shortest path length to evaluate semantic distance between two terms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Li, S., Zhang, J., Huang, X., et al.: Semantic computation in a Chinese question-answering system. Journal of Computer Science and Technology 17(6), 933–939 (2002)
Mohammad, S., Hirst, G.: Distributional measures as proxies for semantic relatedness (2005). http://www.cs.toronto.edu/compling/Publications
Agirre, E., Rigau, G.: A proposal for word sense disambiguation using conceptual distance. Amsterdam Studies in the Theory and History of Linguistic Science Series 4, 161–172 (1997)
Alvarez, M.A., Lim, S.J.: A Graph Modeling of Semantic Similarity between Words. In: Proceedings of the International Conference on Semantic Computing, pp. 355–362. IEEE Computer Society, Washington, DC (2007)
Jiang, J.J., Conrath, D.W.: Semantic similarity based on corpus statistics and lexical taxonomy. In: The Proceedings of ROCLING X, Taiwan (1997)
Resnik, P.: Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. Journal of Artificial Intelligence 11(11), 95–130 (1999)
Bin, W.: Automatic Alignment of Bilingual Corpus on Chinese and English. Graduate University of Chinese Academy of Sciences (Computer Technology Research Institute) (1999). (王斌. 汉英双语语料库自动对齐研究. 中国科学院研究生院 (计算技术研究所) (1999)) (in Chinese)
Banerjee, S., Pedersen, T.: Extended gloss overlaps as a measure of semantic relatedness. In: Proceedings of the Eighteenth International Joint Conference on Artficial Intelligence, pp. 805–810 (2003)
Patwardhan, S., Pedersen, T.: Using WordNet-based context vectors to estimate the semantic relatedness of concepts. In: Proceedings of the EACL 2006 Workshop Making Sense of Sense-Bringing Computational Linguistics and Psycholinguistics Together, Trento, Italy (2006)
Hughes, T., Ramage, D.: Lexical semantic relatedness with random graph walks. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing(EMNLP), pp. 581–589 (2007)
Brown, P.F., Della, P.S., Della, P.V., et al.: Word-sense disambiguation using statistical methods, pp. 264–270. Association for Computational Linguistics, Morristown (1991)
Budanitsky, A.: Lexical semantic relatedness and its application in natural language processing, Technical Report CSRG390. University of Toronto (1999)
Dagan, I., Lee, L., Pereira, F.C.: Similarity-based models of word cooccurrence probabilities. Machine Learning 34(1), 43–69 (1999)
Doan, A.H., Madhavan, J., Domingos, P., et al.: Learning to map between ontologies on the semantic web, p. 673. ACM (2002)
Weeds, J., Weir, D.: Co-occurrence retrieval: A flexible framework for lexical distributional similarity. Computational Linguistics 31(4), 439–475 (2005)
Jicheng, L.: Tentative Study on Lexical Cohesive Means in English Discourse. Journal of Foreign Languages. 5, 2 (1986). (林纪诚. 英语语篇中词汇衔接手段试探. 外国语 (上海外国语学院学报). 5, 2 (1986)) (in Chinese)
Riguang, X.: Semantic Association Field and Translation of Changing Categories of Nouns and Adjectives from Chinese to English. Journal of Xi’an International Studies University 12(4), 84–86 (2004). (夏日光. 语义联想场与名形词类转变的英译. 西安外国语学院学报 12(4), 84–86.(2004)) (in Chinese)
de Saussure, F.: Course in General Linguistics. The Commercial Press (1980). (索绪尔. 普通语言学教程. 商务印书馆 (1980)) (in Chinese)
Yue, W.: The Principles and Types of Russian Semantic Field Classification. Economic Research Guide (14), 227–228 (2012). (王悦. 俄语语义场划分的原则与类型. 经济研究导刊 (14), 227–228 (2012)) (in Chinese)
Yande, J.: Chinese Semantics. Peking University Press (1999). (贾彦德. 汉语语义学. 北京大学出版社 (1999)) (in Chinese)
Weimin, Y., Weimin, W.: Data Structure: C language version. Tsinghua University Press (2002). (严蔚敏, 吴伟民. 数据结构: C 语言版. 清华大学出版社 (2002)) (in Chinese)
Tetsuya Sakai, E.: Overview of the NTCIR-7 ACLIA IR4QA Subtask (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yang, H., Zhang, M., Ji, D., Xiao, G. (2014). Scale-Free Distribution in Chinese Semantic Field Network: A Main Cause of Using the Shortest Path Length for Representing Semantic Distance Between Terms. In: Su, X., He, T. (eds) Chinese Lexical Semantics. CLSW 2014. Lecture Notes in Computer Science(), vol 8922. Springer, Cham. https://doi.org/10.1007/978-3-319-14331-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-14331-6_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14330-9
Online ISBN: 978-3-319-14331-6
eBook Packages: Computer ScienceComputer Science (R0)