Computerized analysis of a concept map (CM) syntactic and semantic characteristics can become a complex task,whose results can be doubtful if the map contains either graphical or textual ambiguities. In the specific case of using CMs ineducation, the use of the results of automatic structural analysis of a map in learning assessment implies the existence of entirelycomputable maps, capable of coping with the inherently ambiguous nature of the language used in their construction, whichresults in imprecise concepts and linking phrases. This imprecision hinders initiatives toward computer processing of CMs. Inthis paper, we present a strategy to minimize the imprecision of linking phrases, by analyzing the nature of inclusivity inhierarchies of concepts in CMs. We present a formal extensible notation capable of distinguishing among the subtleties of thesehierarchies. Based on this formalization, it is possible not only to determine precisely the dimension of inclusivity specified in aproposition, but also to define methods capable of determining the semantic distance between propositions in CMs.
%0 Conference Paper
%1 costa04linking
%A da Costa Jr, Júlio Valente
%A da Rocha, Francisco Edson Lopes
%A Favero, Eloi Luiz
%B Proc. of the First Int. Conference on Concept Mapping
%D 2004
%K research.conceptual.generation research.kr.ontologies cites.pclass.d cites.cm.d
%T Linking Phrases in Concept Maps: A Study on the Nature of Inclusivity
%X Computerized analysis of a concept map (CM) syntactic and semantic characteristics can become a complex task,whose results can be doubtful if the map contains either graphical or textual ambiguities. In the specific case of using CMs ineducation, the use of the results of automatic structural analysis of a map in learning assessment implies the existence of entirelycomputable maps, capable of coping with the inherently ambiguous nature of the language used in their construction, whichresults in imprecise concepts and linking phrases. This imprecision hinders initiatives toward computer processing of CMs. Inthis paper, we present a strategy to minimize the imprecision of linking phrases, by analyzing the nature of inclusivity inhierarchies of concepts in CMs. We present a formal extensible notation capable of distinguishing among the subtleties of thesehierarchies. Based on this formalization, it is possible not only to determine precisely the dimension of inclusivity specified in aproposition, but also to define methods capable of determining the semantic distance between propositions in CMs.
@inproceedings{costa04linking,
abstract = {Computerized analysis of a concept map (CM) syntactic and semantic characteristics can become a complex task,whose results can be doubtful if the map contains either graphical or textual ambiguities. In the specific case of using CMs ineducation, the use of the results of automatic structural analysis of a map in learning assessment implies the existence of entirelycomputable maps, capable of coping with the inherently ambiguous nature of the language used in their construction, whichresults in imprecise concepts and linking phrases. This imprecision hinders initiatives toward computer processing of CMs. Inthis paper, we present a strategy to minimize the imprecision of linking phrases, by analyzing the nature of inclusivity inhierarchies of concepts in CMs. We present a formal extensible notation capable of distinguishing among the subtleties of thesehierarchies. Based on this formalization, it is possible not only to determine precisely the dimension of inclusivity specified in aproposition, but also to define methods capable of determining the semantic distance between propositions in CMs.},
added-at = {2009-06-25T16:49:31.000+0200},
author = {da Costa Jr, Júlio Valente and da Rocha, Francisco Edson Lopes and Favero, Eloi Luiz},
biburl = {https://www.bibsonomy.org/bibtex/241605d42eda541b239a5e45946ed648a/msn},
booktitle = {Proc. of the First Int. Conference on Concept Mapping},
file = {costa04linking.pdf:papers\\cmap\\costa04linking.pdf:PDF},
interhash = {6a0195cec840b6aadda89cf44ebe4f85},
intrahash = {41605d42eda541b239a5e45946ed648a},
keywords = {research.conceptual.generation research.kr.ontologies cites.pclass.d cites.cm.d},
timestamp = {2009-06-25T16:49:31.000+0200},
title = {Linking Phrases in Concept Maps: A Study on the Nature of Inclusivity},
year = 2004
}