Anthill Inside Miniconf – Pune

Machine Learning, Deep Learning and Artificial Intelligence: concepts, applications and tools.

Shourya Roy

@shourya

How similar are two pieces of text? A moderately broad and deep dive in one of the fundamental topics in NLP.

Submitted Nov 12, 2017

I will talk about a fundamental problem of measuring similarity between two pieces of text. This problem appears in many contexts from search and information retrieval, natural language inferencing, plagiarism detection, answer scoring, machine translation, (near) duplicate detection etc. I will give an overview of some fundamentals, key formulations and approaches of work that is present in the literature.

The talk will center around scenarios where there are notions of application dependent similarity scores. I will use the example of automatically grading student answers against instructor-provided model answers (Automatic Short Answer Grading or ASAG). Given a question, a model answer - how can we automatically grade short answers where the answers are a sentence to a paragraph long. I will show various nuances of text similarity formulation for such applications and associated challenges.
I will introduce a range of generic unsupervised, semi-supervised and supervised techniques for measuring similarity. We will deep dive into couple of state of the art approaches - one based on classical pattern mining and word2vec and the other based on Siamese LSTM networks with a new cost function inspired by Earth Movers Distance (EMD).
This talk will be based on various papers published in 2016-17 in reputed conferences such as IJCAI, ECAI and COLING.

Outline

  1. Text Similarity
    a. Definition and scope
  2. Application Areas
    a. Information retrieval
    b. Paraphrase detection
    c. Natural language inference
    d. Plagiarism detection
  3. Types of Similarity
  4. Techniques
    a. Supervised
    i. Classical techniques
    ii. Deep neural network based techniques
    b. Unsupervised
    i. Lexical
    ii. Semantic
  5. Automatic Short Answer Grading
    a. Context and motivation
    b. Word-similarity based techniques
    i. Wisdom of students
    c. Siamese LSTM-based supervised ASAG technique
  6. Conclusion

Speaker bio

Shourya Roy is the Head and Vice President of American Express Big Data Labs (BDL) which he took up in December 2016. He is responsible for establishing and executing the technical agenda for BDL working closely with the broader Decision Science community and business units. Shourya is leading a team of scientists and engineers in the areas of machine learning, artificial intelligence, deep learning and cloud computing. Prior to joining American Express, Shourya spent nearly fifteen years in the labs of IBM and Xerox playing several leadership roles in technical research, research and strategic management, customer facing business development.

Shourya’s technical expertise spans Text and Data Mining, Natural Language Processing, Machine Learning, and Big Data in which he is a well-known thought leader in several communities. His work has led to more than 60 publications in premier journals and conferences. He has been granted about 15 patents while tens of patent applications are currently in different stages of patent lifecycle. He is an active member of the ACM and ACL communities - as a part of which he has been associated with multiple conference and workshop organisations.

Shourya holds Ph.D., Masters and Bachelors Degrees in Computer Science from IISc Bangalore, IIT Bombay and Jadavpur University respectively. Shourya also has an MBA from Faculty of Management Studies (FMS), Delhi University.

Comments

{{ gettext('Login to leave a comment') }}

{{ gettext('Post a comment…') }}
{{ gettext('New comment') }}
{{ formTitle }}

{{ errorMsg }}

{{ gettext('No comments posted yet') }}

Hosted by

Anthill Inside is a forum for conversations about risk mitigation and governance in Artificial Intelligence and Deep Learning. AI developers, researchers, startup founders, ethicists, and AI enthusiasts are encouraged to: more