Source Code Retrieval using Conceptual Graphs
نویسنده
چکیده
6
منابع مشابه
Source Code Retrieval using Conceptual Similarity
We propose a method for retrieving segments of source code from a large repository. The method is based on conceptual modeling of the code, combining information extracted from the structure of the code and standard informationdistance measures. Our results show an improvement over traditional retrieval models, indicating that, for this type of highly-structured documents, usage of structure is...
متن کاملOrganizing conceptual graphs for fast knowledge retrieval
The expressiveness of conceptual graphs allows for accurate representation of knowledge in the domain of information retrieval. However, the complexity of the operators introduced by this formalism are in contradiction with the necessary speed of a practicable information retrieval system. In particular, the projection operator is considered to be time-consuming. We propose a new logic-based or...
متن کاملInformation Retrieval with Conceptual Graph Matching
The use of conceptual graphs for the representation of text contents in information retrieval is discussed. A method for measuring the similarity b etween two texts represented as conceptual graphs is presented. The method is based on well-known strategies of text comparison, such as Dice coefficient, with new elements introduced due to the bipartite nature of the conceptual graphs. Examples of...
متن کاملFault Prediction OO Systems Using the Conceptual Cohesion of Classes
High cohesion is desirable property in software systems to achieve reusability and maintainability. In this project we are measures for cohesion in Object-Oriented (OO)[10] software reflect particular interpretations of cohesion and capture different aspects of it. In existing approaches the cohesion is calculate from the structural information for example method attributes and references. In c...
متن کاملExploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval
The graph structure of a conceptual graph can be used for eecient retrieval in complex (graphical) object databases. The aim is to replace most graph matching with eecient operations on precompiled codes for graphs. The unlabeled graph or \skeleton" of a type-labeled conceptual graph (without negated contexts) can be used as a lter for matching, subsumption testing, and uniication. For two type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003