Abstract
Electronic news media consistently use a specific language frame for efficient knowledge delivery and opinion formation. Since machine representation of logographs, and their derived forms, such as ideograms, and the Chinese characters in general, enumerates to a large set of symbols, the information content of particular text sequence interconnects context patterns across various scope ranges. Here we concern with the enumerated form of sinogram reflecting on the characters not only historically and culturally, but also educationally. Logographs visually invoke mutual functional relations by design and through their usage in overlaping scopes. Here we study the procedural summarization of text originally intended for online news distribution and the preferable evaluation method of its usability. Sinogrammatic electronic news sentences are analyzed for mutual similarity patterns both inward and outward, in order to facilitate sentence extraction for summary inclusion while reflecting on the principle of characters. Traditional partition of linguistic knowledge representation is aided by invocation of bypass routes in logographic text similar to software pictograms, for which design and usage frames are coeducational. Machine extracted summaries are compared with human chosen sentences while employing the Turing test to ascertain cohesion of Human - Human and Human - Machine comparison. The implementation of popularity-based summarization algorithm is available as a Java program.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
He, X., Ding, C.H.Q., Zha, H., Simon, H.D.: Automatic Topic Identification Using Webpage Clustering. In: ICDM 2001, pp. 195–202 (2001)
DiCesare, F., Sahnoun, Z., Bonissone, P.P.: Linguistic summarization of fuzzy data. Information Sciences 52, 141–152 (1990)
Guo, Y., Stylios, G.: An intelligent summarization system based on cognitive psychology. Information Sciences 174, 1–36 (2005)
Hahn, U., Mani, I.: The challenges of automatic summarization. IEEE Computer 33(11), 29–36 (2000)
Kacprzyk, J., Zadrozny, S.: Linguistic database summaries and their protoforms. Information Sciences 173, 281–304 (2005)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Kumar, P.A., Kumar, K.P., Rao, T.S., Reddy, P.K.: An Improved Approach to Extract Document Summaries Based on Popularity. In: Bhalla, S. (ed.) DNIS 2005. LNCS, vol. 3433, pp. 310–318. Springer, Heidelberg (2005)
Mani, I.: Automatic Summarization. John Benjamins Publishing Company, Amsterdam (2001)
Myaeng, S.H., Zhou, M., Wong, K.-F., Zhang, H.-J. (eds.): AIRS 2004. LNCS, vol. 3411. Springer, Heidelberg (2005)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Libraries Working Paper (1998)
Radev, D.R., McKeown, K.R.: Generating natural language summaries from multiple on-line sources. Computational Linguistics 24(3), 469–500 (1998)
Strzalkowski, T. (ed.): Natural Language Information Retrieval. Kluwer Academic Publishers (1999)
Global Reach, Evolution of Online Linguistic Populations (December 11, 2005), http://global-reach.biz/globstats/evol.html
Unicode, CJK Unicode (October 14, 2005 ), http://www.unicode.org/charts/PDF/U4E00.pdf (January 12, 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikami, N., Pichl, L. (2011). Summary Extraction from Chinese Text for Data Archives of Online News. In: Kikuchi, S., Madaan, A., Sachdeva, S., Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2011. Lecture Notes in Computer Science, vol 7108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25731-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-25731-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25730-8
Online ISBN: 978-3-642-25731-5
eBook Packages: Computer ScienceComputer Science (R0)