We can consider Counterfactuals as belonging in the domain of Discourse structure and
semantics(Prasad et al., 2008), A core area in Natural Language Understanding and in this paper, we introduce an approach to resolving counterfactual detection as well as the indexing of
the antecedents and consequents of Counterfactual statements. While Transfer learning is already being applied to several NLP tasks( Raffel et al., 2019), It has the characteristics to excel
in a novel number of tasks. We show that detecting Counterfactuals is a straightforward Binary
Classification Task that can be implemented with minimal adaptation on already existing model
Architectures, thanks to a well annotated training data set,and we introduce a new end to end
pipeline to process antecedents and consequents as an entity recognition task, thus adapting them
into Token Classification