Please use this identifier to cite or link to this item:
|Title:||Time and Semantic Similarity – What is the Best Alternative to Capture Implicit Links in CSCL Conversations?|
|Publisher:||Philadelphia, PA: International Society of the Learning Sciences.|
|Citation:||Gutu, G., Dascalu, M., Rebedea, T., & Trausan-Matu, S. (2017). Time and Semantic Similarity – What is the Best Alternative to Capture Implicit Links in CSCL Conversations? In Smith, B. K., Borge, M., Mercier, E., and Lim, K. Y. (Eds.). (2017). Making a Difference: Prioritizing Equity and Access in CSCL, 12th International Conference on Computer Supported Collaborative Learning (CSCL) 2017, Volume 1. Philadelphia, PA: International Society of the Learning Sciences.|
|Abstract:||The goal of our research is to compare novel semantic techniques for identifying implicit links between utterances in multi-participant CSCL chat conversations. Cohesion, reflected by the strength of the semantic relations behind the automatically identified links, is assessed using WordNet-based semantic distances, as well as unsupervised semantic models, i.e. Latent Semantic Analysis (LSA) and Latent Dirichlet Allocation (LDA). The analysis is built on top of the ReaderBench framework and multiple identification heuristics were compared, including: semantic cohesion metrics, normalized cohesion measures and Mihalcea’s formula. A corpus of 55 conversations in which participants used explicit links between utterances where they considered necessary for clarity was used for validation. Our study represents an in-depth analysis of multiple methods used to identify implicit links and reveals the accuracy of each technique in terms of capturing the explicit references made by users. Statistical similarity measures ensured the best overall identification accuracy when using Mihalcea’s formula, while WordNet-based techniques provided best results for un-normalized similarity scores applied on a window of 5 utterances and a time frame of 1 minute.|
|Appears in Collections:||CSCL 2017|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.