Parsing: Earley-Algorithm grammar: G1 input: i 0

example

the

little

baby

needs

bed

wordi -

1 the

2 little

new items <0,0, S .NP VP> <0,0, NP .Det N> <0,0, Det .the> <0,0, Det .a> <0,0, Det .his> <0,1, Det the.> <0,1, NP Det.N> <1,1, N .A N> <1,1, A .little> <1,1, A .nice> <1,1, A .warm> <1,1, N .baby> <1,1, N .bed> <1,1, N .pillow> <1,2, A little.> <1,2, N A.N> <2,2, N .A N> <2,2, A .little> <2,2, A .nice> <2,2, A .warm> <2,2, N .baby> <2,2, N .bed> <2,2, N .pillow>

step Initial. Predictor Predictor Predictor Predictor Scanner Completer Predictor Predictor Predictor Predictor Predictor Predictor Predictor Scanner Completer Predictor Predictor Predictor Predictor Predictor Predictor Predictor

i 3

wordi baby

4 needs

5 a

6 bed

new items <2,3, N baby.> <1,3, N A N.> <0,3, NP Det N.> <0,3, S NP.VP> <3,3, VP .V NP> <3,3, VP .V NP PP> <3,3, V .needs <3,3, V .has <3,3, V .sees <3,4, V needs.> <3,4, VP V.NP> <3,4, VP V.NP PP> <4,4, NP .Det N> <4,4, Det .the> <4,4, Det .a> <4,4, Det .his> <4,5, Det a.> <4,5, NP Det.N> <5,5, N .A N> <5,5, A .little> <5,5, A .nice> <5,5, A .warm> <5,5, N .baby> <5,5, N .bed> <5,5, N .pillow> <5,6, N bed.> <4,6, NP Det N.> <3,6, VP V NP.> <3,6, VP V NP.PP> <0,6, S NP VP.> <6,6, PP .P NP> <6,6, P .without> <6,6, P .for>

step Scanner Completer Completer Completer Predictor Predictor Predictor Predictor Predictor Scanner Completer Completer Predictor Predictor Predictor Predictor Scanner Completer Predictor Predictor Predictor Predictor Predictor Predictor Predictor Scanner Completer Completer Completer Completer Predictor Predictor Predictor