{"title":"学习者理解能力的评估:一个实验结果","authors":"Adidah Lajis, N. A. Aziz","doi":"10.1109/ICCTD.2009.109","DOIUrl":null,"url":null,"abstract":"Assessing leaner’s answers is very time consuming for educators and limits them to be involved in other activities. In many cases, exam papers comprise of questions that require learners to write at least one or two sentences toe express their understanding. However, there are not many computer-based assessment tools due to limitations in computerized marking technology. Our research attempts to address this limitation by introducing a technique to evaluate short free text answer. It is based on a hybrid approach that combines natural language processing, information extraction and artificial intelligence. A textual answer is converted into a node link representation to extract the hidden knowledge structure. We then apply excess entropy to compute the amount of known information for each model and later compute the score accordingly.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Assessment of Leaner's Understanding: An Experimental Result\",\"authors\":\"Adidah Lajis, N. A. Aziz\",\"doi\":\"10.1109/ICCTD.2009.109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Assessing leaner’s answers is very time consuming for educators and limits them to be involved in other activities. In many cases, exam papers comprise of questions that require learners to write at least one or two sentences toe express their understanding. However, there are not many computer-based assessment tools due to limitations in computerized marking technology. Our research attempts to address this limitation by introducing a technique to evaluate short free text answer. It is based on a hybrid approach that combines natural language processing, information extraction and artificial intelligence. A textual answer is converted into a node link representation to extract the hidden knowledge structure. We then apply excess entropy to compute the amount of known information for each model and later compute the score accordingly.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assessment of Leaner's Understanding: An Experimental Result
Assessing leaner’s answers is very time consuming for educators and limits them to be involved in other activities. In many cases, exam papers comprise of questions that require learners to write at least one or two sentences toe express their understanding. However, there are not many computer-based assessment tools due to limitations in computerized marking technology. Our research attempts to address this limitation by introducing a technique to evaluate short free text answer. It is based on a hybrid approach that combines natural language processing, information extraction and artificial intelligence. A textual answer is converted into a node link representation to extract the hidden knowledge structure. We then apply excess entropy to compute the amount of known information for each model and later compute the score accordingly.