Open Question Answering Over Curated and Extracted Knowledge Bases - - PowerPoint PPT Presentation

open question answering over curated and extracted
SMART_READER_LITE
LIVE PREVIEW

Open Question Answering Over Curated and Extracted Knowledge Bases - - PowerPoint PPT Presentation

Open Question Answering Over Curated and Extracted Knowledge Bases Anthony Fader, Luke Zettlemoyer, Oren Etzioni Allen Institute for AI Presented by: Yashoteja Prabhu Slide Credits: Gareth Dwyer, Paper Authors Open-Domain


slide-1
SLIDE 1

Open Question Answering Over Curated and Extracted Knowledge Bases

Anthony Fader, Luke Zettlemoyer, Oren Etzioni Allen Institute for AI

Presented by: Yashoteja Prabhu Slide Credits: Gareth Dwyer, Paper Authors

slide-2
SLIDE 2

Open-Domain Question-Answering

  • No domain restriction on the questions
  • Unlike closed domain QnA
  • Cannot rely too much on
  • FAQ collection
  • Fixed set of books/documents
  • Domain knowledge derived QnA templates
  • Natural language queries
  • Same question can be asked in numerous ways:

How can I tell if I have strep throat ? What are the signs of strep throat ?

slide-3
SLIDE 3
slide-4
SLIDE 4
slide-5
SLIDE 5

Closed Domain

slide-6
SLIDE 6

Current Work: An Example Derivation

10 hand-written precise templates

  • Too many ways of asking the same question
  • Convert to equivalent questions which are

easy to parse

  • Also Wh-questions are easier to answer
  • Parsing: Convert to KB-friendly conjunction of

relations

  • Uses small and fixed set of templated
  • Multiple equivalent relations exist
  • KB only contains some of those
  • Rewrite to equivalent relation present in KB
  • Search the relation in KB to obtain answers
slide-7
SLIDE 7
slide-8
SLIDE 8

= log 𝑞(𝑦, 𝑧) 𝑞 𝑦 𝑞(𝑧)

slide-9
SLIDE 9

Features:

  • Indicator function for the pattern used
  • POS sequence of matched arguments
slide-10
SLIDE 10
slide-11
SLIDE 11
slide-12
SLIDE 12
slide-13
SLIDE 13
slide-14
SLIDE 14
slide-15
SLIDE 15
slide-16
SLIDE 16
slide-17
SLIDE 17
slide-18
SLIDE 18
slide-19
SLIDE 19
slide-20
SLIDE 20
slide-21
SLIDE 21
slide-22
SLIDE 22
slide-23
SLIDE 23
slide-24
SLIDE 24
slide-25
SLIDE 25

Discussion - Pros

  • Breaking into subproblems is advantageous and improves P-R [Barun, Dinesh,

Surag, Arindam, Anshul]

  • Thorough ablation study [Barun, Nupur, Rishabh, Shantanu]
  • Lot of examples (including negative ones) [Gagan, Haroun]
  • Unlexicalised approach is advantageous [Gagan]
  • Indirect supervision using QA pairs is nice [Arindam]
  • Multiple KBs [Rishabh]
slide-26
SLIDE 26

Discussion - Cons

  • 10 handwritten templates not enough in parsing [Barun, Anshul, Prachi]
  • Handling of no derivation case [Barun, Dinesh]
  • Query rewriting seems useless [Barun]
  • Correct but lengthy derivations are wrongly penalized [Surag]
  • Beam search uses same parameter for all derivation steps [Anshul]
slide-27
SLIDE 27

Discussion - Questions

  • Shouldn't query-rewriting and paraphrasing compensate for the lack of lexical

features in the system? [Nupur]

  • What happens if the high confidence gold answer set is incomplete, and the

knowledge base has the answer and system figure out the answer? I think this would be more valid for WikiAnswers where are no answers [Rishabh]

  • Others ?!
slide-28
SLIDE 28

Discussion - Extensions

  • Word/Phrase/deep embeddings [Surag, Barun, Arindam, Rishabh, Prachi]
  • RL instead of beam search [Barun]
  • Perceptron could be based on approx. answer matching [Gagan]
  • Extension to True/False type answers [Gagan]
  • Combining KB and search engine for better recall [Rishabh]
  • Modifying scoring function to be non-linear
slide-29
SLIDE 29
slide-30
SLIDE 30