Abstract
This paper describes an efficient algorithm for Japanese sentence compaction. First, a measure of grammatical goodness of phrase sequences is defined on the basis of a Japanese dependency grammar. Also a measure of topical importance of phrase sequences is given. Then the problem of sentence compaction is formulated as an optimisation problem of selecting a subsequence of phrases from the original sentence that maximises the sum of the grammatical goodness and the topical importance. A recurrence equation is derived by using the principle of dynamic programming, which is then translated into an algorithm to solve the problem. The algorithm is of polynomial-time with respect to the original sentence length. Finally, an example of sentence compaction is presented.
This is a preview of subscription content, log in via an institution to check access.
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
Okumura, M., Nanba, H.: Automated text summarisation: A survey. Journal of Natural Language Processing 6(6)(1999) 1–26.
Wakao, T., Ehara, T., Shirai, K.: Summarization methods used for captions in TV news programs. Technical Report of Information Processing Society of Japan, 97-NL-122-13 (1997) 83–89.
Katoh, N., Uratani, N.: A new approach to acquiring linguistic knowledge for locally summarizing Japanese news sentences. Journal of Natural Language Processing 6(7) (1999) 73–92.
Hori, C., Furui, S.: Automatic speech summarization based on word significance and linguistic likelihood. Technical Report of Information Processing Society of Japan, 99-SLP-29-18 (1999) 103–108.
Mikami, M., Masuyama, S., Nakagawa, S.: A summarization method by reducing redundancy of each sentence for making captions of newscasting. Journal of Natural Language Processing 6(6) (1999) 65–81.
Zhang, Y., Ozeki, K.: Dependency analysis of Japanese sentences using the statistical property of dependency distance between phrases. Journal of Natural Language Processing 4(2) (1997) 3–19.
Ozeki, K.: A multi-stage decision algorithm to select optimum bunsetsu sequences based on degree of kakariuke-dependency. IEICE Transactions J70-D(3) (1987) 601–609.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oguro, R., Ozeki, K., Zhang, Y., Takagi, K. (2000). An Efficient Algorithm for Japanese Sentence Compaction Based on Phrase Importance and Inter-Phrase Dependency. In: Sojka, P., Kopeček, I., Pala, K. (eds) Text, Speech and Dialogue. TSD 2000. Lecture Notes in Computer Science(), vol 1902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45323-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-45323-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41042-3
Online ISBN: 978-3-540-45323-9
eBook Packages: Springer Book Archive