Back to results
US 2014/0236578 A1Published application
Question-Answering by Recursive Parse Tree Descent
AssigneeNEC Laboratories America, Inc.
InventorsChristopher Malon, Bing Bai
Life of this patent
Estimating the term…
Abstract
Systems and methods are disclosed to answer free form questions using recursive neural network (RNN) by defining feature representations at every node of a parse trees of questions and supporting sentences, when applied recursively, starting with token vectors from a neural probabilistic language model; and extracting answers to arbitrary natural language questions from supporting sentences.
Claims20
A method to answer free form questions using recursive neural network (RNN), comprising:
- defining feature representations at every node of a parse trees of questions and supporting sentences, when applied recursively, starting with token vectors from a neural probabilistic language model;
- and
- extracting answers to arbitrary natural language questions from supporting sentences.
A method for representing a word, comprising:
- extracting n-dimensions for the word from an original language model;
- and
- if the word has been previously processed, use values previously chosen to define an (n+m) dimensional vector and otherwise randomly selecting m values to define the (n+m) dimensional vector.
A system, comprising
- a processor to run a recursive neural network (RNN) to answer free form questions;
- computer code for defining feature representations at every node of a parse trees of questions and supporting sentences, when applied recursively, starting with token vectors from a neural probabilistic language model;
- and
- computer code for extracting answers to arbitrary natural language questions from supporting sentences.
1 more element
Dependencies are inferred from the claim text.