Skip to main content
SpringerLink
Log in
Book cover

International Conference on Discovery Science

DS 2003: Discovery Science pp 402–409Cite as

Discovering Homographs Using N-Partite Graph Clustering

  • Conference paper

  • 459 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2843))

Abstract

This paper presents a method for discovering homographs from textual corpora. The proposed method first extracts an N-partite graph expression of word dependencies, and then, generates near-synonymous word clusters by enumerating and combining maximum complete sub-components on the graph. The homographs are identified as the words that belong to multiple clusters. In our experiment, we applied the method to Japanese newspaper articles and detected 531 homograph candidates, of which 31 were confirmed to be actual homographs.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hattori, S.: Iwanami course philosophy XI language. Iwanami Shoten, Tokyo (1968) (in Japanese)

    Google Scholar 

  2. Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Appl. Math. 65, 21–45 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Uno, T.: A Practical Fast Algorithm for Finding Clusters of Huge Networks. IPSJ SIGNotes Algorithms No. 088-001. Information Processing Society of Japan, Tokyo (2002) (in Japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Graduate University for advanced studies, 2–1–2 Hitotubashi, Chiyoda-ku, Tokyo, 101–8430, Japan

    Hidekazu Nakawatase

  2. National Institute of Informatics, 2–1–2 Hitotubashi, Chiyoda-ku, Tokyo, 101–8430, Japan

    Akiko Aizawa

Authors
  1. Hidekazu Nakawatase
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akiko Aizawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FG Knowledge Engineering, FB Informatik, Technical University Darmstadt, Hochschulstr. 10, 64289, Darmstadt

    Gunter Grieser

  2. Meme Media Laboratory, Hokkaido University, N13 W8, 0608628, Sapporo, Japan

    Yuzuru Tanaka

  3. Graduate School of Informatics, Kyoto University Yoshida Honmachi, Sakyo-ku, 606-850, Kyoto, Japan

    Akihiro Yamamoto

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakawatase, H., Aizawa, A. (2003). Discovering Homographs Using N-Partite Graph Clustering. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds) Discovery Science. DS 2003. Lecture Notes in Computer Science(), vol 2843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39644-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39644-4_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20293-6

  • Online ISBN: 978-3-540-39644-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation