nltk 3.2__zip → 3.3__zip

{nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt.doctest

@@ -1,68 +1,68 @@
-.. Copyright (C) 2001-2015 NLTK Project
-.. For license information, see LICENSE.TXT
-
-.. see also: gluesemantics.doctest
-
-==============================================================================
- Glue Semantics
-==============================================================================
-
-    >>> from nltk.sem.glue import *
-    >>> nltk.sem.logic._counter._value = 0
-
---------------------------------
-Initialize the Dependency Parser
---------------------------------
-    >>> from nltk.parse.malt import MaltParser
-
-    >>> tagger = RegexpTagger(
-    ...     [('^(John|Mary)$', 'NNP'),
-    ...      ('^(sees|chases)$', 'VB'),
-    ...      ('^(a)$', 'ex_quant'),
-    ...      ('^(every)$', 'univ_quant'),
-    ...      ('^(girl|dog)$', 'NN')
-    ... ])
-    >>> depparser = MaltParser(tagger=tagger)
-
---------------------
-Automated Derivation
---------------------
-    >>> glue = Glue(depparser=depparser)
-    >>> readings = glue.parse_to_meaning('every girl chases a dog'.split())
-    >>> for reading in sorted([r.simplify().normalize() for r in readings], key=str):
-    ...     print(reading.normalize())
-    all z1.(girl(z1) -> exists z2.(dog(z2) & chases(z1,z2)))
-    exists z1.(dog(z1) & all z2.(girl(z2) -> chases(z2,z1)))
-
-    >>> drtglue = DrtGlue(depparser=depparser)
-    >>> readings = drtglue.parse_to_meaning('every girl chases a dog'.split())
-    >>> for reading in sorted([r.simplify().normalize() for r in readings], key=str):
-    ...     print(reading)
-    ([],[(([z1],[girl(z1)]) -> ([z2],[dog(z2), chases(z1,z2)]))])
-    ([z1],[dog(z1), (([z2],[girl(z2)]) -> ([],[chases(z2,z1)]))])
-
---------------
-With inference
---------------
-
-Checking for equality of two DRSs is very useful when generating readings of a sentence.
-For example, the ``glue`` module generates two readings for the sentence
-*John sees Mary*:
-
-    >>> from nltk.sem.glue import DrtGlue
-    >>> readings = drtglue.parse_to_meaning('John sees Mary'.split())
-    >>> for drs in sorted([r.simplify().normalize() for r in readings], key=str):
-    ...     print(drs)
-    ([z1,z2],[John(z1), Mary(z2), sees(z1,z2)])
-    ([z1,z2],[Mary(z1), John(z2), sees(z2,z1)])
-
-However, it is easy to tell that these two readings are logically the
-same, and therefore one of them is superfluous.  We can use the theorem prover
-to determine this equivalence, and then delete one of them.  A particular
-theorem prover may be specified, or the argument may be left off to use the
-default.
-
-    >>> readings[0].equiv(readings[1])
-    True
-
-
+.. Copyright (C) 2001-2018 NLTK Project
+.. For license information, see LICENSE.TXT
+
+.. see also: gluesemantics.doctest
+
+==============================================================================
+ Glue Semantics
+==============================================================================
+
+    >>> from nltk.sem.glue import *
+    >>> nltk.sem.logic._counter._value = 0
+
+--------------------------------
+Initialize the Dependency Parser
+--------------------------------
+    >>> from nltk.parse.malt import MaltParser
+
+    >>> tagger = RegexpTagger(
+    ...     [('^(John|Mary)$', 'NNP'),
+    ...      ('^(sees|chases)$', 'VB'),
+    ...      ('^(a)$', 'ex_quant'),
+    ...      ('^(every)$', 'univ_quant'),
+    ...      ('^(girl|dog)$', 'NN')
+    ... ])
+    >>> depparser = MaltParser(tagger=tagger)
+
+--------------------
+Automated Derivation
+--------------------
+    >>> glue = Glue(depparser=depparser)
+    >>> readings = glue.parse_to_meaning('every girl chases a dog'.split())
+    >>> for reading in sorted([r.simplify().normalize() for r in readings], key=str):
+    ...     print(reading.normalize())
+    all z1.(girl(z1) -> exists z2.(dog(z2) & chases(z1,z2)))
+    exists z1.(dog(z1) & all z2.(girl(z2) -> chases(z2,z1)))
+
+    >>> drtglue = DrtGlue(depparser=depparser)
+    >>> readings = drtglue.parse_to_meaning('every girl chases a dog'.split())
+    >>> for reading in sorted([r.simplify().normalize() for r in readings], key=str):
+    ...     print(reading)
+    ([],[(([z1],[girl(z1)]) -> ([z2],[dog(z2), chases(z1,z2)]))])
+    ([z1],[dog(z1), (([z2],[girl(z2)]) -> ([],[chases(z2,z1)]))])
+
+--------------
+With inference
+--------------
+
+Checking for equality of two DRSs is very useful when generating readings of a sentence.
+For example, the ``glue`` module generates two readings for the sentence
+*John sees Mary*:
+
+    >>> from nltk.sem.glue import DrtGlue
+    >>> readings = drtglue.parse_to_meaning('John sees Mary'.split())
+    >>> for drs in sorted([r.simplify().normalize() for r in readings], key=str):
+    ...     print(drs)
+    ([z1,z2],[John(z1), Mary(z2), sees(z1,z2)])
+    ([z1,z2],[Mary(z1), John(z2), sees(z2,z1)])
+
+However, it is easy to tell that these two readings are logically the
+same, and therefore one of them is superfluous.  We can use the theorem prover
+to determine this equivalence, and then delete one of them.  A particular
+theorem prover may be specified, or the argument may be left off to use the
+default.
+
+    >>> readings[0].equiv(readings[1])
+    True
+
+

{nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt_fixt.py

@@ -1,11 +1,12 @@
-# -*- coding: utf-8 -*-
-from __future__ import absolute_import
-
-def setup_module(module):
-    from nose import SkipTest
-    from nltk.parse.malt import MaltParser
-
-    try:
-        depparser = MaltParser('maltparser-1.7.2')
-    except LookupError:
-        raise SkipTest("MaltParser is not available")
+# -*- coding: utf-8 -*-
+from __future__ import absolute_import
+
+
+def setup_module(module):
+    from nose import SkipTest
+    from nltk.parse.malt import MaltParser
+
+    try:
+        depparser = MaltParser('maltparser-1.7.2')
+    except LookupError:
+        raise SkipTest("MaltParser is not available")

{nltk-3.2 → nltk-3.3}/nltk/test/grammar.doctest

@@ -1,48 +1,48 @@
-.. Copyright (C) 2001-2015 NLTK Project
-.. For license information, see LICENSE.TXT
-
-===============
-Grammar Parsing
-===============
-
-Grammars can be parsed from strings:
-
-    >>> from nltk import CFG
-    >>> grammar = CFG.fromstring("""
-    ... S -> NP VP
-    ... PP -> P NP
-    ... NP -> Det N | NP PP
-    ... VP -> V NP | VP PP
-    ... Det -> 'a' | 'the'
-    ... N -> 'dog' | 'cat'
-    ... V -> 'chased' | 'sat'
-    ... P -> 'on' | 'in'
-    ... """)
-    >>> grammar
-    <Grammar with 14 productions>
-    >>> grammar.start()
-    S
-    >>> grammar.productions() # doctest: +NORMALIZE_WHITESPACE
-    [S -> NP VP, PP -> P NP, NP -> Det N, NP -> NP PP, VP -> V NP, VP -> VP PP,
-    Det -> 'a', Det -> 'the', N -> 'dog', N -> 'cat', V -> 'chased', V -> 'sat',
-    P -> 'on', P -> 'in']
-
-Probabilistic CFGs:
-   
-    >>> from nltk import PCFG
-    >>> toy_pcfg1 = PCFG.fromstring("""
-    ... S -> NP VP [1.0]
-    ... NP -> Det N [0.5] | NP PP [0.25] | 'John' [0.1] | 'I' [0.15]
-    ... Det -> 'the' [0.8] | 'my' [0.2]
-    ... N -> 'man' [0.5] | 'telescope' [0.5]
-    ... VP -> VP PP [0.1] | V NP [0.7] | V [0.2]
-    ... V -> 'ate' [0.35] | 'saw' [0.65]
-    ... PP -> P NP [1.0]
-    ... P -> 'with' [0.61] | 'under' [0.39]
-    ... """)
-
-Chomsky Normal Form grammar (Test for bug 474)
-
-    >>> g = CFG.fromstring("VP^<TOP> -> VBP NP^<VP-TOP>")
-    >>> g.productions()[0].lhs()
-    VP^<TOP>
+.. Copyright (C) 2001-2018 NLTK Project
+.. For license information, see LICENSE.TXT
+
+===============
+Grammar Parsing
+===============
+
+Grammars can be parsed from strings:
+
+    >>> from nltk import CFG
+    >>> grammar = CFG.fromstring("""
+    ... S -> NP VP
+    ... PP -> P NP
+    ... NP -> Det N | NP PP
+    ... VP -> V NP | VP PP
+    ... Det -> 'a' | 'the'
+    ... N -> 'dog' | 'cat'
+    ... V -> 'chased' | 'sat'
+    ... P -> 'on' | 'in'
+    ... """)
+    >>> grammar
+    <Grammar with 14 productions>
+    >>> grammar.start()
+    S
+    >>> grammar.productions() # doctest: +NORMALIZE_WHITESPACE
+    [S -> NP VP, PP -> P NP, NP -> Det N, NP -> NP PP, VP -> V NP, VP -> VP PP,
+    Det -> 'a', Det -> 'the', N -> 'dog', N -> 'cat', V -> 'chased', V -> 'sat',
+    P -> 'on', P -> 'in']
+
+Probabilistic CFGs:
+   
+    >>> from nltk import PCFG
+    >>> toy_pcfg1 = PCFG.fromstring("""
+    ... S -> NP VP [1.0]
+    ... NP -> Det N [0.5] | NP PP [0.25] | 'John' [0.1] | 'I' [0.15]
+    ... Det -> 'the' [0.8] | 'my' [0.2]
+    ... N -> 'man' [0.5] | 'telescope' [0.5]
+    ... VP -> VP PP [0.1] | V NP [0.7] | V [0.2]
+    ... V -> 'ate' [0.35] | 'saw' [0.65]
+    ... PP -> P NP [1.0]
+    ... P -> 'with' [0.61] | 'under' [0.39]
+    ... """)
+
+Chomsky Normal Form grammar (Test for bug 474)
+
+    >>> g = CFG.fromstring("VP^<TOP> -> VBP NP^<VP-TOP>")
+    >>> g.productions()[0].lhs()
+    VP^<TOP>

{nltk-3.2 → nltk-3.3}/nltk/test/grammartestsuites.doctest

@@ -1,109 +1,109 @@
-.. Copyright (C) 2001-2015 NLTK Project
-.. For license information, see LICENSE.TXT
-
-==========================
- Test Suites for Grammars
-==========================
-
-Sentences in the test suite are divided into two classes:
-
-- grammatical (*accept*) and
-- ungrammatical (*reject*).
-
-If a sentence should parse accordng to the grammar, the value of
-``trees`` will be a non-empty list. If a sentence should be rejected
-according to the grammar, then the value of ``trees`` will be ``None``.
-
-    >>> from nltk.parse import TestGrammar
-    >>> germantest1 = {}
-    >>> germantest1['doc'] = "Tests for person agreement"
-    >>> germantest1['accept'] = [
-    ... 'ich komme',
-    ... 'ich sehe mich',
-    ... 'du kommst',
-    ... 'du siehst mich',
-    ... 'sie kommt',
-    ... 'sie sieht mich',
-    ... 'ihr kommt',
-    ... 'wir kommen',
-    ... 'sie kommen',
-    ... 'du magst mich',
-    ... 'er mag mich',
-    ... 'du folgst mir',
-    ... 'sie hilft mir',
-    ... ]
-    >>> germantest1['reject'] = [
-    ... 'ich kommt',
-    ... 'ich kommst',
-    ... 'ich siehst mich',
-    ... 'du komme',
-    ... 'du sehe mich',
-    ... 'du kommt',
-    ... 'er komme',
-    ... 'er siehst mich',
-    ... 'wir komme',
-    ... 'wir kommst',
-    ... 'die Katzen kommst',
-    ... 'sie komme',
-    ... 'sie kommst',
-    ... 'du mag mich',
-    ... 'er magst mich',
-    ... 'du folgt mir',
-    ... 'sie hilfst mir',
-    ... ]
-    >>> germantest2 = {}
-    >>> germantest2['doc'] = "Tests for number agreement"
-    >>> germantest2['accept'] = [
-    ... 'der Hund kommt',
-    ... 'die Hunde kommen',
-    ... 'ich komme',
-    ... 'wir kommen',
-    ... 'ich sehe die Katzen',
-    ... 'ich folge den Katzen',
-    ... 'ich sehe die Katzen',
-    ... 'ich folge den Katzen',
-    ... 'wir sehen die Katzen',
-    ... 'wir folgen den Katzen'
-    ... ]
-    >>> germantest2['reject'] = [
-    ... 'ich kommen',
-    ... 'wir komme',
-    ... 'der Hunde kommt',
-    ... 'der Hunde kommen',
-    ... 'die Katzen kommt',
-    ... 'ich sehe der Hunde', 
-    ... 'ich folge den Hund',
-    ... 'ich sehen der Hunde', 
-    ... 'ich folgen den Hund',
-    ... 'wir sehe die Katzen',
-    ... 'wir folge den Katzen'
-    ... ]
-    >>> germantest3 = {}
-    >>> germantest3['doc'] = "Tests for case government and subcategorization"
-    >>> germantest3['accept'] = [
-    ... 'der Hund sieht mich', 
-    ... 'der Hund kommt',
-    ... 'ich sehe den Hund',
-    ... 'ich helfe dem Hund',
-    ... ]
-    >>> germantest3['reject'] = [
-    ... 'ich sehe',
-    ... 'ich helfe',
-    ... 'ich komme den Hund',
-    ... 'ich sehe den Hund die Katzen',
-    ... 'du hilfst mich',
-    ... 'du siehst mir',
-    ... 'du siehst ich',
-    ... 'der Hunde kommt mich',
-    ... 'die Hunde sehe die Hunde', 
-    ... 'der Hund sehe die Hunde', 
-    ... 'ich hilft den Hund',
-    ... 'ich hilft der Hund',
-    ... 'ich sehe dem Hund',
-    ... ]
-    >>> germantestsuites = [germantest1, germantest2, germantest3]
-    >>> tester = TestGrammar('grammars/book_grammars/german.fcfg', germantestsuites)
-    >>> tester.run()
-    Tests for person agreement: All tests passed!
-    Tests for number agreement: All tests passed!
-    Tests for case government and subcategorization: All tests passed!
+.. Copyright (C) 2001-2018 NLTK Project
+.. For license information, see LICENSE.TXT
+
+==========================
+ Test Suites for Grammars
+==========================
+
+Sentences in the test suite are divided into two classes:
+
+- grammatical (*accept*) and
+- ungrammatical (*reject*).
+
+If a sentence should parse accordng to the grammar, the value of
+``trees`` will be a non-empty list. If a sentence should be rejected
+according to the grammar, then the value of ``trees`` will be ``None``.
+
+    >>> from nltk.parse import TestGrammar
+    >>> germantest1 = {}
+    >>> germantest1['doc'] = "Tests for person agreement"
+    >>> germantest1['accept'] = [
+    ... 'ich komme',
+    ... 'ich sehe mich',
+    ... 'du kommst',
+    ... 'du siehst mich',
+    ... 'sie kommt',
+    ... 'sie sieht mich',
+    ... 'ihr kommt',
+    ... 'wir kommen',
+    ... 'sie kommen',
+    ... 'du magst mich',
+    ... 'er mag mich',
+    ... 'du folgst mir',
+    ... 'sie hilft mir',
+    ... ]
+    >>> germantest1['reject'] = [
+    ... 'ich kommt',
+    ... 'ich kommst',
+    ... 'ich siehst mich',
+    ... 'du komme',
+    ... 'du sehe mich',
+    ... 'du kommt',
+    ... 'er komme',
+    ... 'er siehst mich',
+    ... 'wir komme',
+    ... 'wir kommst',
+    ... 'die Katzen kommst',
+    ... 'sie komme',
+    ... 'sie kommst',
+    ... 'du mag mich',
+    ... 'er magst mich',
+    ... 'du folgt mir',
+    ... 'sie hilfst mir',
+    ... ]
+    >>> germantest2 = {}
+    >>> germantest2['doc'] = "Tests for number agreement"
+    >>> germantest2['accept'] = [
+    ... 'der Hund kommt',
+    ... 'die Hunde kommen',
+    ... 'ich komme',
+    ... 'wir kommen',
+    ... 'ich sehe die Katzen',
+    ... 'ich folge den Katzen',
+    ... 'ich sehe die Katzen',
+    ... 'ich folge den Katzen',
+    ... 'wir sehen die Katzen',
+    ... 'wir folgen den Katzen'
+    ... ]
+    >>> germantest2['reject'] = [
+    ... 'ich kommen',
+    ... 'wir komme',
+    ... 'der Hunde kommt',
+    ... 'der Hunde kommen',
+    ... 'die Katzen kommt',
+    ... 'ich sehe der Hunde', 
+    ... 'ich folge den Hund',
+    ... 'ich sehen der Hunde', 
+    ... 'ich folgen den Hund',
+    ... 'wir sehe die Katzen',
+    ... 'wir folge den Katzen'
+    ... ]
+    >>> germantest3 = {}
+    >>> germantest3['doc'] = "Tests for case government and subcategorization"
+    >>> germantest3['accept'] = [
+    ... 'der Hund sieht mich', 
+    ... 'der Hund kommt',
+    ... 'ich sehe den Hund',
+    ... 'ich helfe dem Hund',
+    ... ]
+    >>> germantest3['reject'] = [
+    ... 'ich sehe',
+    ... 'ich helfe',
+    ... 'ich komme den Hund',
+    ... 'ich sehe den Hund die Katzen',
+    ... 'du hilfst mich',
+    ... 'du siehst mir',
+    ... 'du siehst ich',
+    ... 'der Hunde kommt mich',
+    ... 'die Hunde sehe die Hunde', 
+    ... 'der Hund sehe die Hunde', 
+    ... 'ich hilft den Hund',
+    ... 'ich hilft der Hund',
+    ... 'ich sehe dem Hund',
+    ... ]
+    >>> germantestsuites = [germantest1, germantest2, germantest3]
+    >>> tester = TestGrammar('grammars/book_grammars/german.fcfg', germantestsuites)
+    >>> tester.run()
+    Tests for person agreement: All tests passed!
+    Tests for number agreement: All tests passed!
+    Tests for case government and subcategorization: All tests passed!