Professional Documents
Culture Documents
b. Add arc to chart. (Only do this if edge is not already on the chart!)
c. Use the fundametal rule to combine this arc with arcs from the chart.
Any edges obtained in this way should be added to the agenda.
End repeat
3. See if the chart contains a passive edge from the first node to the last
node that has the label s. If ``yes'', succeed. If ``no'', fail.
This algorithm is very general; especially step (2d). By being more precise about
when and how we predict new hypotheses it is easy to try out different parsing
strategies. We'll soon see how 2c is carried out in the bottom-up case, and in
the next chapter we'll learn how it is carried out in the top-down case.
Actually, it's not only the way 2c is handled that leads to different concrete
algorithms. We also have to initialize the agenda slightly differently in the
bottom-up and top-down cases. That is, there are different ways of carrying out
step 1.
cs.union.edu/~striegnk/courses/nlp-with-prolog/html/node70.html#l9.sec.general.algorithm 1/1