[PATCH 1/2] cosmetics: many typofixes, suggested by "codespell.py"

Stefano Lattarini

unread,

Feb 11, 2012, 8:17:47 AM2/11/12

to nltk...@googlegroups.com, Stefano Lattarini

diff --git a/nltk/app/chartparser_app.py b/nltk/app/chartparser_app.py
index 3ec3638..6dfcf66 100644
--- a/nltk/app/chartparser_app.py
+++ b/nltk/app/chartparser_app.py
@@ -1247,7 +1247,7 @@ class ChartView(object):
"""
Color in an edge with the given colors.
If no colors are specified, use intelligent defaults
- (dependant on selection, etc.)
+ (dependent on selection, etc.)
"""
if edge not in self._edgetags: return
c = self._chart_canvas
diff --git a/nltk/app/wordnet_app.py b/nltk/app/wordnet_app.py
index 2db8c18..99e9b68 100644
--- a/nltk/app/wordnet_app.py
+++ b/nltk/app/wordnet_app.py
@@ -263,7 +263,7 @@ def wnb(port=8000, runBrowser=True, logfilename=None):
# may have to shutdown both programs.
#
# Since webbrowser may block, and the webserver will block, we must run
- # them in seperate threads.
+ # them in separate threads.
#
global server_mode, logfile
server_mode = not runBrowser
@@ -608,7 +608,7 @@ def _collect_one_synset(word, synset, synset_relations):
def _collect_all_synsets(word, pos, synset_relations=dict()):
"""
Return a HTML unordered list of synsets for the given word and
- part of speach.
+ part of speech.
"""
return '<ul>%s\n</ul>\n' % \
''.join((_collect_one_synset(word, synset, synset_relations)
@@ -677,7 +677,7 @@ class Reference(object):
"""
Build a reference to a new page.

- word is the word or words (seperated by commas) for which to
+ word is the word or words (separated by commas) for which to
search for synsets of

synset_relations is a dictionary of synset keys to sets of
diff --git a/nltk/chat/rude.py b/nltk/chat/rude.py
index 76d022e..866a9f1 100644
--- a/nltk/chat/rude.py
+++ b/nltk/chat/rude.py
@@ -47,7 +47,7 @@ pairs = (
"I'm not even going to dignify that with an answer.")),

(r'What (.*)',
- ("Do I look like an encylopedia?",
+ ("Do I look like an encyclopedia?",
"Figure it out yourself.")),

(r'Why (.*)',
diff --git a/nltk/chat/zen.py b/nltk/chat/zen.py
index 77ccddc..cd6f918 100644
--- a/nltk/chat/zen.py
+++ b/nltk/chat/zen.py
@@ -168,13 +168,13 @@ responses = (
# desire to do an action
# e.g. "I want to go shopping"
(r'i want to (.*)',
- ( "You may %1 if your heart truely desires to.",
+ ( "You may %1 if your heart truly desires to.",
"You may have to %1.")),

# desire for an object
# e.g. "I want a pony"
(r'i want (.*)',
- ( "Does your heart truely desire %1?",
+ ( "Does your heart truly desire %1?",
"Is this a desire of the heart, or of the mind?")),

# e.g. "I can't wait" or "I can't do this"
diff --git a/nltk/chunk/api.py b/nltk/chunk/api.py
index 7046469..f31ae0c 100644
--- a/nltk/chunk/api.py
+++ b/nltk/chunk/api.py
@@ -18,7 +18,7 @@ class ChunkParserI(ParserI):
"""
A processing interface for identifying non-overlapping groups in
unrestricted text. Typically, chunk parsers are used to find base
- syntactic constituants, such as base noun phrases. Unlike
+ syntactic constituents, such as base noun phrases. Unlike
``ParserI``, ``ChunkParserI`` guarantees that the ``parse()`` method
will always generate a parse.
"""
diff --git a/nltk/chunk/util.py b/nltk/chunk/util.py
index d41e06b..6b240e4 100644
--- a/nltk/chunk/util.py
+++ b/nltk/chunk/util.py
@@ -53,7 +53,7 @@ class ChunkScore(object):
evaluate a chunk parser's output, based on a number of statistics
(precision, recall, f-measure, misssed chunks, incorrect chunks).
It can also combine the scores from the parsing of multiple texts;
- this makes it signifigantly easier to evaluate a chunk parser that
+ this makes it significantly easier to evaluate a chunk parser that
operates one sentence at a time.

Texts are evaluated with the ``score`` method. The results of
diff --git a/nltk/classify/__init__.py b/nltk/classify/__init__.py
index 92d88e5..446380d 100644
--- a/nltk/classify/__init__.py
+++ b/nltk/classify/__init__.py
@@ -24,7 +24,7 @@ token, classifiers examine one or more 'features' of the token. These
"features" are typically chosen by hand, and indicate which aspects
of the token are relevant to the classification decision. For
example, a document classifier might use a separate feature for each
-word, recording how often that word occured in the document.
+word, recording how often that word occurred in the document.

Featuresets
===========
diff --git a/nltk/classify/maxent.py b/nltk/classify/maxent.py
index 47b0c62..e6dbc30 100644
--- a/nltk/classify/maxent.py
+++ b/nltk/classify/maxent.py
@@ -9,9 +9,9 @@
"""
A classifier model based on maximum entropy modeling framework. This
framework considers all of the probability distributions that are
-empirically consistant with the training data; and chooses the
+empirically consistent with the training data; and chooses the
distribution with the highest entropy. A probability distribution is
-"empirically consistant" with a set of training data if its estimated
+"empirically consistent" with a set of training data if its estimated
frequency with which a class and a feature vector value co-occur is
equal to the actual frequency in the data.

@@ -20,7 +20,7 @@ Terminology: 'feature'
The term *feature* is usually used to refer to some property of an
unlabeled token. For example, when performing word sense
disambiguation, we might define a ``'prevword'`` feature whose value is
-the word preceeding the target word. However, in the context of
+the word preceding the target word. However, in the context of
maxent modeling, the term *feature* is typically used to refer to a
property of a "labeled" token. In order to prevent confusion, we
will introduce two distinct terms to disambiguate these two different
@@ -1265,7 +1265,7 @@ def calculate_deltas(train_toks, classifier, unattested, ffreq_empirical,
The variables ``nfmap``, ``nfarray``, and ``nftranspose`` are
used to generate a dense encoding for *nf(ltext)*. This
allows ``_deltas`` to calculate *sum1* and *sum2* using
- matrices, which yields a signifigant performance improvement.
+ matrices, which yields a significant performance improvement.

:param train_toks: The set of training tokens.
:type train_toks: list(tuple(dict, str))
diff --git a/nltk/classify/naivebayes.py b/nltk/classify/naivebayes.py
index 12e6af0..87e23e0 100644
--- a/nltk/classify/naivebayes.py
+++ b/nltk/classify/naivebayes.py
@@ -188,7 +188,7 @@ class NaiveBayesClassifier(ClassifierI):
feature_values = defaultdict(set)
fnames = set()

- # Count up how many times each feature value occured, given
+ # Count up how many times each feature value occurred, given
# the label and featurename.
for featureset, label in labeled_featuresets:
label_freqdist.inc(label)
diff --git a/nltk/classify/weka.py b/nltk/classify/weka.py
index 3811136..575b0fc 100644
--- a/nltk/classify/weka.py
+++ b/nltk/classify/weka.py
@@ -107,7 +107,7 @@ class WekaClassifier(ClassifierI):
# Check if something went wrong:
if stderr and not stdout:
if 'Illegal options: -distribution' in stderr:
- raise ValueError('The installed verison of weka does '
+ raise ValueError('The installed version of weka does '
'not support probability distribution '
'output.')
else:
diff --git a/nltk/cluster/kmeans.py b/nltk/cluster/kmeans.py
index 5ca505a..efe9cef 100644
--- a/nltk/cluster/kmeans.py
+++ b/nltk/cluster/kmeans.py
@@ -19,7 +19,7 @@ class KMeansClusterer(VectorSpaceClusterer):
process repeats until the cluster memberships stabilise. This is a
hill-climbing algorithm which may converge to a local maximum. Hence the
clustering is often repeated with random initial means and the most
- commonly occuring output means are chosen.
+ commonly occurring output means are chosen.
"""

def __init__(self, num_means, distance, repeats=1,
diff --git a/nltk/corpus/reader/util.py b/nltk/corpus/reader/util.py
index e252199..b5797bc 100644
--- a/nltk/corpus/reader/util.py
+++ b/nltk/corpus/reader/util.py
@@ -647,7 +647,7 @@ def read_sexpr_block(stream, block_size=16384, comment_char=None):
block will be read.
:param comment_char: A character that marks comments. Any lines
that begin with this character will be stripped out.
- (If spaces or tabs preceed the comment character, then the
+ (If spaces or tabs precede the comment character, then the
line will not be stripped.)
"""
start = stream.tell()
diff --git a/nltk/corpus/reader/wordnet.py b/nltk/corpus/reader/wordnet.py
index c1b3ef9..369245b 100644
--- a/nltk/corpus/reader/wordnet.py
+++ b/nltk/corpus/reader/wordnet.py
@@ -345,7 +345,7 @@ class Synset(_WordNetObject):
return result

# Simpler implementation which makes incorrect assumption that
-# hypernym hierarcy is acyclic:
+# hypernym hierarchy is acyclic:
#
# if not self.hypernyms():
# return [self]
diff --git a/nltk/data.py b/nltk/data.py
index 99ca6f6..008c2e0 100644
--- a/nltk/data.py
+++ b/nltk/data.py
@@ -127,7 +127,7 @@ class PathPointer(object):
Return a new path pointer formed by starting at the path
identified by this pointer, and then following the relative
path given by ``fileid``. The path components of ``fileid``
- should be seperated by forward slashes, regardless of
+ should be separated by forward slashes, regardless of
the underlying file system's path seperator character.
"""
raise NotImplementedError('abstract base class')
@@ -1008,7 +1008,7 @@ class SeekableUnicodeStreamReader(object):
ignoring all buffers.

:param est_bytes: A hint, giving an estimate of the number of
- bytes that will be neded to move foward by ``offset`` chars.
+ bytes that will be neded to move forward by ``offset`` chars.
Defaults to ``offset``.
"""
if est_bytes is None: est_bytes = offset
diff --git a/nltk/downloader.py b/nltk/downloader.py
index 6970ad3..9df5a6b 100644
--- a/nltk/downloader.py
+++ b/nltk/downloader.py
@@ -1809,7 +1809,7 @@ class DownloaderGUI(object):
# download (e.g., clicking 'refresh' or editing the index url).
ds = Downloader(self._ds.url, self._ds.download_dir)

- # Start downloading in a seperate thread.
+ # Start downloading in a separate thread.
assert self._download_msg_queue == []
assert self._download_abort_queue == []
self._DownloadThread(ds, marked, self._download_lock,
diff --git a/nltk/draw/cfg.py b/nltk/draw/cfg.py
index 35b5c95..eba92b1 100644
--- a/nltk/draw/cfg.py
+++ b/nltk/draw/cfg.py
@@ -103,7 +103,7 @@ is a list of nonterminals and terminals.
Nonterminals must be a single word, such as S or NP or NP_subj.
Currently, nonterminals must consists of alphanumeric characters and
underscores (_). Nonterminals are colored blue. If you place the
-mouse over any nonterminal, then all occurances of that nonterminal
+mouse over any nonterminal, then all occurrences of that nonterminal
will be highlighted.

Termianals must be surrounded by single quotes (') or double
@@ -118,7 +118,7 @@ converted to an arrow symbol. When you move your cursor to a
different line, your production will automatically be colorized. If
there are any errors, they will be highlighted in red.

-Note that the order of the productions is signifigant for some
+Note that the order of the productions is significant for some
algorithms. To re-order the productions, use cut and paste to move
them.

diff --git a/nltk/draw/tree.py b/nltk/draw/tree.py
index 8f3a957..905069b 100644
--- a/nltk/draw/tree.py
+++ b/nltk/draw/tree.py
@@ -480,7 +480,7 @@ class TreeWidget(CanvasWidget):
``'vertical'``. The default value is ``'vertical'`` (i.e.,
branch downwards).

- - ``shapeable``: whether the subtrees can be independantly
+ - ``shapeable``: whether the subtrees can be independently
dragged by the user. THIS property simply sets the
``DRAGGABLE`` property on all of the ``TreeWidget``'s tree
segments.
diff --git a/nltk/featstruct.py b/nltk/featstruct.py
index d803fb4..8fe3275 100644
--- a/nltk/featstruct.py
+++ b/nltk/featstruct.py
@@ -1133,7 +1133,7 @@ def rename_variables(fstruct, vars=None, used_vars=(), new_vars=None,
``new_vars``, mapping *v* to the new variable that is used
to replace it.

- To consistantly rename the variables in a set of feature
+ To consistently rename the variables in a set of feature
structures, simply apply rename_variables to each one, using
the same dictionary:

diff --git a/nltk/grammar.py b/nltk/grammar.py
index 3bcd370..7eeb12d 100644
--- a/nltk/grammar.py
+++ b/nltk/grammar.py
@@ -382,7 +382,7 @@ class WeightedProduction(Production, ImmutableProbabilisticMixIn):
has an associated probability, which represents how likely it is that
this production will be used. In particular, the probability of a
``WeightedProduction`` records the likelihood that its right-hand side is
- the correct instantiation for any given occurance of its left-hand side.
+ the correct instantiation for any given occurrence of its left-hand side.

:see: ``Production``
"""
diff --git a/nltk/internals.py b/nltk/internals.py
index 4cc27dc..7eb9ba4 100644
--- a/nltk/internals.py
+++ b/nltk/internals.py
@@ -192,8 +192,8 @@ if 0:
class ParseError(ValueError):
"""
Exception raised by parse_* functions when they fail.
- :param position: The index in the input string where an error occured.
- :param expected: What was expected when an error occured.
+ :param position: The index in the input string where an error occurred.
+ :param expected: What was expected when an error occurred.
"""
def __init__(self, expected, position):
ValueError.__init__(self, expected, position)
diff --git a/nltk/parse/chart.py b/nltk/parse/chart.py
index 364078a..95cb9a9 100644
--- a/nltk/parse/chart.py
+++ b/nltk/parse/chart.py
@@ -79,7 +79,7 @@ class EdgeI(object):

- A ``TreeEdge`` records which trees have been found to
be (partially) consistent with the text.
- - A ``LeafEdge`` records the tokens occuring in the text.
+ - A ``LeafEdge`` records the tokens occurring in the text.

The ``EdgeI`` interface provides a common interface to both types
of edge, allowing chart parsers to treat them in a uniform manner.
@@ -1549,7 +1549,7 @@ class SteppingChartParser(ChartParser):

def set_strategy(self, strategy):
"""
- Change the startegy that the parser uses to decide which edges
+ Change the strategy that the parser uses to decide which edges
to add to the chart.

:type strategy: list(ChartRuleI)
diff --git a/nltk/probability.py b/nltk/probability.py
index e769765..df7a79f 100644
--- a/nltk/probability.py
+++ b/nltk/probability.py
@@ -1140,7 +1140,7 @@ class WittenBellProbDist(ProbDistI):
reserved for unseen events is equal to *T / (N + T)*
where *T* is the number of observed event types and *N* is the total
number of observed events. This equates to the maximum likelihood estimate
- of a new type event occuring. The remaining probability mass is discounted
+ of a new type event occurring. The remaining probability mass is discounted
such that all probability estimates sum to one, yielding:

- *p = T / Z (N + T)*, if count = 0
@@ -1155,7 +1155,7 @@ class WittenBellProbDist(ProbDistI):
probability mass reserved for unseen events is equal to *T / (N + T)*
where *T* is the number of observed event types and *N* is the total
number of observed events. This equates to the maximum likelihood
- estimate of a new type event occuring. The remaining probability mass
+ estimate of a new type event occurring. The remaining probability mass
is discounted such that all probability estimates sum to one,
yielding:

diff --git a/nltk/sem/chat80.py b/nltk/sem/chat80.py
index 1ddaccb..3fe6d8b 100644
--- a/nltk/sem/chat80.py
+++ b/nltk/sem/chat80.py
@@ -400,7 +400,7 @@ def cities2table(filename, rel_name, dbname, verbose=False, setup=False):
print "inserting values into %s: " % table_name, t
connection.commit()
if verbose:
- print "Commiting update to %s" % dbname
+ print "Committing update to %s" % dbname
cur.close()
except ImportError:
import warnings
diff --git a/nltk/sourcedstring.py b/nltk/sourcedstring.py
index dbb8d87..fc66b99 100644
--- a/nltk/sourcedstring.py
+++ b/nltk/sourcedstring.py
@@ -566,7 +566,7 @@ class SourcedString(object):
# Check for unicode/bytestring mismatches:
if self._mixed_string_types(old, new, count):
return self._decode_and_call('replace', old, new, count)
- # Use a regexp to find all occurences of old, and replace them w/ new.
+ # Use a regexp to find all occurrences of old, and replace them w/ new.
result = ''
pos = 0
for match in re.finditer(re.escape(old), self):
@@ -929,7 +929,7 @@ class SimpleSourcedString(SourcedString):

self.source = source
"""A ``StringLocation`` specifying the location where this string
- occured in the source document."""
+ occurred in the source document."""

@property
def begin(self):
diff --git a/nltk/stem/porter.py b/nltk/stem/porter.py
index b453d3d..e5a692a 100644
--- a/nltk/stem/porter.py
+++ b/nltk/stem/porter.py
@@ -48,7 +48,7 @@ presented in

Porter, M. "An algorithm for suffix stripping." Program 14.3 (1980): 130-137.

-only differing from it at the points maked --DEPARTURE-- and --NEW--
+only differing from it at the points marked --DEPARTURE-- and --NEW--
below.

For a more faithful version of the Porter algorithm, see
@@ -62,7 +62,7 @@ Later additions:
The 'l' of the 'logi' -> 'log' rule is put with the stem, so that
short stems like 'geo' 'theo' etc work like 'archaeo' 'philo' etc.

- This follows a suggestion of Barry Wilkins, reasearch student at
+ This follows a suggestion of Barry Wilkins, research student at
Birmingham.

diff --git a/nltk/stem/rslp.py b/nltk/stem/rslp.py
index b6d3927..bf5029b 100644
--- a/nltk/stem/rslp.py
+++ b/nltk/stem/rslp.py
@@ -13,7 +13,7 @@
# Python version, with some minor modifications of mine, to the description
# presented at http://www.webcitation.org/5NnvdIzOb and to the C source code
# available at http://www.inf.ufrgs.br/~arcoelho/rslp/integrando_rslp.html.
-# Please note that this stemmer is intended for demostration and educational
+# Please note that this stemmer is intended for demonstration and educational
# purposes only. Feel free to write me for any comments, including the
# development of a different and/or better stemmer for Portuguese. I also
# suggest using NLTK's mailing list for Portuguese for any discussion.
diff --git a/nltk/tag/hmm.py b/nltk/tag/hmm.py
index 2a19387..17ab7ec 100644
--- a/nltk/tag/hmm.py
+++ b/nltk/tag/hmm.py
@@ -1016,7 +1016,7 @@ class HiddenMarkovModelTrainer(object):
if estimator is None:
estimator = lambda fdist, bins: MLEProbDist(fdist)

- # count occurences of starting states, transitions out of each state
+ # count occurrences of starting states, transitions out of each state
# and output symbols observed in each state
starting = FreqDist()
transitions = ConditionalFreqDist()
diff --git a/nltk/tag/sequential.py b/nltk/tag/sequential.py
index 67f6eb9..e7ee1de 100644
--- a/nltk/tag/sequential.py
+++ b/nltk/tag/sequential.py
@@ -241,7 +241,7 @@ class DefaultTagger(SequentialBackoffTagger, yaml.YAMLObject):
class NgramTagger(ContextTagger, yaml.YAMLObject):
"""
A tagger that chooses a token's tag based on its word string and
- on the preceeding n word's tags. In particular, a tuple
+ on the preceding n word's tags. In particular, a tuple
(tags[i-n:i-1], words[i]) is looked up in a table, and the
corresponding tag is returned. N-gram taggers are typically
trained on a tagged corpus.
@@ -323,7 +323,7 @@ class UnigramTagger(NgramTagger):
class BigramTagger(NgramTagger):
"""
A tagger that chooses a token's tag based its word string and on
- the preceeding words' tag. In particular, a tuple consisting
+ the preceding words' tag. In particular, a tuple consisting
of the previous tag and the word is looked up in a table, and
the corresponding tag is returned.

@@ -349,7 +349,7 @@ class BigramTagger(NgramTagger):
class TrigramTagger(NgramTagger):
"""
A tagger that chooses a token's tag based its word string and on
- the preceeding two words' tags. In particular, a tuple consisting
+ the preceding two words' tags. In particular, a tuple consisting
of the previous two tags and the word is looked up in a table, and
the corresponding tag is returned.

diff --git a/nltk/tag/tnt.py b/nltk/tag/tnt.py
index 4697390..cd797ac 100755
--- a/nltk/tag/tnt.py
+++ b/nltk/tag/tnt.py
@@ -202,7 +202,7 @@ class TnT(TaggerI):
# However no effect within this function
for tag in self._tri[history].samples():

- # if there has only been 1 occurance of this tag in the data
+ # if there has only been 1 occurrence of this tag in the data
# then ignore this trigram.
if self._uni[tag] == 1:
continue
diff --git a/nltk/test/__init__.py b/nltk/test/__init__.py
index 2d854ba..83c195a 100644
--- a/nltk/test/__init__.py
+++ b/nltk/test/__init__.py
@@ -8,7 +8,7 @@
# $Id$

"""
-Unit tests for the NLTK modules. These tests are intented to ensure
+Unit tests for the NLTK modules. These tests are intended to ensure
that changes that we make to NLTK's code don't accidentally introduce
bugs.

diff --git a/nltk/text.py b/nltk/text.py
index 6eb3b17..4f19363 100644
--- a/nltk/text.py
+++ b/nltk/text.py
@@ -124,7 +124,7 @@ class ConcordanceIndex(object):

:param tokens: The document (list of tokens) that this
concordance index was created from. This list can be used
- to access the context of a given word occurance.
+ to access the context of a given word occurrence.
:param key: A function that maps each token to a normalized
version that will be used as a key in the index. E.g., if
you use ``key=lambda s:s.lower()``, then the index will be
@@ -273,7 +273,7 @@ class Text(object):

"""
# This defeats lazy loading, but makes things faster. This
- # *shouldnt* be necessary because the corpus view *should* be
+ # *shouldn't* be necessary because the corpus view *should* be
# doing intelligent caching, but without this it's running slow.
# Look into whether the caching is working correctly.
_COPY_TOKENS = True
diff --git a/nltk/tokenize/punkt.py b/nltk/tokenize/punkt.py
index 417ef5d..5d488df 100644
--- a/nltk/tokenize/punkt.py
+++ b/nltk/tokenize/punkt.py
@@ -913,7 +913,7 @@ class PunktTrainer(PunktBaseClass):
# likelihood ratio:
# F_length: long word -> less likely to be an abbrev
# F_periods: more periods -> more likely to be an abbrev
- # F_penalty: penalize occurances w/o a period
+ # F_penalty: penalize occurrences w/o a period
f_length = math.exp(-num_nonperiods)
f_periods = num_periods
f_penalty = (int(self.IGNORE_ABBREV_PENALTY)
@@ -1007,7 +1007,7 @@ class PunktTrainer(PunktBaseClass):
def _col_log_likelihood(count_a, count_b, count_ab, N):
"""
A function that will just compute log-likelihood estimate, in
- the original paper it's decribed in algorithm 6 and 7.
+ the original paper it's described in algorithm 6 and 7.

This *should* be the original Dunning log-likelihood values,
unlike the previous log_l function where it used modified
@@ -1093,7 +1093,7 @@ class PunktTrainer(PunktBaseClass):
Returns True given a token and the token that preceds it if it
seems clear that the token is beginning a sentence.
"""
- # If a token (i) is preceeded by a sentece break that is
+ # If a token (i) is preceded by a sentece break that is
# not a potential ordinal number or initial, and (ii) is
# alphabetic, then it is a a sentence-starter.
return ( prev_tok.sentbreak and
diff --git a/nltk/util.py b/nltk/util.py
index 210e68e..e6bd40a 100644
--- a/nltk/util.py
+++ b/nltk/util.py
@@ -683,7 +683,7 @@ class AbstractLazySequence(object):
return sum(1 for elt in self if elt==value)

def index(self, value, start=None, stop=None):
- """Return the index of the first occurance of ``value`` in this
+ """Return the index of the first occurrence of ``value`` in this
list that is greater than or equal to ``start`` and less than
``stop``. Negative start and stop values are treated like negative
slice bounds -- i.e., they count from the end of the list."""
@@ -1132,7 +1132,7 @@ def set_proxy(proxy, (user, password)=(None, '')):
"""
Set the HTTP proxy for Python to download through.

- If ``proxy`` is None then tries to set proxy from enviroment or system
+ If ``proxy`` is None then tries to set proxy from environment or system
settings.

:param proxy: The HTTP proxy server to use. For example:
diff --git a/tools/googlecode_upload.py b/tools/googlecode_upload.py
index f73c28b..08ae15f 100755
--- a/tools/googlecode_upload.py
+++ b/tools/googlecode_upload.py
@@ -118,7 +118,7 @@ def upload(file, project_name, user_name, password, summary, labels=None):

Returns: a tuple:
http_status: 201 if the upload succeeded, something else if an
- error occured.
+ error occurred.
http_reason: The human-readable string associated with http_status
file_url: If the upload succeeded, the URL of the file on Google
Code, None otherwise.
--
1.7.7.3

Stefano Lattarini

unread,

Feb 11, 2012, 8:17:48 AM2/11/12

to nltk...@googlegroups.com, Stefano Lattarini

---
nltk/chat/rude.py | 2 +-
nltk/text.py | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/nltk/chat/rude.py b/nltk/chat/rude.py
index 866a9f1..ae1b83f 100644
--- a/nltk/chat/rude.py
+++ b/nltk/chat/rude.py
@@ -1,4 +1,4 @@
-# Natural Language Toolkit: Zen Chatbot
+# Natural Language Toolkit: Rude Chatbot
#
# Copyright (C) 2001-2012 NLTK Project
# Author: Peter Spiller <pspi...@csse.unimelb.edu.au>
diff --git a/nltk/text.py b/nltk/text.py
index 4f19363..91198a7 100644
--- a/nltk/text.py
+++ b/nltk/text.py
@@ -506,7 +506,7 @@ class Text(object):
_CONTEXT_RE = re.compile('\w+|[\.\!\?]')
def _context(self, tokens, i):
"""
- One left & one right token, both case-normalied. Skip over
+ One left & one right token, both case-normalized. Skip over
non-sentence-final punctuation. Used by the ``ContextIndex``
that is created for ``similar()`` and ``common_contexts()``.
"""
--
1.7.7.3

Stefano Lattarini

unread,

Feb 11, 2012, 2:36:54 PM2/11/12

to Stefano Lattarini, nltk...@googlegroups.com

I've now set up a pull request for this couple of patches:

<https://github.com/nltk/nltk/pull/219>

Regards,
Stefano

Reply all

Reply to author

Forward