Componentized slot-filling architecture
First Claim
1. A natural language processing machine interface system comprising:
- a mapper component that maps at least one token representing a string of characters broken out of natural language input to a task performed by a downstream software application and generates a lattice that includes at least one interpretation for the at least one token;
a decoder component that generates at least one path that traverses the lattice, the mapper component and decoder component are independent, such that modification of at least one of the mapper component and the decoder component does not affect the other component; and
a post-processor component that generates a semantic solution, representing the at least one path, that the downstream software application uses as input data to implement the task.
2 Assignments
0 Petitions
Accused Products
Abstract
The subject disclosure pertains to systems and methods for performing natural language processing in which tokens are mapped to task slots. The system includes a mapper component that generates a lattice representing possible interpretations of the tokens, a decoder component that creates a ranked list of paths traversing the lattice, a scorer component that generates scores used to rank paths and post-processing components that format the paths for use by other software. Each of these components may be independent, such that the component may be modified or replaced without affecting the remaining components. This allows a variety of different mathematical models and algorithms to be tested or deployed without requiring changes to the remainder of the system.
-
Citations
20 Claims
-
1. A natural language processing machine interface system comprising:
-
a mapper component that maps at least one token representing a string of characters broken out of natural language input to a task performed by a downstream software application and generates a lattice that includes at least one interpretation for the at least one token;
a decoder component that generates at least one path that traverses the lattice, the mapper component and decoder component are independent, such that modification of at least one of the mapper component and the decoder component does not affect the other component; and
a post-processor component that generates a semantic solution, representing the at least one path, that the downstream software application uses as input data to implement the task. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A natural language analysis method comprising:
-
mapping at least one token representing a string of characters broken out of natural language input to a task performed by a downstream machine application using a mapper component;
generating a lattice that includes at least one interpretation of at least one token using the mapper component; and
generating at least one path that traverses the lattice using a decoder component, the mapper component and decoder component are independent;
modifying one of the mapper component and the decoder component does not entail modifying the other component; and
generating a semantic solution representing the at least one path, using a post-processor component the downstream machine application uses the semantic solution as input data to implement the task. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
-
18. A natural language system:
-
means for mapping at least one token representing a string of characters broken out of natural language input to a task performed by a downstream machine application;
means for generating a lattice based at least in part upon the at least one token and the task;
means for generating at least one path that traverses the lattice, the means for mapping and the means for generating at least one path are independent, such that modification of at least one of the means for mapping and the means for generating at least one path does not affect the other component; and
means for generating a semantic solution, representing the at least one path, that the downstream machine application uses as input data to implement the task. - View Dependent Claims (19, 20)
-
Specification