Abstract
A novel Conceptual Graph Matching Algorithm (CGMA) is proposed along with a knowledge base organization scheme. It allows the user to select the Degree of Matching and Degree of Inheritance to increase the user's satisfaction. A conceptual graph is represented in a special linear form (called U-Form) for CGMA. U-Form eliminates the necessity of explicit arcs in the graph to achieve the simplicity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Rau, L.F. Exploring the Semantics of Conceptual Graphs for Efficient Graph Matching. Third Annual Workshop on Conceptual Graphs, Boston, 1990.
Levinson, R. and G. Ellis. Multi-Level Hierarchical Retrieval. To be appeared in Knowledge Based Systems Journal, 1992.
Sowa, J. Conceptual Structures: Information Processing in Mind and Machine. Addison Wesley, Massachusetts, 1984.
Yang, G.C. and J.C. Oh. An Efficient Dictionary Management System for Machine Translation. Seoul International Conference on Natural Language Processing, Seoul, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag
About this paper
Cite this paper
Yang, GC., Choi, Y.B., Oh, J.C. (1993). CGMA: A novel conceptual graph matching algorithm. In: Pfeiffer, H.D., Nagle, T.E. (eds) Conceptual Structures: Theory and Implementation. Lecture Notes in Computer Science, vol 754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57454-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-57454-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57454-5
Online ISBN: 978-3-540-48189-8
eBook Packages: Springer Book Archive