Skip to main content

Advertisement

Springer Nature Link
Log in

Discovering characteristic patterns from collections of classical Japanese poems

  • Special Feature
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Waka is a form of traditional Japanese poetry with a 1300-year history. In this paper, we attempt to discover characteristics common to a collection ofwaka poems. As a schema for characteristics, we use regular patterns where the constant parts are limited to sequences of auxiliary verbs and postpostional particles. We call such patternsfushi. The problem is to automate the process of finding significantfushi patterns that characterize the poems. Solving this problem requires a reliable significance measure for the patterns. Brāzma et al. (1996) proposed such a measure according to the MDL principle. Using this method, we report successful results in finding patterns from five anthologies. Some of the results are quite stimulating, and we hope that they will lead to new discoveries.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Angulin, D., “Finding patterns common to a set of strings,” inProc. 11th Annual Symposium on Theory of Computing, pp. 130–141, 1979.

  2. Arimura, H., Shinohara, T. and Otsuki, S., “Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data,” inProc. 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS’94) pp. 649–660, 1994.

  3. Brāzma, A., Ukkonen, E. and Vilo, J., “Discovering unbounded unions of regular pattern languages from positive examples,” inProc. 7th International Symposium on Algorithms and Computation (ISSAC’96), pp. 95–104, 1996.

  4. Devroye, L., Györfi, L. and Lugosi, G.,A Probablistic Theory of Pattern Recognition, Springer-Verlag, 1996.

  5. Gold, E. M., “Language identification in the limit,”Information and Control, 10, pp. 447–474, 1967.

    Article  MATH  Google Scholar 

  6. Murakami, M. and Imanishi, Y., “On a quantitative analysis of auxiliary verbs used in Genji Monogatari,”Transactions of Information Processing Society of Japan, 40(3), pp. 774–782, 1999 (in Japanese).

    Google Scholar 

  7. Rissanen, J., “Modeling by the shortest data description,”Automatica, 14, pp. 465–471, 1978.

    Article  MATH  Google Scholar 

  8. Shinohara, T., “Polynomial-time inference of pattern languages and its applications,” inProc. 7th IBM Symposium on Mathematical Foundations of Computer Science, pp. 191–209, 1982.

  9. Valiant, L., “A theory of the learnable,”Comm. ACM, 11 (27), pp. 1143–1142, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Kyushu University 33, 812-8581, Fukuoka, Japan

    Mayumi Yamasaki & Masayuki Takeda

  2. Fukuoka Jo Gakuin College, 838-0141, Ogōri, Japan

    Tomoko Fukuda

  3. Junshin Women’s Junior College, 815-0036, Fukuoka, Japan

    Ichiō Nanri

Authors
  1. Mayumi Yamasaki
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Masayuki Takeda
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Tomoko Fukuda
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Ichiō Nanri
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Mayumi Yamasaki, M.A.: She received her B.E. and M.A. degrees from Kyushu Institute of Technology in 1997 and from Kyushu University in 1999, respectively. Her research interests include machine discovery and datamining. Presently, she works at Fujitsu FIP Corporation.

Masayuki Takeda, Dr. Eng.: He is an Associate Professor in Department of informatics at Kyushu University. He received his B.S., M.S., and Dr. Eng. degrees from Kyushu University in 1987, 1989 and 1996 respectively. His present research interests include pattern matching algorithims, text compression, discovery science, information retrieval and natural language processing. He is a member of Information Processing Society of Japan, Japanese Society for Artificial Intelligence and Japanese Society for Soft-ware Science and Technology.

Tomoko Fukuda, M.A.: She is a Lecturer at Fukuoka Jo Gakuin University and at Junshin Women’s Junior College, She received her B.A. and M.A. degrees from Fukuoka Women’s University in 1987 and from Kyushu University in 1992 respectively. Her present research interests are in Japanese literature in the Heian period and classical 31-syllable Japanese poems. She is a member of Waka-Bungaku Kai (Society for Study of Japanese Poems) and Chuko-Bungaku Kai (Society for Study of Japanese Literature in the Heian Period).

Ichiro Nanri, M.A.: He is an Associate Professor at Junshin Women’s Juior College. He received his B.A. and M.A. degrees from Kyushu University in 1990 and 1995 respectively. His present research interests are in Japanese language in the Heian-Kamakura period and classical 31-syllable Japanese poems. He is a member of Kokugo Gakkai (Society for Study of Japanese Language) and Kuntengo Gakkai (Society for Studyy of Old Language).

About this article

Cite this article

Yamasaki, M., Takeda, M., Fukuda, T. et al. Discovering characteristic patterns from collections of classical Japanese poems. New Gener Comput 18, 61–73 (2000). https://doi.org/10.1007/BF03037569

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037569

Keywords