Keyboard shortcuts

/ or ⌘/Ctrl K
Find a note
j / k
Next / previous section or linked note
h / l
Collapse or go to parent / expand or enter
e or Alt-click
Read a linked note here
o
Open focused note on its own
g g / G
First / last section or linked note
g h / g a
Home / all notes
g b / g t
Backlinks / table of contents
t
Cycle System, Light, Dark
? / Esc
Show / close this reference

Search: ↑/↓ or Ctrl N/P, Enter to open. Shortcuts pause while typing.

natural language inference lecture [3e45f9d2]

Tags: ling-ga 1012 (nlp and semantics)

1. intro

  • Motivating question: can neural network methods do anything that resembles compositional semantics?

    • What's our metric? How do we know we've accomplished a goal?
  • also sometimes called recongizing textual entailment (rte) - same as nli
  • example: premise -> hypothesis, does the premise entail the hypothesis?

    • Ido Dagan 05

      We say that T entails H, if typically, a human reading T would infer that H is most likely true

    • NLI entailment is a lot more loose than semantic entailment

      • same looseness applies to contradiction
  • what is the meaning of a sentence?

    • this is unproductive, we can't really know what """meaning""" is
    • alternative question: what concrete phenomena do you have to deal with to understand a sentence?

      • focus on behaviors instead
      • for NLI to work, you need to understand a lot:

        file:2021-03-15_19-24-05_screenshot.png

      • NLI is an ungrounded tasks - we do not require systems to look at situations outside of langauge
  • if you know the truth condition of two sentences, can you work out if one entails the other?

    file:2021-03-15_19-30-52_screenshot.png

  • NLI asks us to reasonable about things even if we don't know what it means

2. datasets

3. learning

3.1. Feature based models

  • logistic regression, bag of words features on hypthesis, bag of word-pairs features to capture alignment, tree kernels

3.2. natural logic

  • rules based
  • non ML work on NLI is here
  • formal logic for deriving entailments between a pair of sentences
  • operates directly on words
  • generally sound, entailment here means actual entailment

    • but not complete, cannot detect some entailments
    • requires clear structural parallels
    • most NLI datasets won't work with this

3.3. theorem proving

  • attempts to translate sentences into logical forms
  • open-domain semantic parsing is still hard
  • more difficult than natural logic

3.4. deep learning

  • 2015-17 - attempted to built DL systems that understood natural logic

2021-03-15_20-25-46_screenshot.png

  • machinery has gotten very complex, and BERT style models have replaced it

4. applications

  • 3 major types

    • direct application

    • nli as a research and evaluation tasks

      • very used for benchmarking
      • glue
      • caveat

        • state of the art benchmark is very close to human performance
        • in other words, state of the art datasets are not high quality enough, so the datasets are "solved"
    • nli as a pretraining task in transfer learning

      • if you teach a model NLI, it should be reasonably good at other tasks
      • take a model, fine tune it on MNLI, and then fine tune it again
      • this works well even in conjunction with strong baselines for pretraining like RoBERTa

5. beyond nli