Natural language processing using Python NLTK package, WILL RATEASAP

E-book:http://victoria.lviv.ua/html/fl5/NaturalLanguageProcessingWithPython.pdf

Question:

Complete the following subparts, in the order given:

1. Consider the sequence of words: Buffalo buffalo Buffalo buffalobuffalo buffalo Buffalo buffalo. This is a
grammatically correct sentence, as explained at http://en.wikipedia.org/wiki/
Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo .Consider the tree diagram
presented on this Wikipedia page, and write down a suitablegrammar. Normalize case to lowercase, to
simulate the problem that a listener has when hearing thissentence. Can you find other parses for this
sentence? How does the number of parse trees grow as the sentencegets longer? (More examples of these
sentences can be found at http://en.wikipedia.org/wiki/List_of_homophonous_phrases).

2. You can modify the grammar in the recursive descent parserdemo by selecting Edit Grammar in the Edit
menu. Change the first expansion production, namely NP -> Det NPP, to NP -> NP PP. Using the Step
button, try to build a parse tree. Describe what happens.

Answer rating: 100% (QA)

1 A suitable grammar for the sentence Buffalo buffalo Buffalo buffa... View the full answer