Natural Language Processing Ch3. Parsing with PSG
Natural Language Processing Ch3. Parsing with PSG
Natural Language Processing Ch3. Parsing with PSG
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
PP à Prep NP . [8,10] Completer<br />
Nom à Nom PP. [3,10] Completer<br />
NP à Det Nom. [2,10] Completer<br />
VP à V NP [1,10] Completer<br />
S à NP VP. [0,10] Completer<br />
The chart:<br />
[Success !]<br />
SàNP VP.<br />
VPàV NP.<br />
NPàDet Nom.<br />
NomàNom PP.<br />
NomàNom PP.<br />
NomàNom PP.<br />
PPàP NP. PPàP NP. PPàP PrN.<br />
NPàPron. NomàN. NPàPrN. NPàNrP. NPàNrP.<br />
Pronàit. Vàis. Detàa. Nàflight Pàfrom. PrNàBeijing. Pàto. PrNàSeoul.Pàon. PrNàASI<br />
<br />
<br />
<br />
<br />
0 1 2 3 4 5 6 7 8 9 10<br />
Fig. 15<br />
In this parsing process, there is not backtracking as in the top-down parsing. The advantage of<br />
Early algorithm is obvious.