Personal tools
You are here: Home Personen Dr.-Ing. Michael Piotrowski, M.A. Exercises NLS II PCFG (1)
Document Actions

PCFG (1)

Up one level

Make yourself acquainted with the Haskell code and the examples from the file named Haskell: Code for PCFG with inside algorithm from the lecture Website.

Then use function readOutBeta' to determine the probability of the following sequences of terms with PCFG pcfg1 :

  [Saw, Saw, Saw] 
  [Astronomers, With, Ears] 
  [Astronomers, Stars, With, Ears] 
  [Astronomers, With, Stars, With, Ears]
  [With, Astronomers, With, Stars, With, Ears] 
  [Saw, Astronomers, With, Stars, With, Ears]

Do all examples have (at least) one successful parse? (Hint: allow for start symbols other than S)

Can you reconstruct the parse trees from the output of readOutBeta'?

Which of the examples are ambiguous? Reconstruct and draw the different parse trees.



Powered by Plone, the Open Source Content Management System