Skip to main content

A Method of Extracting Related Words Using Standardized Mutual Information

  • Conference paper
Discovery Science (DS 2003)

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

Included in the following conference series:

Abstract

Techniques of automatic extraction of related words are of great importance in many applications such as query expansion and automatic thesaurus construction. In this paper, a method of extracting related words is proposed basing on the statistical information about the co-occurrences of words from huge corpora. The mutual information is one of such statistical measures and has been used for application mainly in natural language processing. A drawback is, however, the mutual information depends mainly on frequencies of words. To overcome this difficulty, we propose as a new measure a normalize deviation of mutual information. We also reveal a correspondence between word ambiguity and related words using word relation graphs constructed using this measure.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Voorhees, E.M.: On expanding query vectors with lexically related words. In: Proceedings of the Second Text Retrieval Conference, pp. 223–231 (1994)

    Google Scholar 

  2. Jing, Y., Croft, B.: An association thesaurus for information retrieval. In: Proceedings of RIAO, pp. 146–160 (1994)

    Google Scholar 

  3. Fellbaum, C.: WordNet: An electronic lexical database. MIT press, Cambridge (1998)

    MATH  Google Scholar 

  4. Lin, D., Pantel, P.: DIRT - Discovery of Inference Rules from Text. In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2001, pp. 323–328 (2001)

    Google Scholar 

  5. Church, K.W., Hanks, P.: Word association norms, mutual information, and lexicography. Computational Linguistics 16(1), 22–29 (1990)

    Google Scholar 

  6. Dunning, T.: Accurate Methods for the Statistics of Surprise and Coincidence. Computational Linguistics 19(1), 61–74 (1993)

    Google Scholar 

  7. Aizawa, A.: The Feature Quantity: An Information Theoretic Perspective of Tfidf-like Measures. In: Proceeding of ACM SIGIR 2000, pp. 104–111 (2000)

    Google Scholar 

  8. Ohsawa, Y., Benson, N.E., Tachida, M.: KeyGraph: Automatic Indexing by Co-occurrence Graph based on Building Construction Metaphor. In: Proceeding of IEEE Advanced Digital Library Conference, pp. 12–18 (1999)

    Google Scholar 

  9. Matsuo, Y., Ishizuka, M.: Keyword Extraction from a Single Document usingWord Co-occurrence Statistical Information. In: Proceeding of 16th Int’l FLAIRS Conference, pp. 392–396 (2003)

    Google Scholar 

  10. Widdows, D., Dorow, B.: A Graph Model for Unsupervised Lexical Acquisition. In: 19th International Conference on Computational Linguistics, pp. 1093– 1099 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sugimachi, T., Ishino, A., Takeda, M., Matsuo, F. (2003). A Method of Extracting Related Words Using Standardized Mutual Information. 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_49

Download citation

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

  • 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