Calculating extension of partial parse using dependency relation

摘要

Parsing natural language comprising

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 heads and roles of the token and storing the A most likely partial parses

c) advancing to the next token and, for each of the A partial parses

iv) calculating a 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) until all n tokens have been parsed.