Skip to main content
Springer Nature Link
Log in

Global Path-Based Refinement of Noisy Graphs Applied to Verb Semantics

  • Conference paper
Natural Language Processing – IJCNLP 2005 (IJCNLP 2005)

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

Included in the following conference series:

Abstract

Recently, researchers have applied text- and web-mining algorithms to mine semantic resources. The result is often a noisy graph of relations between words. We propose a mathematically rigorous refinement framework, which uses path-based analysis, updating the likelihood of a relation between a pair of nodes using evidence provided by multiple indirect paths between the nodes. Evaluation on refining temporal verb relations in a semantic resource called VerbOcean showed a 16.1% error reduction after refinement.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berland, M., Charniak, E.: Finding parts in very large corpora. In: ACL-1999, College Park, MD, pp. 57–64 (1999)

    Google Scholar 

  2. Chklovski, T., Pantel, P.: VerbOcean: Mining the Web for Fine-Grained Semantic Verb Relations. In: Proceedings of 2004 Conference on Empirical Methods in Natural Language Processing (EMNLP 2004), Barcelona, Spain, July 25-26 (2004)

    Google Scholar 

  3. Domingos, P., Richardson, M.: Markov Logic: A unifying framework for statistical relational learning. In: Proceedings of ICML Workshop on Statistical Relational Learning and its Connections to Other Fields, Banff, Canada (2004)

    Google Scholar 

  4. Lin, D., Pantel, P.: Discovery of inference rules for question answering. Natural Language Engineering 7(4), 343–360 (2001)

    Article  Google Scholar 

  5. Pantel, P., Ravichandran, D.: Automatically labeling semantic classes. In: Proceedings HLT/NAACL-2004, Boston, MA, pp. 321–328 (2004)

    Google Scholar 

  6. Shinzato, K., Torisawa, K.: Acquiring hyponymy relations from web documents. In: Proceedings of HLT-NAACL-2004, Boston, MA, pp. 73–80 (2004)

    Google Scholar 

  7. Siegel, S., Castellan Jr., N.: Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, New York (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA, 90292

    Timothy Chklovski & Patrick Pantel

Authors
  1. Timothy Chklovski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Pantel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Language Technology, Macquarie University, 2019, Sydney, NSW, Australia

    Robert Dale

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Kam-Fai Wong

  3. Institute for Infocomm Research, 21, Heng Mui Keng Terrace, 119613, Singapore

    Jian Su

  4. Language Information Sciences Research Centre, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Oi Yee Kwong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chklovski, T., Pantel, P. (2005). Global Path-Based Refinement of Noisy Graphs Applied to Verb Semantics. In: Dale, R., Wong, KF., Su, J., Kwong, O.Y. (eds) Natural Language Processing – IJCNLP 2005. IJCNLP 2005. Lecture Notes in Computer Science(), vol 3651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562214_69

Download citation

  • DOI: https://doi.org/10.1007/11562214_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29172-5

  • Online ISBN: 978-3-540-31724-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics