Parsing method
First Claim
1. A method of parsing natural language comprising the steps of:
- a) receiving a tokenised and part-of-speech tagged utterance comprising n tokens b) for the first token;
i) calculating a partial parse consisting of one dependency relation by assigning a role and a head for the first token;
ii) calculating the probability of the partial parse from step (i) iii) repeating steps (b)(i) and (b)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses c) advancing to the next successive token and, for each of the A partial parses from the previous step;
i) calculating a possible next extension to the partial parse by one dependency relation ii) calculating the probability of the extended partial parse from (c)(i) iii) repeating steps (c)(i) and (c)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses d) repeating step (c) for each successive token until all n tokens have been parsed.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of parsing natural language comprising the steps of: a) receiving a tokenised and part-of-speech tagged utterance comprising n tokens b) for the first token; i) calculating a partial parse consisting of one dependency relation by assigning a role and a head for the first token; ii) calculating the probability of the partial parse from step (i) iii) repeating steps (b)(i) and (b)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses c) advancing to the next successive token and, for each of the A partial parses from the previous step: iv) calculating a possible next extension to the partial parse by one dependency relation v) calculating the probability of the extended partial parse from (c)(i) vi) repeating steps (c)(i) and (c)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses d) repeating step (c) for each successive token until all n tokens have been parsed.
-
Citations
9 Claims
-
1. A method of parsing natural language comprising the steps of:
-
a) receiving a tokenised and part-of-speech tagged utterance comprising n tokens b) for the first token;
i) calculating a partial parse consisting of one dependency relation by assigning a role and a head for the first token;
ii) calculating the probability of the partial parse from step (i) iii) repeating steps (b)(i) and (b)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses c) advancing to the next successive token and, for each of the A partial parses from the previous step;
i) calculating a possible next extension to the partial parse by one dependency relation ii) calculating the probability of the extended partial parse from (c)(i) iii) repeating steps (c)(i) and (c)(ii) for all possible heads and roles of the token and storing the A most likely resulting partial parses d) repeating step (c) for each successive token until all n tokens have been parsed. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
Specification