Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/1457
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYadav, Anunay
dc.contributor.authorChakraborty, Tanmoy (Advisor)
dc.contributor.authorAkhtar, Md. Shad (Advisor)
dc.contributor.authorBagler, Ganesh (Advisor)
dc.date.accessioned2024-05-14T12:39:36Z
dc.date.available2024-05-14T12:39:36Z
dc.date.issued2021-12
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/1457
dc.description.abstractArgument mining is a rising research area in natural language processing, the goal of which is to extract argumentative structures from natural language texts. Such components contain a lot of information not only limited to objective questions such as finding the location, etc., but can also answer many subjective questions as to why someone holds this opinion. Argument mining has already been applied in social media platforms, legal, and newspapers as a qualitative assessment tool, providing a powerful tool for analysis to analysts without prior knowledge of the domain. Being such a complex task, little research is done in explaining the state-of-the-art models in this domain. In this project, we are trying to analyze the workings of these models as to why they behave in this way and verify it. We expect to give a combined algorithm that does the above and presents it in an explainable and human-comprehensible format so that users without any prior knowledge can understand the model’s inner workings and verify it according to their respective tasks.en_US
dc.language.isoen_USen_US
dc.publisherIIIT-Delhien_US
dc.subjectArgument Miningen_US
dc.subjectNLPen_US
dc.subjectLIMEen_US
dc.subjectExplainable AIen_US
dc.titleModel explainability - in Context of Argument Miningen_US
dc.typeThesisen_US
Appears in Collections:Year-2021

Files in This Item:
File Description SizeFormat 
BTP_Report_Anunay.pdf
  Restricted Access
3.13 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.