Skip to main content
SpringerLink
Log in

Flexible Comparison of Conceptual Graphs*

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2113))

Included in the following conference series:

Abstract

Conceptual graphs allow for powerful and computationally affordable representation of the semantic contents of natural language texts. We propose a method of comparison (approximate matching) of conceptual graphs. The method takes into account synonymy and subtype/supertype relationships between the concepts and relations used in the conceptual graphs, thus allowing for greater flexibility of approximate matching. The method also allows the user to choose the desirable aspect of similarity in the cases when the two graphs can be generalized in different ways. The algorithm and examples of its application are presented. The results are potentially useful in a range of tasks requiring approximate semantic or another structural matching - among them, information retrieval and text mining.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Agrawal, Rakesh, and Ramakrishnan Srikant (1994), “Fast Algorithms for Mining Association Rules”, Proc. 20th VLDB Conference, Santiago de Chile, 1994.

    Google Scholar 

  2. Ellis and Lehmann (1994), “Exploiting the Induced Order on Type-Labeled Graphs for fast Knowledge Retrieval”, Lecture Notes in Artificial Intelligence 835, Springer-Verlag 1994.

    Google Scholar 

  3. Genest D., and M. Chein (1997). “An Experiment in Document Retrieval Using Conceptual Graphs”. Conceptual structures: Fulfilling Peirce’s Dream. Lecture Notes in artificial Intelligence 1257, August 1997.

    Google Scholar 

  4. Huibers, Ounis and Chevallet (1996), “Conceptual Graph Aboutness”, Lecture Notes in Artificial Intelligence, Springer, 1996.

    Google Scholar 

  5. Marie, Marie (1995), “On generalization / specialization for conceptual graphs”, Journal of Experimental and Theoretical Artificial Intelligence, volume 7, pages 325–344, 1995.

    Article  Google Scholar 

  6. Myaeng, Sung H., and Aurelio López-López (1992), “Conceptual Graph Matching: a Flexible Algorithm and Experiments”, Journal of Experimental and Theoretical Artificial Intelligence, Vol. 4, 1992.

    Google Scholar 

  7. Myaeng, Sung H. (1992). “Using Conceptual graphs for Information Retrieval: A Framework for Adequate Representation and Flexible Inferencing”, Proc. of Symposium on Document Analysis and Information Retrieval, Las Vegas, 1992.

    Google Scholar 

  8. Rasmussen, Edie (1992). “Clustering Algorithms”. Information Retrieval: Data Structures & Algorithms. William B. Frakes and Ricardo Baeza-Yates (Eds.), Prentice Hall, 1992.

    Google Scholar 

  9. Sowa, John F. (1984). “Conceptual Structures: Information Processing in Mind and Machine”. Ed. Addison-Wesley, 1984.

    Google Scholar 

  10. Sowa, John F. (1999). “Knowledge Representation: Logical, Philosophical and Computational Foundations”. 1st edition, Thomson Learning, 1999.

    Google Scholar 

  11. Wu and Palmer (1994), “Verb Semantics and Lexical Selection”, Proc. of the 32nd Annual Meeting of the Associations for Computational Linguistics, 1994.

    Google Scholar 

  12. Yang, Choi and Oh (1992), “CGMA: A Novel Conceptual Graph Matching Algorithm”, Proc. of the 7th Conceptual Graphs Workshop, Las Cruces, NM, 1992.

    Google Scholar 

  13. Manuel Montes-y-Gómez, Alexander Gelbukh, Aurelio López-López (2000). Comparison of Conceptual Graphs. O. Cairo, L.E. Sucar, F.J. Cantu (eds.) MICAI 2000: Advances in Artificial Intelligence. Lecture Notes in Artificial Intelligence N 1793, Springer-Verlag, pp. 548–556, 2000.

    Google Scholar 

  14. A.F. Gelbukh. “Review of R. Hausser’s ‘Foundations of Computational Linguistics: Man-Machine Communication in Natural Language’. ” Computational Linguistics, 26(3), 2000.

    Google Scholar 

  15. Manuel Montes-y-Gómez, Aurelio López-López, and Alexander Gelbukh. Information Retrieval with Conceptual Graph Matching. Proc. DEXA-2000, 11th International Conference on Database and Expert Systems Applications, Greenwich, England, September 4-8, 2000. Lecture Notes in Computer Science N 1873, Springer-Verlag, pp. 312–321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Computing Research (CIC), National Polytechnic Institute (IPN), 07738, Mexico

    M. Montes-y-Gómez & A. Gelbukh

  2. Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Mexico

    A. López-López

  3. Departamento de Ciencias de la Computación, Universidad de Chile, Chile

    R. Baeza-Yates

Authors
  1. M. Montes-y-Gómez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Gelbukh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. López-López
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Klagenfurt, IFI -IWAS Universitaetsstr. 65, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  2. Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague 6, Czech Republic

    Jiri Lazansky

  3. School of Computer and Information Science, University of South Australia, Mawson Lakes Campus, Mawson Lakes, SA, 5095

    Gerald Quirchmayr

  4. Department of Information Systems, Technical University of Munich, Orleanstr. 34, 81667, Munich, Germany

    Pavel Vogel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montes-y-Gómez, M., Gelbukh, A., López-López, A., Baeza-Yates, R. (2001). Flexible Comparison of Conceptual Graphs*. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation