Flexible comparison of conceptual graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2113, Issue , 2001, Pages 102-111

  Montes Y Gomez M ^a   Gelbukh, A ^a   Lopez Lopez A ^b   Baeza Yates, R ^c  

^a INSTITUTO POLITÉCNICO NACIONAL   (Mexico)

^b INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERT SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS; TEXT MINING;

APPROXIMATE MATCHING; CONCEPTUAL GRAPH; ITS APPLICATIONS; NATURAL LANGUAGE TEXT; SEMANTIC CONTENT; STRUCTURAL MATCHING; TWO-GRAPHS;

GRAPHIC METHODS;

EID: 84949475292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44759-8_12     Document Type: Conference Paper

References (15)

1. th VLDB Conference, Santiago de Chile, 1994.
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.
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.
4. Huibers, Ounis and Chevallet (1996), “Conceptual Graph Aboutness”, Lecture Notes in Artificial Intelligence, Springer, 1996.
5. Marie, Marie (1995), “On generalization/specialization for conceptual graphs”, Journal of Experimental and Theoretical Artificial Intelligence, volume 7, pages 325-344, 1995.
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.
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.
8. Rasmussen, Edie (1992). “Clustering Algorithms”. Information Retrieval: Data Structures & Algorithms. William B. Frakes and Ricardo Baeza-Yates (Eds.), Prentice Hall, 1992.
9. Sowa, John F. (1984). “Conceptual Structures: Information Processing in Mind and Machine”. Ed. Addison-Wesley, 1984.
10. Sowa, John F. (1999). “Knowledge Representation: Logical, Philosophical and Computational Foundations”. 1st edition, Thomson Learning, 1999.
11. Wu and Palmer (1994), “Verb Semantics and Lexical Selection”, Proc. of the 32nd Annual Meeting of the Associations for Computational Linguistics, 1994.
12. Yang, Choi and Oh (1992), “CGMA: A Novel Conceptual Graph Matching Algorithm”, Proc. of the 7th Conceptual Graphs Workshop, Las Cruces, NM, 1992.
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.
14. A. F. Gelbukh. “Review of R. Hausser’s ‘Foundations of Computational Linguistics: Man- Machine Communication in Natural Language’.” Computational Linguistics, 26 (3), 2000.
15. th 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.