{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:01:20Z","timestamp":1747224080987,"version":"3.40.5"},"reference-count":40,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>E-learning plays a significant role in educating large number of students. In the delivery of e-learning material, automatic e-assessment has been applied only to some extent in the case of free response answers in highly technical diagrams in domains like software engineering, electronics, etc., where there is a great scope of imagination and wide variations in answers. Therefore, the automatic assessment of diagrammatic answers is a challenging task. In this article, algorithms that compute the syntactic and semantic similarities of nodes to fulfill the objective of automatic assessment of use-case diagrams are described. To illustrate the performance of these algorithms, students' use-case diagrams are matched with model use-case diagram. Results from 13,749 labels of 445 student answers based on 14 different scenarios are analyzed to provide quantitative and qualitative feedback. No comparable study has been reported by any other label matching algorithms before in the research literature.<\/jats:p>","DOI":"10.4018\/ijdet.2019070105","type":"journal-article","created":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:31:06Z","timestamp":1556562666000},"page":"75-95","source":"Crossref","is-referenced-by-count":3,"title":["Framework To Approximate Label Matching For Automatic Assessment Of Use-Case Diagram"],"prefix":"10.4018","volume":"17","author":[{"given":"Vinay","family":"Vachharajani","sequence":"first","affiliation":[{"name":"School of Computer Studies, Ahmedabad University, Ahmedabad, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6825-4803","authenticated-orcid":true,"given":"Jyoti","family":"Pareek","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gujarat University, Ahmedabad, India"}]}],"member":"2432","reference":[{"key":"IJDET.2019070105-0","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(74)90020-5"},{"key":"IJDET.2019070105-1","first-page":"181","article-title":"Assessment system for UML class diagram using notations extraction.","volume":"7","author":"N. H.Ali","year":"2007","journal-title":"International Journal on Computer Science Network Security"},{"key":"IJDET.2019070105-2","unstructured":"Atkinson, K. (n.d.). GNU Aspell Spell Checker. Retrieved from http:\/\/aspell.net\/"},{"key":"IJDET.2019070105-3","unstructured":"Batmaz, F., & Hinde, C. J. (2006). A diagram drawing tool for semi\u2013automatic assessment of conceptual database diagrams."},{"key":"IJDET.2019070105-4","doi-asserted-by":"publisher","DOI":"10.1007\/s11412-007-9018-0"},{"key":"IJDET.2019070105-5","doi-asserted-by":"publisher","DOI":"10.1109\/ITCC.2004.1286480"},{"key":"IJDET.2019070105-6","unstructured":"Charniak, E. (2000, April). A maximum-entropy-inspired parser. In Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference (pp. 132-139). Association for Computational Linguistics."},{"key":"IJDET.2019070105-7","first-page":"449","article-title":"Generating typed dependency parses from phrase structure parses.","volume":"6","author":"M. C.De Marneffe","year":"2006","journal-title":"Proceedings of LREC"},{"key":"IJDET.2019070105-8","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50060-3"},{"key":"IJDET.2019070105-9","unstructured":"Frakes, W. (1992) Stemming Algorithms. In W. Frakes and R. Baeza-Yates (Eds.), Information Retrieval: Data Structures and Algorithms. Englewood Cliffs, NJ: Prentice-Hall"},{"key":"IJDET.2019070105-10","unstructured":"Frandsen, F. (n.d.). Java API For Hunspell Spell Checker. Retrieved from http:\/\/dion.swamp.dk\/hunspell.html"},{"key":"IJDET.2019070105-11","first-page":"1","article-title":"Semantic matching: Algorithms and implementation.","volume":"9","author":"F.Giunchiglia","year":"2007","journal-title":"Journal on Data Semantics"},{"issue":"3","key":"IJDET.2019070105-12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3233\/SW-2011-0036","article-title":"S-Match: An open source framework for matching lightweight ontologies.","volume":"3","author":"F.Giunchiglia","year":"2012","journal-title":"Semantic Web"},{"key":"IJDET.2019070105-13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(74)90044-8"},{"key":"IJDET.2019070105-14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199101)42:1<7::AID-ASI2>3.0.CO;2-P"},{"key":"IJDET.2019070105-15","doi-asserted-by":"publisher","DOI":"10.1145\/290320.283089"},{"key":"IJDET.2019070105-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2008.02.006"},{"key":"IJDET.2019070105-17","doi-asserted-by":"crossref","unstructured":"Jayal A., Shepperd M. (2009). The Problem of Labels in E-Assessment of Diagrams. ACM Journal on Educational Resources in Computing, 8(4).","DOI":"10.1145\/1482348.1482351"},{"key":"IJDET.2019070105-18","unstructured":"Lachowicz, D. (n.d.). Enchant Spell Checker. Retrieved from https:\/\/github.com\/AbiWord\/enchant\/"},{"issue":"1-2","key":"IJDET.2019070105-19","first-page":"22","article-title":"Development of a Stemming Algorithm. Mechanical Translation and Computational Linguistics, MIT Information Processing Group","volume":"11","author":"J. B.Lovins","year":"1968","journal-title":"Electronic Systems Laboratory"},{"key":"IJDET.2019070105-20","first-page":"49","article-title":"Generic schema matching with Cupid.","volume":"Vol. 1","author":"J.Madhavan","year":"2001","journal-title":"Proceedings of VLDB"},{"key":"IJDET.2019070105-21","first-page":"117","article-title":"Similarity Flooding: A versatile graph matching algorithm.","author":"S.Melnik","year":"2002","journal-title":"Proceedings of ICDE"},{"key":"IJDET.2019070105-22","article-title":"Intelligent essay marking system","author":"P. Y.Ming","year":"2000","journal-title":"Learners Together, NgeeANN Polytechnic,"},{"key":"IJDET.2019070105-23","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"IJDET.2019070105-24","unstructured":"Nemeth, N. (n.d.). Hunspell open source spell checking. Retrieved from http:\/\/hunspell.sourceforge.net\/"},{"key":"IJDET.2019070105-25","doi-asserted-by":"crossref","unstructured":"Paice, C. (1990). Another Stemmer. ACM SIGIR Forum, 24(3), 56-61.","DOI":"10.1145\/101306.101310"},{"key":"IJDET.2019070105-26","doi-asserted-by":"publisher","DOI":"10.1108\/eb046814"},{"key":"IJDET.2019070105-27","first-page":"38","article-title":"Automated checks on UML diagrams.","author":"M.Striewe","year":"2011","journal-title":"Proceedings of the 16th annual joint conference on Innovation and technology in computer science education"},{"key":"IJDET.2019070105-28","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/2591708.2602657","article-title":"Automated assessment of UML activity diagrams.","author":"M.Striewe","year":"2014","journal-title":"Proceedings of the 2014 conference on Innovation & technology in computer science education"},{"key":"IJDET.2019070105-29","doi-asserted-by":"publisher","DOI":"10.1145\/1151954.1067490"},{"key":"IJDET.2019070105-30","unstructured":"Thomas, P. G., Waugh, K., & Smith, N. (2007). Learning and automatically assessing graph-based diagrams. In Beyond Control: learning technology for the social network generation. Research Proceedings of the 14th Association for Learning Technology Conference (ALT-C), Nottingham, UK, September 4-6 (pp. 61-74)."},{"key":"IJDET.2019070105-31","doi-asserted-by":"crossref","unstructured":"Thomas, P., Smith, N., & Waugh, K. (2007). Computer assisted assessment of diagrams. ACM SIGCSE Bulletin, 39(3).","DOI":"10.1145\/1269900.1268806"},{"key":"IJDET.2019070105-32","unstructured":"Thomas, P., Smith, N., & Waugh, K. (2008). Automatic assessment of sequence diagrams."},{"key":"IJDET.2019070105-33","unstructured":"Thomas, P., Waugh, K., & Smith, N. (2012). Automatically assessing free-form diagrams in E-assessment systems. In 1st HEA Aiming for Excellence in STEM Learning and Teaching Annual Conference, Imperial College London."},{"key":"IJDET.2019070105-34","unstructured":"Tselonis, C., Sargeant, J., & McGee Wood, M. (2005). Diagram matching for human-computer collaborative assessment."},{"key":"IJDET.2019070105-35","doi-asserted-by":"crossref","unstructured":"Vachharajani, V., Pareek, J., & Gulabani, S. (2012, July). Effective Label Matching for Automatic Evaluation of Use--Case Diagrams. In 2012 IEEE Fourth International Conference on Technology for Education (T4E) (pp. 172-175). IEEE.","DOI":"10.1109\/T4E.2012.33"},{"key":"IJDET.2019070105-36","doi-asserted-by":"crossref","unstructured":"Vachharajani, V., & Pareek, J. (2012, July). Use case extractor: XML parser for automated extraction and storage of use-Case diagram. In 2012 IEEE International Conference on Engineering Education: Innovative Practices and Future Trends (AICERA) (pp. 1-5). IEEE.","DOI":"10.1109\/AICERA.2012.6306714"},{"issue":"4","key":"IJDET.2019070105-37","article-title":"A proposed architecture for automated assessment of use case diagrams.","volume":"108","author":"V.Vachharajani","year":"2014","journal-title":"International Journal of Computers and Applications"},{"key":"IJDET.2019070105-38","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-0129-1_11"},{"key":"IJDET.2019070105-39","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"}],"container-title":["International Journal of Distance Education Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=228187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T05:00:13Z","timestamp":1694840413000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDET.2019070105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijdet.2019070105","relation":{},"ISSN":["1539-3100","1539-3119"],"issn-type":[{"type":"print","value":"1539-3100"},{"type":"electronic","value":"1539-3119"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}