This file was obtained by applying Clone Digger tool to the source code of the NLTK project. The fragments of code, which are cited below, are not necessary clones. Even more so the presense of this code in the project does not lead to defects in it. Unfortuently different source files of NLTK package have different copyrights (although they are all covered by the GPL license). By technical reason it was difficult for me to quote all the copyrights here. I cited only the common part of copyrights (and missed information about concrete authors). Clone Digger is free and I hope that it will help people to produce better software. I respect the work of NLTK authors and hope that they will have nothing against publishing this file. The code below falls under the following license: # Copyright (C) 2001-2008 University of Pennsylvania # Author: ? # URL: http://nltk.sf.net # For license information, see http://clonedigger.sourceforge.net/examples/NLTK_LICENSE.txt
Source files:
/home/peter/clone_digger/nltk-0.9.2/nltk/evaluate.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/containers.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/yamltags.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/probability.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/olac.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/data.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cfg.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/treetransforms.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/internals.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/utilities.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/detect.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/compat.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/sem/evaluate.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/sem/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/sem/relextract.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/sem/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/etree/ElementInclude.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/etree/ElementTree.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/etree/ElementPath.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/etree/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/dispersion.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/model/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/misc/nemo.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/misc/sort.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/misc/chomsky.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/misc/wordfinder.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/misc/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/chat80.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/xmldocs.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ppattach.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/bracket_parse.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ieer.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/wordlist.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/propbank.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/string_category.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/toolbox.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/rte.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/chunked.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/indian.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/conll.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/sinica_treebank.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/verbnet.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/timit.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/gutenberg.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/cmudict.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/mace.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/discourse.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/inference.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/prover9.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/inference/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/suntsu.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/eliza.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/zen.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/rude.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chat/iesha.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/browse.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/frequency.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/synset.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/morphy.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/lexname.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/cache.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/brown_ic.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/similarity.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/dictionary.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/lancaster.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/porter.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/wordnet.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/rslp.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/stem/regexp.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/sr.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/viterbi.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/featurechart.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/generate.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/pchart.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/rd.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/brill.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/sequential.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tag/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/simple.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/punkt.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/sexpr.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/tokenize/regexp.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/decisiontree.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/weka.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/maxent.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/naivebayes.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/classify/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/test/doctest_driver.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/test/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/gaac.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/kmeans.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/em.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/cluster/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/api.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/util.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/__init__.py,
/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py
Clones detected: 356
Parameters
clustering_threshold = 10
distance_threshold = 5
length_threshold = 30
hashing_depth = 1
clusterize_using_hash = False
Clone # 1
Anti-unification distance between two trees = 4
Total size of two trees = 402
Total length of sequences = 42
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 305 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 274 | |
| menubar.add_cascade(label='Apply', underline=0, menu=rulemenu) | menubar.add_cascade(label='Apply', underline=0, menu=rulemenu) | |
| viewmenu = Menu(menubar, tearoff=0) | viewmenu = Menu(menubar, tearoff=0) | |
|
viewmenu.add_checkbutton(label="Show Grammar", underline=0, variable=self._show_grammar, command=self._toggle_grammar) |
viewmenu.add_checkbutton(label="Show Grammar", underline=0, variable=self._show_grammar, command=self._toggle_grammar) |
|
| viewmenu.add_separator() | viewmenu.add_separator() | |
|
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='View', underline=0, menu=viewmenu) | menubar.add_cascade(label='View', underline=0, menu=viewmenu) | |
| animatemenu = Menu(menubar, tearoff=0) | animatemenu = Menu(menubar, tearoff=0) | |
|
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animation_frames, value=0) |
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animate, value=0) |
|
|
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animation_frames, value=10, accelerator='-') |
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animate, value=20, accelerator='-') |
|
|
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animation_frames, value=5, accelerator='=') |
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animate, value=10, accelerator='=') |
|
|
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animation_frames, value=2, accelerator='+') |
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animate, value=4, accelerator='+') |
|
| menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) | menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) | |
| helpmenu = Menu(menubar, tearoff=0) | helpmenu = Menu(menubar, tearoff=0) | |
|
helpmenu.add_command(label='About', underline=0, command=self.about) |
helpmenu.add_command(label='About', underline=0, command=self.about) |
|
|
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
|
| menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | |
| parent.config(menu=menubar) | parent.config(menu=menubar) |
Clone # 2
Anti-unification distance between two trees = 3
Total size of two trees = 234
Total length of sequences = 28
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 274 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 243 | |
| menubar = Menu(parent) | menubar = Menu(parent) | |
| filemenu = Menu(menubar, tearoff=0) | filemenu = Menu(menubar, tearoff=0) | |
|
filemenu.add_command(label='Reset Parser', underline=0, command=self.reset, accelerator='Del') |
filemenu.add_command(label='Reset Parser', underline=0, command=self.reset, accelerator='Del') |
|
|
filemenu.add_command(label='Print to Postscript', underline=0, command=self.postscript, accelerator='Ctrl-p') |
filemenu.add_command(label='Print to Postscript', underline=0, command=self.postscript, accelerator='Ctrl-p') |
|
|
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
|
| menubar.add_cascade(label='File', underline=0, menu=filemenu) | menubar.add_cascade(label='File', underline=0, menu=filemenu) | |
| editmenu = Menu(menubar, tearoff=0) | editmenu = Menu(menubar, tearoff=0) | |
|
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
|
|
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
|
| menubar.add_cascade(label='Edit', underline=0, menu=editmenu) | menubar.add_cascade(label='Edit', underline=0, menu=editmenu) | |
| rulemenu = Menu(menubar, tearoff=0) | rulemenu = Menu(menubar, tearoff=0) | |
|
rulemenu.add_command(label='Step', underline=1, command=self.step, accelerator='Space') |
rulemenu.add_command(label='Step', underline=1, command=self.step, accelerator='Space') |
|
| rulemenu.add_separator() | rulemenu.add_separator() | |
|
rulemenu.add_command(label='Match', underline=0, command=self.match, accelerator='Ctrl-m') |
rulemenu.add_command(label='Shift', underline=0, command=self.shift, accelerator='Ctrl-s') |
Clone # 3
Anti-unification distance between two trees = 1
Total size of two trees = 176
Total length of sequences = 28
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 1007 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 860 | |
| print "Baum-Welch demo for market example" | print "HMM probability calculation demo" | |
| symbols = ['up', 'down', 'unchanged'] | symbols = ['up', 'down', 'unchanged'] | |
| states = ['bull', 'bear', 'static'] | states = ['bull', 'bear', 'static'] | |
|
def pd(values, samples): d = {} for value, item in zip(values, samples): d[item] = value return DictionaryProbDist(d) |
def pd(values, samples): d = {} for value, item in zip(values, samples): d[item] = value return DictionaryProbDist(d) |
|
|
def cpd(array, conditions, samples): d = {} for values, condition in zip(array, conditions): d[condition] = pd(values, samples) return DictionaryConditionalProbDist(d) |
def cpd(array, conditions, samples): d = {} for values, condition in zip(array, conditions): d[condition] = pd(values, samples) return DictionaryConditionalProbDist(d) |
|
| A = array([[0.6, 0.2, 0.2], [0.5, 0.3, 0.2], [0.4, 0.1, 0.5]], float64) | A = array([[0.6, 0.2, 0.2], [0.5, 0.3, 0.2], [0.4, 0.1, 0.5]], float64) | |
| A = cpd(A, states, states) | A = cpd(A, states, states) | |
| B = array([[0.7, 0.1, 0.2], [0.1, 0.6, 0.3], [0.3, 0.3, 0.4]], float64) | B = array([[0.7, 0.1, 0.2], [0.1, 0.6, 0.3], [0.3, 0.3, 0.4]], float64) | |
| B = cpd(B, states, symbols) | B = cpd(B, states, symbols) | |
| pi = array([0.5, 0.2, 0.3], float64) | pi = array([0.5, 0.2, 0.3], float64) | |
| pi = pd(pi, states) | pi = pd(pi, states) | |
|
model = HiddenMarkovModelTagger(symbols=symbols, states=states, transitions=A, outputs=B, priors=pi) |
model = HiddenMarkovModelTagger(symbols=symbols, states=states, transitions=A, outputs=B, priors=pi) |
Clone # 4
Anti-unification distance between two trees = 4
Total size of two trees = 159
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 820 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1918 | |
| zoommenu = Menu(menubar, tearoff=0) | zoommenu = Tkinter.Menu(menubar, tearoff=0) | |
|
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) | menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) |
Clone # 5
Anti-unification distance between two trees = 2
Total size of two trees = 156
Total length of sequences = 18
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 151 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 155 | |
| self._prodframe = listframe = Frame(parent) | self._prodframe = listframe = Frame(parent) | |
| self._prodframe.pack(fill='both', side='left', padx=2) | self._prodframe.pack(fill='both', side='left', padx=2) | |
|
self._prodlist_label = Label(self._prodframe, font=self._boldfont, text='Available Expansions') |
self._prodlist_label = Label(self._prodframe, font=self._boldfont, text='Available Reductions') |
|
| self._prodlist_label.pack() | self._prodlist_label.pack() | |
|
self._prodlist = Listbox(self._prodframe, selectmode='single', relief='groove', background='white', foreground='#909090', font=self._font, selectforeground='#004040', selectbackground='#c0f0c0') |
self._prodlist = Listbox(self._prodframe, selectmode='single', relief='groove', background='white', foreground='#909090', font=self._font, selectforeground='#004040', selectbackground='#c0f0c0') |
|
| self._prodlist.pack(side='right', fill='both', expand=1) | self._prodlist.pack(side='right', fill='both', expand=1) | |
| self._productions = list(self._parser.grammar().productions()) | self._productions = list(self._parser.grammar().productions()) | |
|
for production in self._productions: self._prodlist.insert('end', (' %s' % production)) |
for production in self._productions: self._prodlist.insert('end', (' %s' % production)) |
|
| self._prodlist.config(height=min(len(self._productions), 25)) | self._prodlist.config(height=min(len(self._productions), 25)) |
Clone # 6
Anti-unification distance between two trees = 2
Total size of two trees = 146
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) | menubar.add_cascade(label='View', underline=0, menu=viewmenu) |
Clone # 7
Anti-unification distance between two trees = 2
Total size of two trees = 146
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) | menubar.add_cascade(label='View', underline=0, menu=viewmenu) |
Clone # 8
Anti-unification distance between two trees = 4
Total size of two trees = 146
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) | menubar.add_cascade(label='View', underline=0, menu=viewmenu) |
Clone # 9
Anti-unification distance between two trees = 4
Total size of two trees = 146
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
|
| menubar.add_cascade(label='Zoom', underline=0, menu=zoommenu) | menubar.add_cascade(label='View', underline=0, menu=viewmenu) |
Clone # 10
Anti-unification distance between two trees = 4
Total size of two trees = 146
Total length of sequences = 18
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 605 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 585 | |
| cv2_frame = Tkinter.Frame(frame, border=3, relief='groove') | cv1_frame = Tkinter.Frame(frame, border=3, relief='groove') | |
| cv2_frame.pack(side='left', padx=8, pady=7, expand=1, fill='both') | cv1_frame.pack(side='left', padx=8, pady=7, expand=1, fill='both') | |
|
self._right_selector = MutableOptionMenu( cv2_frame, self._charts.keys(), command=self._select_right) |
self._left_selector = MutableOptionMenu( cv1_frame, self._charts.keys(), command=self._select_left) |
|
| self._right_selector.pack(side='top', pady=5, fill='x') | self._left_selector.pack(side='top', pady=5, fill='x') | |
|
self._right_matrix = ChartMatrixView(cv2_frame, self._emptychart, toplevel=False, show_numedges=True) |
self._left_matrix = ChartMatrixView(cv1_frame, self._emptychart, toplevel=False, show_numedges=True) |
|
|
self._right_matrix.pack(side='bottom', padx=5, pady=5, expand=1, fill='both') |
self._left_matrix.pack(side='bottom', padx=5, pady=5, expand=1, fill='both') |
|
| self._right_matrix.add_callback('select', self.select_edge) | self._left_matrix.add_callback('select', self.select_edge) | |
| self._right_matrix.add_callback('select_cell', self.select_cell) | self._left_matrix.add_callback('select_cell', self.select_cell) | |
| self._right_matrix.inactivate() | self._left_matrix.inactivate() |
Clone # 11
Anti-unification distance between two trees = 4
Total size of two trees = 130
Total length of sequences = 26
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 473 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 471 | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) iff (man x))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 12
Anti-unification distance between two trees = 3
Total size of two trees = 120
Total length of sequences = 24
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 476 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 470 | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'((man x) implies (not (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) iff (man x))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 13
Anti-unification distance between two trees = 4
Total size of two trees = 118
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/api.py" The first line is 118 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/api.py" The first line is 47 | |
|
def labels(self): raise NotImplementedError() |
def labels(self): raise NotImplementedError() |
|
|
def classify(self, featureset): if overridden(self.batch_classify): return self.batch_classify([featureset])[0] raise NotImplementedError() |
def classify(self, featureset): if overridden(self.batch_classify): return self.batch_classify([featureset])[0] raise NotImplementedError() |
|
|
def prob_classify(self, featureset): if overridden(self.batch_prob_classify): return self.batch_prob_classify([featureset])[0] raise NotImplementedError() |
def prob_classify(self, featureset): if overridden(self.batch_prob_classify): return self.batch_prob_classify([featureset])[0] raise NotImplementedError() |
|
|
def batch_classify(self, featuresets): return [self.classify(fs) for fs in featuresets] |
def batch_classify(self, featuresets): return [self.classify(fs) for fs in featuresets] |
|
|
def batch_prob_classify(self, featuresets): return [self.prob_classify(fs) for fs in featuresets] |
def batch_prob_classify(self, featuresets): return [self.prob_classify(fs) for fs in featuresets] |
|
|
@deprecated("Use .batch_prob_classify() instead.") def batch_probdist(self, featuresets): return self.batch_prob_classify(featuresets) |
@deprecated("Use .batch_prob_classify() instead.") def batch_probdist(self, featuresets): return self.batch_prob_classify(featuresets) |
|
|
@deprecated("Use .prob_classify() instead.") def probdist(self, featureset): return self.prob_classify(featureset) |
@deprecated("Use .prob_classify() instead.") def probdist(self, featureset): return self.prob_classify(featureset) |
Clone # 14
Anti-unification distance between two trees = 3
Total size of two trees = 116
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1366 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1209 | |
|
def __init__(self, canvas, *children, **attribs): self._align = 'center' self._space = 1 self._ordered = False self._children = list(children) for child in children: self._add_child_widget(child) CanvasWidget.__init__(self, canvas, **attribs) |
def __init__(self, canvas, *children, **attribs): self._align = 'center' self._space = 1 self._ordered = False self._children = list(children) for child in children: self._add_child_widget(child) CanvasWidget.__init__(self, canvas, **attribs) |
|
|
def __setitem__(self, attr, value): if attr == 'align': if value not in ('left', 'right', 'center'): raise ValueError('Bad alignment: %r' % value) self._align = value elif attr == 'space': self._space = value elif attr == 'ordered': self._ordered = value else: CanvasWidget.__setitem__(self, attr, value) |
def __setitem__(self, attr, value): if attr == 'align': if value not in ('top', 'bottom', 'center'): raise ValueError('Bad alignment: %r' % value) self._align = value elif attr == 'space': self._space = value elif attr == 'ordered': self._ordered = value else: CanvasWidget.__setitem__(self, attr, value) |
|
|
def __getitem__(self, attr): if attr == 'align': return value elif attr == 'space': return self._space elif attr == 'ordered': return self._ordered else: return CanvasWidget.__getitem__(self, attr) |
def __getitem__(self, attr): if attr == 'align': return value elif attr == 'space': return self._space elif attr == 'ordered': return self._ordered else: return CanvasWidget.__getitem__(self, attr) |
|
| def _tags(self): return [] | def _tags(self): return [] |
Clone # 15
Anti-unification distance between two trees = 4
Total size of two trees = 114
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 325 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1905 | |
|
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animation_frames, value=0) |
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animate, value=0) |
|
|
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animation_frames, value=10, accelerator='-') |
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animate, value=1, accelerator='-') |
|
|
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animation_frames, value=5, accelerator='=') |
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animate, value=2, accelerator='=') |
|
|
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animation_frames, value=2, accelerator='+') |
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animate, value=3, accelerator='+') |
|
| menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) | menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) |
Clone # 16
Anti-unification distance between two trees = 3
Total size of two trees = 114
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 294 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1905 | |
|
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animate, value=0) |
animatemenu.add_radiobutton(label="No Animation", underline=0, variable=self._animate, value=0) |
|
|
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animate, value=20, accelerator='-') |
animatemenu.add_radiobutton(label="Slow Animation", underline=0, variable=self._animate, value=1, accelerator='-') |
|
|
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animate, value=10, accelerator='=') |
animatemenu.add_radiobutton(label="Normal Animation", underline=0, variable=self._animate, value=2, accelerator='=') |
|
|
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animate, value=4, accelerator='+') |
animatemenu.add_radiobutton(label="Fast Animation", underline=0, variable=self._animate, value=3, accelerator='+') |
|
| menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) | menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) |
Clone # 17
Anti-unification distance between two trees = 2
Total size of two trees = 111
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1855 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 281 | |
|
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
|
| menubar.add_cascade(label='File', underline=0, menu=filemenu) | menubar.add_cascade(label='File', underline=0, menu=filemenu) | |
| editmenu = Tkinter.Menu(menubar, tearoff=0) | editmenu = Menu(menubar, tearoff=0) | |
|
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
|
|
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
|
| menubar.add_cascade(label='Edit', underline=0, menu=editmenu) | menubar.add_cascade(label='Edit', underline=0, menu=editmenu) |
Clone # 18
Anti-unification distance between two trees = 2
Total size of two trees = 111
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1855 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 250 | |
|
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
filemenu.add_command(label='Exit', underline=1, command=self.destroy, accelerator='Ctrl-x') |
|
| menubar.add_cascade(label='File', underline=0, menu=filemenu) | menubar.add_cascade(label='File', underline=0, menu=filemenu) | |
| editmenu = Tkinter.Menu(menubar, tearoff=0) | editmenu = Menu(menubar, tearoff=0) | |
|
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
editmenu.add_command(label='Edit Grammar', underline=5, command=self.edit_grammar, accelerator='Ctrl-g') |
|
|
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
editmenu.add_command(label='Edit Text', underline=5, command=self.edit_sentence, accelerator='Ctrl-t') |
|
| menubar.add_cascade(label='Edit', underline=0, menu=editmenu) | menubar.add_cascade(label='Edit', underline=0, menu=editmenu) |
Clone # 19
Anti-unification distance between two trees = 2
Total size of two trees = 110
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 140 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 169 | |
|
def __init__(self, *args, **kwargs): CategorizedCorpusReader.__init__(self, kwargs) PlaintextCorpusReader.__init__(self, *args, **kwargs) |
def __init__(self, *args, **kwargs): CategorizedCorpusReader.__init__(self, kwargs) TaggedCorpusReader.__init__(self, *args, **kwargs) |
|
|
def _resolve(self, files, categories): if files is not None and categories is not None: raise ValueError('Specify files or categories, not both') if categories is not None: return self.files(categories) return files |
def _resolve(self, files, categories): if files is not None and categories is not None: raise ValueError('Specify files or categories, not both') if categories is not None: return self.files(categories) return files |
|
|
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def paras(self, files=None, categories=None): return PlaintextCorpusReader.paras( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
Clone # 20
Anti-unification distance between two trees = 4
Total size of two trees = 110
Total length of sequences = 22
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 475 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 471 | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) iff (man x))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 21
Anti-unification distance between two trees = 1
Total size of two trees = 102
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1455 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1298 | |
|
def __repr__(self): return '[Stack: ' + `self._children`[1:-1]+']' |
def __repr__(self): return '[Sequence: ' + `self._children`[1:-1]+']' |
|
| children = CanvasWidget.child_widgets | children = CanvasWidget.child_widgets | |
|
def replace_child(self, oldchild, newchild): index = self._children.index(oldchild) self._children[index] = newchild self._remove_child_widget(oldchild) self._add_child_widget(newchild) self.update(newchild) |
def replace_child(self, oldchild, newchild): index = self._children.index(oldchild) self._children[index] = newchild self._remove_child_widget(oldchild) self._add_child_widget(newchild) self.update(newchild) |
|
|
def remove_child(self, child): index = self._children.index(child) del self._children[index] self._remove_child_widget(child) if len(self._children) > 0: self.update(self._children[0]) |
def remove_child(self, child): index = self._children.index(child) del self._children[index] self._remove_child_widget(child) if len(self._children) > 0: self.update(self._children[0]) |
|
|
def insert_child(self, index, child): self._children.insert(index, child) self._add_child_widget(child) |
def insert_child(self, index, child): self._children.insert(index, child) self._add_child_widget(child) |
Clone # 22
Anti-unification distance between two trees = 1
Total size of two trees = 100
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 846 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 560 | |
|
def edit_grammar(self, *e): CFGEditor(self._top, self._parser.grammar(), self.set_grammar) |
def edit_grammar(self, *e): CFGEditor(self._top, self._parser.grammar(), self.set_grammar) |
|
|
def set_grammar(self, grammar): self._parser.set_grammar(grammar) self._productions = list(grammar.productions()) self._prodlist.delete(0, 'end') for production in self._productions: self._prodlist.insert('end', (' %s' % production)) |
def set_grammar(self, grammar): self._parser.set_grammar(grammar) self._productions = list(grammar.productions()) self._prodlist.delete(0, 'end') for production in self._productions: self._prodlist.insert('end', (' %s' % production)) |
|
|
def edit_sentence(self, *e): sentence = string.join(self._sent) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._top, sentence, instr, self.set_sentence, title) |
def edit_sentence(self, *e): sentence = string.join(self._sent) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._top, sentence, instr, self.set_sentence, title) |
|
|
def set_sentence(self, sentence): self._sent = sentence.split() #[XX] use tagged? self.reset() |
def set_sentence(self, sentence): self._sent = sent.split() #[XX] use tagged? self.reset() |
Clone # 23
Anti-unification distance between two trees = 0
Total size of two trees = 98
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 450 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 487 | |
| T = len(unlabeled_sequence) | T = len(unlabeled_sequence) | |
| N = len(self._states) | N = len(self._states) | |
| labellings = [[state] for state in self._states] | labellings = [[state] for state in self._states] | |
|
for t in range(T - 1): current = labellings labellings = [] for labelling in current: for state in self._states: labellings.append(labelling + [state]) |
for t in range(T - 1): current = labellings labellings = [] for labelling in current: for state in self._states: labellings.append(labelling + [state]) |
|
| log_probs = [] | log_probs = [] | |
|
for labelling in labellings: labelled_sequence = unlabeled_sequence[:] for t, label in enumerate(labelling): labelled_sequence[t] = (labelled_sequence[t][_TEXT], label) lp = self.log_probability(labelled_sequence) log_probs.append(lp) |
for labelling in labellings: labelled_sequence = unlabeled_sequence[:] for t, label in enumerate(labelling): labelled_sequence[t] = (labelled_sequence[t][_TEXT], label) lp = self.log_probability(labelled_sequence) log_probs.append(lp) |
|
| normalisation = _log_add(*log_probs) | normalisation = _log_add(*log_probs) |
Clone # 24
Anti-unification distance between two trees = 4
Total size of two trees = 94
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1721 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 133 | |
| self._sysfont = tkFont.Font(font=Tkinter.Button()["font"]) | self._sysfont = tkFont.Font(font=Button()["font"]) | |
| root.option_add("*Font", self._sysfont) | root.option_add("*Font", self._sysfont) | |
| self._size = Tkinter.IntVar(root) | self._size = IntVar(root) | |
| self._size.set(self._sysfont.cget('size')) | self._size.set(self._sysfont.cget('size')) | |
|
self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) |
self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) |
|
|
self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
Clone # 25
Anti-unification distance between two trees = 0
Total size of two trees = 92
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 141 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 133 | |
| self._sysfont = tkFont.Font(font=Button()["font"]) | self._sysfont = tkFont.Font(font=Button()["font"]) | |
| root.option_add("*Font", self._sysfont) | root.option_add("*Font", self._sysfont) | |
| self._size = IntVar(root) | self._size = IntVar(root) | |
| self._size.set(self._sysfont.cget('size')) | self._size.set(self._sysfont.cget('size')) | |
|
self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) |
self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) |
|
|
self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
Clone # 26
Anti-unification distance between two trees = 4
Total size of two trees = 90
Total length of sequences = 18
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 479 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 471 | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) iff (man x))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 27
Anti-unification distance between two trees = 4
Total size of two trees = 88
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 518 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 484 | |
|
class ImmutableProbabilisticTree(ImmutableTree, ProbabilisticMixIn): def __init__(self, node, children, **prob_kwargs): ProbabilisticMixIn.__init__(self, **prob_kwargs) ImmutableTree.__init__(self, node, children) def _frozen_class(self): return ImmutableProbabilisticTree def __repr__(self): return '%s [%s]' % (Tree.__repr__(self), self.prob()) def __str__(self): return '%s [%s]' % (self.pprint(margin=60), self.prob()) def __cmp__(self, other): c = Tree.__cmp__(self, other) if c != 0: return c return cmp(self.prob(), other.prob()) def __eq__(self, other): if not isinstance(other, Tree): return False return Tree.__eq__(self, other) and self.prob()==other.prob() def __ne__(self, other): return not (self == other) def copy(self, deep=False): if not deep: return self.__class__(self.node, self, prob=self.prob()) else: return self.__class__.convert(self) def convert(cls, val): if isinstance(val, Tree): children = [cls.convert(child) for child in val] if isinstance(val, ProbabilisticMixIn): return cls(val.node, children, prob=val.prob()) return cls(val.node, children, prob=1) return val convert = classmethod(convert) |
class ProbabilisticTree(Tree, ProbabilisticMixIn): def __init__(self, node, children, **prob_kwargs): ProbabilisticMixIn.__init__(self, **prob_kwargs) Tree.__init__(self, node, children) def _frozen_class(self): return ImmutableProbabilisticTree def __repr__(self): return '%s (p=%s)' % (Tree.__repr__(self), self.prob()) def __str__(self): return '%s (p=%s)' % (self.pprint(margin=60), self.prob()) def __cmp__(self, other): c = Tree.__cmp__(self, other) if c != 0: return c return cmp(self.prob(), other.prob()) def __eq__(self, other): if not isinstance(other, Tree): return False return Tree.__eq__(self, other) and self.prob()==other.prob() def __ne__(self, other): return not (self == other) def copy(self, deep=False): if not deep: return self.__class__(self.node, self, prob=self.prob()) else: return self.__class__.convert(self) def convert(cls, val): if isinstance(val, Tree): children = [cls.convert(child) for child in val] if isinstance(val, ProbabilisticMixIn): return cls(val.node, children, prob=val.prob()) return cls(val.node, children, prob=1.0) return val convert = classmethod(convert) |
Clone # 28
Anti-unification distance between two trees = 4
Total size of two trees = 88
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/viterbi.py" The first line is 345 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/pchart.py" The first line is 389 | |
| from nltk import tokenize | from nltk import tokenize, cfg | |
| from nltk.parse import ViterbiParser | from nltk.parse import pchart | |
|
demos = [('I saw the man with my telescope', nltk.toy_pcfg1), ('the boy saw Jack with Bob under the table with a telescope', nltk.toy_pcfg2)] |
demos = [('I saw John with my telescope', cfg.toy_pcfg1), ('the boy saw Jack with Bob under the table with a telescope', cfg.toy_pcfg2)] |
|
|
for i in range(len(demos)): print '%3s: %s' % (i+1, demos[i][0]) print ' %r' % demos[i][1] |
for i in range(len(demos)): print '%3s: %s' % (i+1, demos[i][0]) print ' %r' % demos[i][1] |
|
| print 'Which demo (%d-%d)? ' % (1, len(demos)), | print 'Which demo (%d-%d)? ' % (1, len(demos)), | |
|
try: snum = int(sys.stdin.readline().strip())-1 sent, grammar = demos[snum] print 'Bad sentence number' return |
try: snum = int(sys.stdin.readline().strip())-1 sent, grammar = demos[snum] print 'Bad sentence number' return |
|
| tokens = sent.split() | tokens = sent.split() |
Clone # 29
Anti-unification distance between two trees = 0
Total size of two trees = 86
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 244 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 317 | |
|
def _init_feedback(self, parent): self._feedbackframe = feedbackframe = Frame(parent) feedbackframe.pack(fill='x', side='bottom', padx=3, pady=3) self._lastoper_label = Label(feedbackframe, text='Last Operation:', font=self._font) self._lastoper_label.pack(side='left') lastoperframe = Frame(feedbackframe, relief='sunken', border=1) lastoperframe.pack(fill='x', side='right', expand=1, padx=5) self._lastoper1 = Label(lastoperframe, foreground='#007070', background='#f0f0f0', font=self._font) self._lastoper2 = Label(lastoperframe, anchor='w', width=30, foreground='#004040', background='#f0f0f0', font=self._font) self._lastoper1.pack(side='left') self._lastoper2.pack(side='left', fill='x', expand=1) |
def _init_feedback(self, parent): self._feedbackframe = feedbackframe = Frame(parent) feedbackframe.pack(fill='x', side='bottom', padx=3, pady=3) self._lastoper_label = Label(feedbackframe, text='Last Operation:', font=self._font) self._lastoper_label.pack(side='left') lastoperframe = Frame(feedbackframe, relief='sunken', border=1) lastoperframe.pack(fill='x', side='right', expand=1, padx=5) self._lastoper1 = Label(lastoperframe, foreground='#007070', background='#f0f0f0', font=self._font) self._lastoper2 = Label(lastoperframe, anchor='w', width=30, foreground='#004040', background='#f0f0f0', font=self._font) self._lastoper1.pack(side='left') self._lastoper2.pack(side='left', fill='x', expand=1) |
Clone # 30
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 480 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 504 | |
| f = LogicParser().parse(r'((man x) or (not (man x)))') | f = LogicParser().parse('all x.all y.((x = y) implies (y = x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) implies (man x))') | f = LogicParser().parse('all x.all y.all z.(((x = y)and(y = z))implies(x = z))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'((man x) iff (man x))') | f = LogicParser().parse('(not(all x.some y.(F y x) and some x.all y.(not(F y x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') | f = LogicParser().parse('some x.all y.(sees x y)') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 31
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 504 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 478 | |
| f = LogicParser().parse('all x.all y.((x = y) implies (y = x))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('all x.all y.all z.(((x = y)and(y = z))implies(x = z))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('(not(all x.some y.(F y x) and some x.all y.(not(F y x))))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('some x.all y.(sees x y)') | f = LogicParser().parse(r'((man x) iff (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 32
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 504 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 476 | |
| f = LogicParser().parse('all x.all y.((x = y) implies (y = x))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('all x.all y.all z.(((x = y)and(y = z))implies(x = z))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('(not(all x.some y.(F y x) and some x.all y.(not(F y x))))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('some x.all y.(sees x y)') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 33
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 504 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 474 | |
| f = LogicParser().parse('all x.all y.((x = y) implies (y = x))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('all x.all y.all z.(((x = y)and(y = z))implies(x = z))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('(not(all x.some y.(F y x) and some x.all y.(not(F y x))))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('some x.all y.(sees x y)') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 34
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 16
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 504 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 472 | |
| f = LogicParser().parse('all x.all y.((x = y) implies (y = x))') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('all x.all y.all z.(((x = y)and(y = z))implies(x = z))') | f = LogicParser().parse(r'((man x) or (not (man x)))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('(not(all x.some y.(F y x) and some x.all y.(not(F y x))))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| f = LogicParser().parse('some x.all y.(sees x y)') | f = LogicParser().parse(r'(not ((man x) and (not (man x))))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) |
Clone # 35
Anti-unification distance between two trees = 4
Total size of two trees = 80
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 217 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1828 | |
|
self._top.bind(' |
self._root.bind(' |
|
|
self._top.bind(' |
self._root.bind(' |
|
| self._top.bind('-', lambda e,a=self._animate:a.set(20)) | self._root.bind('-', lambda e,a=self._animate:a.set(1)) | |
| self._top.bind('=', lambda e,a=self._animate:a.set(10)) | self._root.bind('=', lambda e,a=self._animate:a.set(2)) | |
| self._top.bind('+', lambda e,a=self._animate:a.set(4)) | self._root.bind('+', lambda e,a=self._animate:a.set(3)) |
Clone # 36
Anti-unification distance between two trees = 2
Total size of two trees = 77
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 632 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 340 | |
| helpmenu = Tkinter.Menu(menubar, tearoff=0) | helpmenu = Menu(menubar, tearoff=0) | |
|
helpmenu.add_command(label='About', underline=0, command=self.about) |
helpmenu.add_command(label='About', underline=0, command=self.about) |
|
|
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
|
| menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | |
| parent.config(menu=menubar) | parent.config(menu=menubar) |
Clone # 37
Anti-unification distance between two trees = 2
Total size of two trees = 77
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 632 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 308 | |
| helpmenu = Tkinter.Menu(menubar, tearoff=0) | helpmenu = Menu(menubar, tearoff=0) | |
|
helpmenu.add_command(label='About', underline=0, command=self.about) |
helpmenu.add_command(label='About', underline=0, command=self.about) |
|
|
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
helpmenu.add_command(label='Instructions', underline=0, command=self.help, accelerator='F1') |
|
| menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | menubar.add_cascade(label='Help', underline=0, menu=helpmenu) | |
| parent.config(menu=menubar) | parent.config(menu=menubar) |
Clone # 38
Anti-unification distance between two trees = 4
Total size of two trees = 76
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1800 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1792 | |
|
Tkinter.Button(frame2, text='Bottom Up Init\nRule', background='#90f090', foreground='black', command=self.bottom_up_init).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Expand\nRule', background='#90f090', foreground='black', command=self.top_down_expand).pack(side='left') |
|
|
Tkinter.Button(frame2, text='Bottom Up Predict\nRule', background='#90f090', foreground='black', command=self.bottom_up).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Match\nRule', background='#90f090', foreground='black', command=self.top_down_match).pack(side='left') |
|
| Tkinter.Frame(frame2, width=20).pack(side='left') | Tkinter.Frame(frame2, width=20).pack(side='left') |
Clone # 39
Anti-unification distance between two trees = 4
Total size of two trees = 72
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py" The first line is 107 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py" The first line is 105 | |
|
def sents(self, documents=None): return self._pos_reader.sents(self._getfiles(documents, 'pos')) |
def words(self, documents=None): return self._pos_reader.words(self._getfiles(documents, 'pos')) |
|
|
def paras(self, documents=None): return self._pos_reader.paras(self._getfiles(documents, 'pos')) |
def sents(self, documents=None): return self._pos_reader.sents(self._getfiles(documents, 'pos')) |
|
|
def tagged_words(self, documents=None): return self._pos_reader.tagged_words(self._getfiles(documents, 'pos')) |
def paras(self, documents=None): return self._pos_reader.paras(self._getfiles(documents, 'pos')) |
|
|
def tagged_sents(self, documents=None): return self._pos_reader.tagged_sents(self._getfiles(documents, 'pos')) |
def tagged_words(self, documents=None): return self._pos_reader.tagged_words(self._getfiles(documents, 'pos')) |
Clone # 40
Anti-unification distance between two trees = 4
Total size of two trees = 72
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 725 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ieer.py" The first line is 66 | |
|
def raw(self, files=None): return concat([open(filename).read() for filename in self.abspaths(files)]) |
def raw(self, files=None): return concat([open(filename).read() for filename in self.abspaths(files)]) |
|
|
def parsed_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_sent_block) for filename in self.abspaths(files)]) |
def docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_block) for filename in self.abspaths(files)]) |
|
|
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
def parsed_docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_block) for filename in self.abspaths(files)]) |
Clone # 41
Anti-unification distance between two trees = 3
Total size of two trees = 72
Total length of sequences = 18
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 1140 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 1148 | |
|
grammar = r""" """ |
grammar = r""" """ |
|
| cp = chunk.RegexpParser(grammar) | cp = chunk.RegexpParser(grammar) | |
| chunk.demo_eval(cp, text) | chunk.demo_eval(cp, text) | |
|
grammar = r""" """ |
grammar = r""" """ |
|
| cp = chunk.RegexpParser(grammar) | cp = chunk.RegexpParser(grammar) | |
| chunk.demo_eval(cp, text) | chunk.demo_eval(cp, text) | |
|
grammar = r""" """ |
grammar = r""" """ |
|
| cp = chunk.RegexpParser(grammar) | cp = chunk.RegexpParser(grammar) | |
| chunk.demo_eval(cp, text) | chunk.demo_eval(cp, text) |
Clone # 42
Anti-unification distance between two trees = 4
Total size of two trees = 72
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 191 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 188 | |
|
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
Clone # 43
Anti-unification distance between two trees = 4
Total size of two trees = 72
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 194 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 188 | |
|
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
Clone # 44
Anti-unification distance between two trees = 4
Total size of two trees = 72
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 197 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 188 | |
|
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def tagged_paras(self, files=None, categories=None): return TaggedCorpusReader.tagged_paras( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
Clone # 45
Anti-unification distance between two trees = 0
Total size of two trees = 70
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1563 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 203 | |
|
def add_callback(self, event, func): self._callbacks.setdefault(event,{})[func] = 1 |
def add_callback(self, event, func): self._callbacks.setdefault(event,{})[func] = 1 |
|
|
def remove_callback(self, event, func=None): if func is None: del self._callbacks[event] try: del self._callbacks[event][func] except: pass |
def remove_callback(self, event, func=None): if func is None: del self._callbacks[event] try: del self._callbacks[event][func] except: pass |
|
|
def _fire_callbacks(self, event, *args): if not self._callbacks.has_key(event): return for cb_func in self._callbacks[event].keys(): cb_func(*args) |
def _fire_callbacks(self, event, *args): if not self._callbacks.has_key(event): return for cb_func in self._callbacks[event].keys(): cb_func(*args) |
Clone # 46
Anti-unification distance between two trees = 2
Total size of two trees = 70
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 321 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 247 | |
|
def simplify(self): return self |
def simplify(self): return self |
|
|
def infixify(self): return self |
def infixify(self): return self |
|
|
def name(self): return self.__str__() |
def name(self): return self.__str__() |
|
|
def _skolemise(self, bound_vars, counter): return self |
def _skolemise(self, bound_vars, counter): return self |
|
| def __str__(self): return '%s' % self.constant | def __str__(self): return '%s' % self.variable | |
| def __repr__(self): return "ConstantExpression('%s')" % self.constant | def __repr__(self): return "VariableExpression('%s')" % self.variable | |
| def __hash__(self): return hash(repr(self)) | def __hash__(self): return hash(repr(self)) |
Clone # 47
Anti-unification distance between two trees = 4
Total size of two trees = 70
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 210 | |
| self._top.bind('<space>', self.step) | self._top.bind('<Control-z>', self.undo) | |
| self._top.bind('<Delete>', self.reset) | self._top.bind('<BackSpace>', self.undo) | |
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 48
Anti-unification distance between two trees = 4
Total size of two trees = 69
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/timit.py" The first line is 241 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/timit.py" The first line is 254 | |
|
def phones(self, utterances=None): return [line.split()[-1] for filename in self._utterance_filenames(utterances, '.phn') for line in open(filename) if line.strip()] |
def words(self, utterances=None): return [line.split()[-1] for filename in self._utterance_filenames(utterances, '.wrd') for line in open(filename) if line.strip()] |
|
|
def phone_times(self, utterances=None): return [(line.split()[2], int(line.split()[0]), int(line.split()[1])) for filename in self._utterance_filenames(utterances, '.phn') for line in open(filename) if line.strip()] |
def word_times(self, utterances=None): return [(line.split()[2], int(line.split()[0]), int(line.split()[1])) for filename in self._utterance_filenames(utterances, '.wrd') for line in open(filename) if line.strip()] |
Clone # 49
Anti-unification distance between two trees = 0
Total size of two trees = 68
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 310 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 550 | |
| self._imin = min(rng) | self._imin = min(rng) | |
| self._imax = max(rng) | self._imax = max(rng) | |
|
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
|
| self._jmin = min(vals) | self._jmin = min(vals) | |
| self._jmax = max(vals) | self._jmax = max(vals) | |
|
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
Clone # 50
Anti-unification distance between two trees = 1
Total size of two trees = 64
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/maxent.py" The first line is 366 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/maxent.py" The first line is 230 | |
| unattested = numpy.zeros(len(empirical_ffreq)) | unattested = numpy.zeros(len(empirical_fcount)) | |
|
for i in range(len(empirical_ffreq)): if empirical_ffreq[i] == 0: unattested[i] = 1 |
for i in range(len(empirical_fcount)): if empirical_fcount[i] == 0: unattested[i] = 1 |
|
| weights = numpy.ones(len(empirical_ffreq), 'd') | weights = numpy.ones(len(empirical_fcount), 'd') | |
| weights -= unattested | weights -= unattested | |
| classifier = ConditionalExponentialClassifier(labels, encoding, weights) | classifier = ConditionalExponentialClassifier(labels, encoding, weights) |
Clone # 51
Anti-unification distance between two trees = 0
Total size of two trees = 64
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/similarity.py" The first line is 183 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/similarity.py" The first line is 228 | |
| (noun_freqs, verb_freqs) = _load_ic_data(datafile) | (noun_freqs, verb_freqs) = _load_ic_data(datafile) | |
|
if synset1.pos is NOUN: freqs = noun_freqs elif synset1.pos is VERB: freqs = verb_freqs else: return -1 |
if synset1.pos is NOUN: freqs = noun_freqs elif synset1.pos is VERB: freqs = verb_freqs else: return -1 |
|
| ic1 = synset1.information_content(freqs) | ic1 = synset1.information_content(freqs) | |
| ic2 = synset2.information_content(freqs) | ic2 = synset2.information_content(freqs) | |
| (lcs, lcs_ic) = _lcs_by_content(synset1, synset2, freqs) | (lcs, lcs_ic) = _lcs_by_content(synset1, synset2, freqs) |
Clone # 52
Anti-unification distance between two trees = 4
Total size of two trees = 64
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 228 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 237 | |
|
Button(buttonframe, text='Match', underline=0, background='#90f090', foreground='black', command=self.match).pack(side='left') |
Button(buttonframe, text='Reduce', underline=0, background='#90f090', foreground='black', command=self.reduce).pack(side='left') |
|
|
Button(buttonframe, text='Backtrack', underline=0, background='#f0a0a0', foreground='black', command=self.backtrack).pack(side='left') |
Button(buttonframe, text='Undo', underline=0, background='#f0a0a0', foreground='black', command=self.undo).pack(side='left') |
Clone # 53
Anti-unification distance between two trees = 4
Total size of two trees = 60
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 222 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 231 | |
|
Button(buttonframe, text='Autostep', background='#90c0d0', foreground='black', command=self.autostep,).pack(side='left') |
Button(buttonframe, text='Step', background='#90c0d0', foreground='black', command=self.step,).pack(side='left') |
|
|
Button(buttonframe, text='Expand', underline=0, background='#90f090', foreground='black', command=self.expand).pack(side='left') |
Button(buttonframe, text='Shift', underline=0, background='#90f090', foreground='black', command=self.shift).pack(side='left') |
Clone # 54
Anti-unification distance between two trees = 4
Total size of two trees = 60
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1782 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1779 | |
|
Tkinter.Button(frame1, text='Bottom Up\nStrategy', background='#90c0d0', foreground='black', command=self.bottom_up_strategy).pack(side='left') |
Tkinter.Button(frame1, text='Top Down\nStrategy', background='#90c0d0', foreground='black', command=self.top_down_strategy).pack(side='left') |
|
|
Tkinter.Button(frame1, text='Earley\nAlgorithm', background='#90c0d0', foreground='black', command=self.earley_algorithm).pack(side='left') |
Tkinter.Button(frame1, text='Bottom Up\nStrategy', background='#90c0d0', foreground='black', command=self.bottom_up_strategy).pack(side='left') |
Clone # 55
Anti-unification distance between two trees = 4
Total size of two trees = 60
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1792 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1789 | |
|
Tkinter.Button(frame2, text='Top Down Expand\nRule', background='#90f090', foreground='black', command=self.top_down_expand).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Init\nRule', background='#90f090', foreground='black', command=self.top_down_init).pack(side='left') |
|
|
Tkinter.Button(frame2, text='Top Down Match\nRule', background='#90f090', foreground='black', command=self.top_down_match).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Expand\nRule', background='#90f090', foreground='black', command=self.top_down_expand).pack(side='left') |
Clone # 56
Anti-unification distance between two trees = 4
Total size of two trees = 60
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1800 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1789 | |
|
Tkinter.Button(frame2, text='Bottom Up Init\nRule', background='#90f090', foreground='black', command=self.bottom_up_init).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Init\nRule', background='#90f090', foreground='black', command=self.top_down_init).pack(side='left') |
|
|
Tkinter.Button(frame2, text='Bottom Up Predict\nRule', background='#90f090', foreground='black', command=self.bottom_up).pack(side='left') |
Tkinter.Button(frame2, text='Top Down Expand\nRule', background='#90f090', foreground='black', command=self.top_down_expand).pack(side='left') |
Clone # 57
Anti-unification distance between two trees = 3
Total size of two trees = 59
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py" The first line is 972 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/pchart.py" The first line is 106 | |
|
class SingleEdgeFundamentalRule(AbstractChartRule): NUM_EDGES = 1 _fundamental_rule = FundamentalRule() def apply_iter(self, chart, grammar, edge1): fr = self._fundamental_rule if edge1.is_incomplete(): for edge2 in chart.select(start=edge1.end(), is_complete=True, lhs=edge1.next()): for new_edge in fr.apply_iter(chart, grammar, edge1, edge2): yield new_edge for edge2 in chart.select(end=edge1.start(), is_complete=False, next=edge1.lhs()): for new_edge in fr.apply_iter(chart, grammar, edge2, edge1): yield new_edge def __str__(self): return 'Fundamental Rule' |
class SingleEdgeProbabilisticFundamentalRule(AbstractChartRule): NUM_EDGES=1 _fundamental_rule = ProbabilisticFundamentalRule() def apply_iter(self, chart, grammar, edge1): fr = self._fundamental_rule if edge1.is_incomplete(): for edge2 in chart.select(start=edge1.end(), is_complete=True, lhs=edge1.next()): for new_edge in fr.apply_iter(chart, grammar, edge1, edge2): yield new_edge for edge2 in chart.select(end=edge1.start(), is_complete=False, next=edge1.lhs()): for new_edge in fr.apply_iter(chart, grammar, edge2, edge1): yield new_edge def __str__(self): return 'Fundamental Rule' |
Clone # 58
Anti-unification distance between two trees = 4
Total size of two trees = 58
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1275 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1432 | |
| if len(self._children) == 0: return | if len(self._children) == 0: return | |
| child = self._children[0] | child = self._children[0] | |
| (left, top, right, bot) = child.bbox() | (left, top, right, bot) = child.bbox() | |
| y = self._yalign(top, bot) | x = self._xalign(left, right) | |
| index = self._children.index(child) | index = self._children.index(child) |
Clone # 59
Anti-unification distance between two trees = 4
Total size of two trees = 56
Total length of sequences = 14
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/chunked.py" The first line is 158 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 220 | |
| self._tagged = tagged | self._tagged = tagged | |
| self._group_by_sent = group_by_sent | self._group_by_sent = group_by_sent | |
| self._group_by_para = group_by_para | self._group_by_para = group_by_para | |
| self._chunked = chunked | self._sep = sep | |
| self._str2chunktree = str2chunktree | self._word_tokenizer = word_tokenizer | |
| self._sent_tokenizer = sent_tokenizer | self._sent_tokenizer = sent_tokenizer | |
| self._para_block_reader = para_block_reader | self._para_block_reader = para_block_reader |
Clone # 60
Anti-unification distance between two trees = 3
Total size of two trees = 56
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/cfg.py" The first line is 655 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/cfg.py" The first line is 459 | |
|
def parse_pcfg(s): productions = [] for linenum, line in enumerate(s.split('\n')): line = line.strip() if line.startswith('#') or line=='': continue try: productions += parse_pcfg_production(line) except ValueError: raise ValueError, 'Unable to parse line %s: %s' % (linenum, line) if len(productions) == 0: raise ValueError, 'No productions found!' start = productions[0].lhs() return WeightedGrammar(start, productions) |
def parse_cfg(s): productions = [] for linenum, line in enumerate(s.split('\n')): line = line.strip() if line.startswith('#') or line=='': continue try: productions += parse_cfg_production(line) except ValueError: raise ValueError, 'Unable to parse line %s: %s' % (linenum, line) if len(productions) == 0: raise ValueError, 'No productions found!' start = productions[0].lhs() return Grammar(start, productions) |
Clone # 61
Anti-unification distance between two trees = 3
Total size of two trees = 56
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 94 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 36 | |
|
def __init__(self, name): self.name = name |
def __init__(self, name): self.name = name |
|
|
def __cmp__(self, other): if not isinstance(other, Constant): return -1 return cmp(self.name, other.name) |
def __cmp__(self, other): if not isinstance(other, Variable): return -1 return cmp(self.name, other.name) |
|
| def __str__(self): return self.name | def __str__(self): return self.name | |
| def __repr__(self): return "Constant('%s')" % self.name | def __repr__(self): return "Variable('%s')" % self.name |
Clone # 62
Anti-unification distance between two trees = 3
Total size of two trees = 56
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1115 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1167 | |
|
def __setitem__(self, attr, value): if attr == 'color': self.canvas().itemconfig(self._oparen, outline=value) self.canvas().itemconfig(self._cparen, outline=value) elif attr == 'width': self.canvas().itemconfig(self._oparen, width=value) self.canvas().itemconfig(self._cparen, width=value) CanvasWidget.__setitem__(self, attr, value) |
def __setitem__(self, attr, value): if attr == 'color': self.canvas().itemconfig(self._obrack, fill=value) self.canvas().itemconfig(self._cbrack, fill=value) elif attr == 'width': self.canvas().itemconfig(self._obrack, width=value) self.canvas().itemconfig(self._cbrack, width=value) CanvasWidget.__setitem__(self, attr, value) |
|
|
def __getitem__(self, attr): if attr == 'color': return self.canvas().itemcget(self._oparen, 'outline') elif attr == 'width': return self.canvas().itemcget(self._oparen, 'width') return CanvasWidget.__getitem__(self, attr) |
def __getitem__(self, attr): if attr == 'color': return self.canvas().itemcget(self._obrack, 'outline') elif attr == 'width': return self.canvas().itemcget(self._obrack, 'width') return CanvasWidget.__getitem__(self, attr) |
Clone # 63
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 159 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 197 | |
|
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
|
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
Clone # 64
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 159 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 194 | |
|
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
Clone # 65
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 159 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 191 | |
|
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def paras(self, files=None, categories=None): return TaggedCorpusReader.paras( self, self._resolve(files, categories)) |
Clone # 66
Anti-unification distance between two trees = 3
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 162 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 159 | |
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def paras(self, files=None, categories=None): return PlaintextCorpusReader.paras( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
Clone # 67
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 162 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 188 | |
|
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def paras(self, files=None, categories=None): return PlaintextCorpusReader.paras( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
Clone # 68
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 159 | |
|
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return PlaintextCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return PlaintextCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def tagged_paras(self, files=None, categories=None): return TaggedCorpusReader.tagged_paras( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return PlaintextCorpusReader.sents( self, self._resolve(files, categories)) |
Clone # 69
Anti-unification distance between two trees = 3
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 188 | |
|
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
def raw(self, files=None, categories=None): return TaggedCorpusReader.raw( self, self._resolve(files, categories)) |
|
|
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
def words(self, files=None, categories=None): return TaggedCorpusReader.words( self, self._resolve(files, categories)) |
|
|
def tagged_paras(self, files=None, categories=None): return TaggedCorpusReader.tagged_paras( self, self._resolve(files, categories)) |
def sents(self, files=None, categories=None): return TaggedCorpusReader.sents( self, self._resolve(files, categories)) |
Clone # 70
Anti-unification distance between two trees = 2
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1451 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1444 | |
| (x1, y1, x2, y2) = self._children[i].bbox() | (x1, y1, x2, y2) = self._children[i].bbox() | |
| self._children[i].move(x-self._xalign(x1,x2), y-y2) | self._children[i].move(x-self._xalign(x1,x2), y-y1) | |
| y -= y2-y1 + self._space | y += y2-y1 + self._space |
Clone # 71
Anti-unification distance between two trees = 2
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1294 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1287 | |
| (x1, y1, x2, y2) = self._children[i].bbox() | (x1, y1, x2, y2) = self._children[i].bbox() | |
| self._children[i].move(x-x2, y-self._yalign(y1,y2)) | self._children[i].move(x-x1, y-self._yalign(y1,y2)) | |
| x -= x2-x1 + self._space | x += x2-x1 + self._space |
Clone # 72
Anti-unification distance between two trees = 4
Total size of two trees = 54
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 788 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py" The first line is 131 | |
|
@deprecated("Use .parsed_sents() instead.") def parsed(self, items=None): return self.parsed_sents(items) |
@deprecated("Use .parsed_sents() instead.") def parsed(self, items=None): return self.parsed_sents(items) |
|
|
@deprecated("Use .sents() instead.") def tokenized(self, items=None): return self.sents(items) |
@deprecated("Use .words() instead.") def tokenized(self, items=None): return self.words(items) |
|
|
@deprecated("Use .tagged_sents() instead.") def tagged(self, items=None): return self.tagged_sents(items) |
@deprecated("Use .tagged_words() instead.") def tagged(self, items=None): return self.tagged_words(items) |
Clone # 73
Anti-unification distance between two trees = 4
Total size of two trees = 53
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1719 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 139 | |
|
def _init_fonts(self, root): self._sysfont = tkFont.Font(font=Tkinter.Button()["font"]) root.option_add("*Font", self._sysfont) self._size = Tkinter.IntVar(root) self._size.set(self._sysfont.cget('size')) self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
def _init_fonts(self, root): self._sysfont = tkFont.Font(font=Button()["font"]) root.option_add("*Font", self._sysfont) self._size = IntVar(root) self._size.set(self._sysfont.cget('size')) self._boldfont = tkFont.Font(family='helvetica', weight='bold', size=self._size.get()) self._font = tkFont.Font(family='helvetica', size=self._size.get()) |
Clone # 74
Anti-unification distance between two trees = 3
Total size of two trees = 53
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/xmldocs.py" The first line is 30 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/wordlist.py" The first line is 21 | |
|
def raw(self, files=None): return concat([open(filename).read() for filename in self.abspaths(files)]) |
def raw(self, files=None): return concat([open(filename).read() for filename in self.abspaths(files)]) |
|
|
@deprecated("Use .raw() or .xml() instead.") def read(self, items=None, format='xml'): if format == 'raw': return self.raw(items) if format == 'xml': return self.xml(items) raise ValueError('bad format %r' % format) |
@deprecated("Use .raw() or .words() instead.") def read(self, items=None, format='listed'): if format == 'raw': return self.raw(items) if format == 'listed': return self.words(items) raise ValueError('bad format %r' % format) |
Clone # 75
Anti-unification distance between two trees = 0
Total size of two trees = 52
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/discourse.py" The first line is 381 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/util.py" The first line is 180 | |
| statements = [] | statements = [] | |
| lp = LogicParser() | lp = LogicParser() | |
|
for linenum, line in enumerate(s.splitlines()): line = line.strip() if line.startswith('#') or line=='': continue try: statements.append(lp.parse(line)) except Error: raise ValueError, 'Unable to parse line %s: %s' % (linenum, line) |
for linenum, line in enumerate(s.splitlines()): line = line.strip() if line.startswith('#') or line=='': continue try: statements.append(lp.parse(line)) except Error: raise ValueError, 'Unable to parse line %s: %s' % (linenum, line) |
|
| return statements | return statements |
Clone # 76
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1921 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 77
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1925 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1923 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 78
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1921 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 79
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1925 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 825 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
Clone # 80
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 823 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 81
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 827 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1923 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 82
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 823 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 83
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 827 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 825 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
Clone # 84
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 314 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 85
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 318 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 316 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 86
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 314 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 87
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 318 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 285 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 88
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 283 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 89
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 287 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 316 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 90
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 283 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 91
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 287 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 285 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
Clone # 92
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1923 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 93
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1923 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 94
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 825 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 95
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 825 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 96
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 316 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 97
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 316 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 98
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 285 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 99
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 285 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Medium', variable=self._size, underline=0, value=14, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 100
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1925 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 101
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1925 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 102
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 827 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1919 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 103
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 827 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 821 | |
|
zoommenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=28, command=self.resize) |
zoommenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
zoommenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=50, command=self.resize) |
zoommenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 104
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 318 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 105
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 318 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 106
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 287 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 312 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 107
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 287 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 281 | |
|
viewmenu.add_radiobutton(label='Large', variable=self._size, underline=0, value=18, command=self.resize) |
viewmenu.add_radiobutton(label='Tiny', variable=self._size, underline=0, value=10, command=self.resize) |
|
|
viewmenu.add_radiobutton(label='Huge', variable=self._size, underline=0, value=24, command=self.resize) |
viewmenu.add_radiobutton(label='Small', variable=self._size, underline=0, value=12, command=self.resize) |
Clone # 108
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 189 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 187 | |
|
Button(frame, text='Apply', command=self._apply, underline=0, takefocus=0).pack(side='left') |
Button(frame, text='Ok', command=self._ok, underline=0, takefocus=0).pack(side='left') |
|
|
Button(frame, text='Reset', command=self._reset, underline=0, takefocus=0,).pack(side='left') |
Button(frame, text='Apply', command=self._apply, underline=0, takefocus=0).pack(side='left') |
Clone # 109
Anti-unification distance between two trees = 4
Total size of two trees = 52
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 191 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 187 | |
|
Button(frame, text='Reset', command=self._reset, underline=0, takefocus=0,).pack(side='left') |
Button(frame, text='Ok', command=self._ok, underline=0, takefocus=0).pack(side='left') |
|
|
Button(frame, text='Cancel', command=self._cancel, underline=0, takefocus=0).pack(side='left') |
Button(frame, text='Apply', command=self._apply, underline=0, takefocus=0).pack(side='left') |
Clone # 110
Anti-unification distance between two trees = 0
Total size of two trees = 52
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 744 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 673 | |
|
productions = ( cfg.Production(S, [NP, VP]), cfg.Production(NP, [Det, N]), cfg.Production(NP, [NP, PP]), cfg.Production(VP, [VP, PP]), cfg.Production(VP, [V, NP, PP]), cfg.Production(VP, [V, NP]), cfg.Production(PP, [P, NP]), cfg.Production(PP, []), cfg.Production(PP, ['up', 'over', NP]), cfg.Production(NP, ['I']), cfg.Production(Det, ['the']), cfg.Production(Det, ['a']), cfg.Production(N, ['man']), cfg.Production(V, ['saw']), cfg.Production(P, ['in']), cfg.Production(P, ['with']), cfg.Production(N, ['park']), cfg.Production(N, ['dog']), cfg.Production(N, ['statue']), cfg.Production(Det, ['my']), |
productions = ( cfg.Production(S, [NP, VP]), cfg.Production(NP, [Det, N]), cfg.Production(NP, [NP, PP]), cfg.Production(VP, [VP, PP]), cfg.Production(VP, [V, NP, PP]), cfg.Production(VP, [V, NP]), cfg.Production(PP, [P, NP]), cfg.Production(PP, []), cfg.Production(PP, ['up', 'over', NP]), cfg.Production(NP, ['I']), cfg.Production(Det, ['the']), cfg.Production(Det, ['a']), cfg.Production(N, ['man']), cfg.Production(V, ['saw']), cfg.Production(P, ['in']), cfg.Production(P, ['with']), cfg.Production(N, ['park']), cfg.Production(N, ['dog']), cfg.Production(N, ['statue']), cfg.Production(Det, ['my']), |
Clone # 111
Anti-unification distance between two trees = 4
Total size of two trees = 51
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/indian.py" The first line is 32 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/indian.py" The first line is 36 | |
|
def words(self, files=None): return concat([IndianCorpusView(filename, False, False) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([IndianCorpusView(filename, True, False) for filename in self.abspaths(files)]) |
|
|
def tagged_words(self, files=None): return concat([IndianCorpusView(filename, True, False) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([IndianCorpusView(filename, False, True) for filename in self.abspaths(files)]) |
Clone # 112
Anti-unification distance between two trees = 4
Total size of two trees = 51
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/conll.py" The first line is 31 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/conll.py" The first line is 35 | |
|
def words(self, files=None): return concat([ConllChunkCorpusView(filename, False, False, False) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([ConllChunkCorpusView(filename, False, True, False) for filename in self.abspaths(files)]) |
|
|
def sents(self, files=None): return concat([ConllChunkCorpusView(filename, False, True, False) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([ConllChunkCorpusView(filename, True, False, False) for filename in self.abspaths(files)]) |
Clone # 113
Anti-unification distance between two trees = 3
Total size of two trees = 51
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/conll.py" The first line is 31 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/conll.py" The first line is 39 | |
|
def words(self, files=None): return concat([ConllChunkCorpusView(filename, False, False, False) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([ConllChunkCorpusView(filename, True, False, False) for filename in self.abspaths(files)]) |
|
|
def sents(self, files=None): return concat([ConllChunkCorpusView(filename, False, True, False) for filename in self.abspaths(files)]) |
def tagged_sents(self, files=None): return concat([ConllChunkCorpusView(filename, True, True, False) for filename in self.abspaths(files)]) |
Clone # 114
Anti-unification distance between two trees = 0
Total size of two trees = 50
Total length of sequences = 12
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/pchart.py" The first line is 455 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/viterbi.py" The first line is 398 | |
| print 'Draw parses (y/n)? ', | print 'Draw parses (y/n)? ', | |
|
if sys.stdin.readline().strip().lower().startswith('y'): from nltk.draw.tree import draw_trees print ' please wait...' draw_trees(*parses) |
if sys.stdin.readline().strip().lower().startswith('y'): from nltk.draw.tree import draw_trees print ' please wait...' draw_trees(*parses) |
|
| print 'Print parses (y/n)? ', | print 'Print parses (y/n)? ', | |
|
if sys.stdin.readline().strip().lower().startswith('y'): for parse in parses: print parse |
if sys.stdin.readline().strip().lower().startswith('y'): for parse in parses: print parse |
Clone # 115
Anti-unification distance between two trees = 4
Total size of two trees = 50
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 191 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 207 | |
| self._top.bind('b', self.backtrack) | self._top.bind('', self.undo) | |
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 116
Anti-unification distance between two trees = 4
Total size of two trees = 50
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/propbank.py" The first line is 231 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/propbank.py" The first line is 242 | |
|
class PropbankChainTreePointer(object): def __init__(self, pieces): self.pieces = pieces def __str__(self): return '*'.join('%s' % p for p in self.pieces) def __repr__(self): return ' def select(self, tree): if tree is None: raise ValueError('Parse tree not avaialable') return Tree('*CHAIN*', [p.select(tree) for p in self.pieces]) |
class PropbankSplitTreePointer(object): def __init__(self, pieces): self.pieces = pieces def __str__(self): return ','.join('%s' % p for p in self.pieces) def __repr__(self): return ' def select(self, tree): if tree is None: raise ValueError('Parse tree not avaialable') return Tree('*SPLIT*', [p.select(tree) for p in self.pieces]) |
Clone # 117
Anti-unification distance between two trees = 3
Total size of two trees = 50
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/indian.py" The first line is 32 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/indian.py" The first line is 40 | |
|
def words(self, files=None): return concat([IndianCorpusView(filename, False, False) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([IndianCorpusView(filename, False, True) for filename in self.abspaths(files)]) |
|
|
def tagged_words(self, files=None): return concat([IndianCorpusView(filename, True, False) for filename in self.abspaths(files)]) |
def tagged_sents(self, files=None): return concat([IndianCorpusView(filename, True, True) for filename in self.abspaths(files)]) |
Clone # 118
Anti-unification distance between two trees = 4
Total size of two trees = 49
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/relextract.py" The first line is 153 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/relextract.py" The first line is 157 | |
| reldict['subjclass'] = pairs[0][1].node | reldict['objclass'] = pairs[1][1].node | |
| reldict['subjtext'] = _join(pairs[0][1].leaves()) | reldict['objtext'] = _join(pairs[1][1].leaves()) | |
| reldict['subjsym'] = list2sym(pairs[0][1].leaves()) | reldict['objsym'] = list2sym(pairs[1][1].leaves()) |
Clone # 119
Anti-unification distance between two trees = 2
Total size of two trees = 49
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/synset.py" The first line is 665 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/wordnet/synset.py" The first line is 661 | |
| abstract_entity = wordnet.N["abstract entity"] | entity = wordnet.N["entity"] | |
| print abstract_entity, abstract_entity[0] | print entity, entity[0] | |
| print abstract_entity[0][wordnet.HYPONYM] | print entity[0][wordnet.HYPONYM] | |
| pprint(abstract_entity[0].tree(wordnet.HYPONYM, depth=1), indent=4) | pprint(entity[0].tree(wordnet.HYPONYM, depth=1), indent=4) |
Clone # 120
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 729 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 734 | |
|
def parsed_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_sent_block) for filename in self.abspaths(files)]) |
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
|
|
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_sent_block) for filename in self.abspaths(files)]) |
Clone # 121
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 739 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 744 | |
|
def sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_sent_block) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
|
|
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_word_block) for filename in self.abspaths(files)]) |
Clone # 122
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 729 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 739 | |
|
def parsed_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_sent_block) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_sent_block) for filename in self.abspaths(files)]) |
|
|
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
Clone # 123
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 739 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ieer.py" The first line is 70 | |
|
def sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_sent_block) for filename in self.abspaths(files)]) |
def docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_block) for filename in self.abspaths(files)]) |
|
|
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
def parsed_docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_block) for filename in self.abspaths(files)]) |
Clone # 124
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 734 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ieer.py" The first line is 70 | |
|
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
def docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_block) for filename in self.abspaths(files)]) |
|
|
def sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_sent_block) for filename in self.abspaths(files)]) |
def parsed_docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_block) for filename in self.abspaths(files)]) |
Clone # 125
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 729 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 744 | |
|
def parsed_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_sent_block) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
|
|
def tagged_sents(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_sent_block) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_word_block) for filename in self.abspaths(files)]) |
Clone # 126
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ieer.py" The first line is 70 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/util.py" The first line is 744 | |
|
def docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_block) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_tagged_word_block) for filename in self.abspaths(files)]) |
|
|
def parsed_docs(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_parsed_block) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([StreamBackedCorpusView(filename, self._read_word_block) for filename in self.abspaths(files)]) |
Clone # 127
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 312 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 247 | |
|
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
|
| self._jmin = min(vals) | self._jmin = min(self._vals) | |
| self._jmax = max(vals) | self._jmax = max(self._vals) | |
|
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
Clone # 128
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 552 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 247 | |
|
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
if self._imax == self._imin: self._imin -= 1 self._imax += 1 |
|
| self._jmin = min(vals) | self._jmin = min(self._vals) | |
| self._jmax = max(vals) | self._jmax = max(self._vals) | |
|
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
if self._jmax == self._jmin: self._jmin -= 1 self._jmax += 1 |
Clone # 129
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1000 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def start(*args, **kw): return the_coverage.start(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
Clone # 130
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1012 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
Clone # 131
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1021 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1024 | |
|
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def report(*args, **kw): return the_coverage.report(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
|
|
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
def annotate_file(*args, **kw): return the_coverage.annotate_file(*args, **kw) |
Clone # 132
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1003 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
Clone # 133
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1015 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
Clone # 134
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1006 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
Clone # 135
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1018 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
Clone # 136
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
Clone # 137
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1021 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
Clone # 138
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1012 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
Clone # 139
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1024 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
|
|
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
def annotate_file(*args, **kw): return the_coverage.annotate_file(*args, **kw) |
Clone # 140
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1015 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
Clone # 141
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1018 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def analysis(*args, **kw): return the_coverage.analysis(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
Clone # 142
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1021 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
Clone # 143
Anti-unification distance between two trees = 4
Total size of two trees = 48
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 997 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1024 | |
|
def use_cache(*args, **kw): return the_coverage.use_cache(*args, **kw) |
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
|
|
def start(*args, **kw): return the_coverage.start(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def stop(*args, **kw): return the_coverage.stop(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
|
|
def erase(*args, **kw): return the_coverage.erase(*args, **kw) |
def annotate_file(*args, **kw): return the_coverage.annotate_file(*args, **kw) |
Clone # 144
Anti-unification distance between two trees = 0
Total size of two trees = 48
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 584 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 631 | |
|
def _toggle_grammar(self, *e): if self._show_grammar.get(): self._prodframe.pack(fill='both', side='left', padx=2, after=self._feedbackframe) self._lastoper1['text'] = 'Show Grammar' self._prodframe.pack_forget() self._lastoper1['text'] = 'Hide Grammar' self._lastoper2['text'] = '' |
def _toggle_grammar(self, *e): if self._show_grammar.get(): self._prodframe.pack(fill='both', side='left', padx=2, after=self._feedbackframe) self._lastoper1['text'] = 'Show Grammar' self._prodframe.pack_forget() self._lastoper1['text'] = 'Hide Grammar' self._lastoper2['text'] = '' |
Clone # 145
Anti-unification distance between two trees = 1
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/plaintext.py" The first line is 125 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/wordlist.py" The first line is 27 | |
|
@deprecated("Use .raw() or .words() instead.") def read(self, items=None, format='tokenized'): if format == 'raw': return self.raw(items) if format == 'tokenized': return self.words(items) raise ValueError('bad format %r' % format) |
@deprecated("Use .raw() or .words() instead.") def read(self, items=None, format='listed'): if format == 'raw': return self.raw(items) if format == 'listed': return self.words(items) raise ValueError('bad format %r' % format) |
|
|
@deprecated("Use .words() instead.") def tokenized(self, items=None): return self.words(items) |
@deprecated("Use .words() instead.") def listed(self, items=None): return self.words(items) |
Clone # 146
Anti-unification distance between two trees = 3
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 281 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 272 | |
| (x1, y1, x2, y2) = self._subtrees[i].bbox() | (x1, y1, x2, y2) = self._subtrees[i].bbox() | |
|
if x < x2: self._subtrees[i].move(x-x2, 0) x -= x2-x1 + self._xspace moved.append(self._subtrees[i]) |
if x > x1: self._subtrees[i].move(x-x1, 0) x += x2-x1 + self._xspace moved.append(self._subtrees[i]) |
Clone # 147
Anti-unification distance between two trees = 3
Total size of two trees = 48
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 323 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/tree.py" The first line is 314 | |
| (x1, y1, x2, y2) = self._subtrees[i].bbox() | (x1, y1, x2, y2) = self._subtrees[i].bbox() | |
|
if y < y2: self._subtrees[i].move(0, y-y2) y -= y2-y1 + self._yspace moved.append(self._subtrees[i]) |
if y > y1: self._subtrees[i].move(0, y-y1) y += y2-y1 + self._yspace moved.append(self._subtrees[i]) |
Clone # 148
Anti-unification distance between two trees = 3
Total size of two trees = 46
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py" The first line is 1545 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py" The first line is 1554 | |
|
if choice in ('1', '5'): cp = ChartParser(grammar, TD_STRATEGY, trace=2) t = time.time() parses = cp.nbest_parse(tokens) times['top down'] = time.time()-t assert len(parses)==5, 'Not all parses found' for tree in parses: print tree |
if choice in ('2', '5'): cp = ChartParser(grammar, BU_STRATEGY, trace=2) t = time.time() parses = cp.nbest_parse(tokens) times['bottom up'] = time.time()-t assert len(parses)==5, 'Not all parses found' for tree in parses: print tree |
Clone # 149
Anti-unification distance between two trees = 4
Total size of two trees = 44
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 341 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 643 | |
|
Tkinter.Button(buttons, text='Print All', command=self.print_all).pack(side='left') |
Tkinter.Button(buttons, text='Union', command=self._union).pack(side='left') |
|
|
Tkinter.Button(buttons, text='Print Selection', command=self.print_selection).pack(side='left') |
Tkinter.Button(buttons, text='Difference', command=self._difference).pack(side='left') |
Clone # 150
Anti-unification distance between two trees = 4
Total size of two trees = 44
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 641 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 643 | |
|
Tkinter.Button(buttons, text='Intersection', command=self._intersection).pack(side='left') |
Tkinter.Button(buttons, text='Union', command=self._union).pack(side='left') |
|
|
Tkinter.Button(buttons, text='Union', command=self._union).pack(side='left') |
Tkinter.Button(buttons, text='Difference', command=self._difference).pack(side='left') |
Clone # 151
Anti-unification distance between two trees = 4
Total size of two trees = 44
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 341 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 641 | |
|
Tkinter.Button(buttons, text='Print All', command=self.print_all).pack(side='left') |
Tkinter.Button(buttons, text='Intersection', command=self._intersection).pack(side='left') |
|
|
Tkinter.Button(buttons, text='Print Selection', command=self.print_selection).pack(side='left') |
Tkinter.Button(buttons, text='Union', command=self._union).pack(side='left') |
Clone # 152
Anti-unification distance between two trees = 3
Total size of two trees = 44
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1426 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1419 | |
| (x1, y1, x2, y2) = self._children[i].bbox() | (x1, y1, x2, y2) = self._children[i].bbox() | |
|
if y < y2: self._children[i].move(0, y-y2) y -= y2-y1 + self._space |
if y > y1: self._children[i].move(0, y-y1) y += y2-y1 + self._space |
Clone # 153
Anti-unification distance between two trees = 3
Total size of two trees = 44
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1269 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/__init__.py" The first line is 1262 | |
| (x1, y1, x2, y2) = self._children[i].bbox() | (x1, y1, x2, y2) = self._children[i].bbox() | |
|
if x < x2: self._children[i].move(x-x2, 0) x -= x2-x1 + self._space |
if x > x1: self._children[i].move(x-x1, 0) x += x2-x1 + self._space |
Clone # 154
Anti-unification distance between two trees = 0
Total size of two trees = 42
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 775 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 705 | |
| from nltk import cfg | from nltk import cfg | |
| nonterminals = 'S VP NP PP P N Name V Det' | nonterminals = 'S VP NP PP P N Name V Det' | |
|
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
Clone # 155
Anti-unification distance between two trees = 0
Total size of two trees = 42
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 775 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 669 | |
| from nltk import cfg | from nltk import cfg | |
| nonterminals = 'S VP NP PP P N Name V Det' | nonterminals = 'S VP NP PP P N Name V Det' | |
|
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
Clone # 156
Anti-unification distance between two trees = 0
Total size of two trees = 42
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 705 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 669 | |
| from nltk import cfg | from nltk import cfg | |
| nonterminals = 'S VP NP PP P N Name V Det' | nonterminals = 'S VP NP PP P N Name V Det' | |
|
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
(S, VP, NP, PP, P, N, Name, V, Det) = [cfg.Nonterminal(s) for s in nonterminals.split()] |
Clone # 157
Anti-unification distance between two trees = 4
Total size of two trees = 42
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py" The first line is 1160 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/chart.py" The first line is 1050 | |
| NUM_EDGES = 1 | NUM_EDGES = 1 | |
|
def apply_iter(self, chart, grammar, edge): if edge.is_incomplete(): return for prod in grammar.productions(rhs=edge.lhs()): new_edge = TreeEdge.from_production(prod, edge.start()) if chart.insert(new_edge, ()): yield new_edge |
def apply_iter(self, chart, grammar, edge): if edge.is_complete(): return for prod in grammar.productions(lhs=edge.next()): new_edge = TreeEdge.from_production(prod, edge.end()) if chart.insert(new_edge, ()): yield new_edge |
Clone # 158
Anti-unification distance between two trees = 4
Total size of two trees = 42
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 461 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/sem/logic.py" The first line is 492 | |
|
class LambdaExpression(VariableBinderExpression): PREFIX = '\\' def _skolemise(self, bound_vars, counter): bv = bound_vars.copy() bv.add(self.variable) return self.__class__(self.variable, self.term._skolemise(bv, counter)) def __repr__(self): return "LambdaExpression('%s', '%s')" % (self.variable, self.term) |
class AllExpression(VariableBinderExpression): PREFIX = 'all ' def _skolemise(self, bound_vars, counter): bv = bound_vars.copy() bv.add(self.variable) return self.__class__(self.variable, self.term._skolemise(bv, counter)) def __repr__(self): return "AllExpression('%s', '%s')" % (self.variable, self.term) |
Clone # 159
Anti-unification distance between two trees = 3
Total size of two trees = 40
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 319 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 323 | |
|
def _attempt_proof_n_all(current, agenda, accessible_vars, atoms, debug=(False, 0)): agenda[Categories.SOME].add(SomeExpression(current.second.variable, negate(current.second.term))) return _attempt_proof(agenda, accessible_vars, atoms, (debug[0], debug[1]+1)) |
def _attempt_proof_n_some(current, agenda, accessible_vars, atoms, debug=(False, 0)): agenda[Categories.ALL].add(AllExpression(current.second.variable, negate(current.second.term))) return _attempt_proof(agenda, accessible_vars, atoms, (debug[0], debug[1]+1)) |
Clone # 160
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 455 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 453 | |
|
def __setslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __setitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __delitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __setslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __delslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __delitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __iadd__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __delslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
Clone # 161
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 457 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 453 | |
|
def __delitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __setitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __delslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __setslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __iadd__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __delitem__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def __imul__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __delslice__(self): raise ValueError, 'ImmutableTrees may not be modified' |
Clone # 162
Anti-unification distance between two trees = 3
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 182 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 193 | |
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Escape>', self.destroy) | self._top.bind('<Alt-q>', self.destroy) | |
| self._top.bind('e', self.expand) |
self._top.bind(' |
Clone # 163
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 207 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 208 | |
| self._top.bind('<u>', self.undo) | self._top.bind('<Alt-u>', self.undo) | |
| self._top.bind('<Alt-u>', self.undo) | self._top.bind('<Control-u>', self.undo) | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Control-z>', self.undo) | self._top.bind('<BackSpace>', self.undo) |
Clone # 164
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 192 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 191 | |
|
self._top.bind(' |
self._top.bind('b', self.backtrack) | |
| self._top.bind('<Control-b>', self.backtrack) | self._top.bind('<Alt-b>', self.backtrack) | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<BackSpace>', self.backtrack) | self._top.bind('<Control-z>', self.backtrack) |
Clone # 165
Anti-unification distance between two trees = 3
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 199 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 193 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Alt-q>', self._cancel) | self._top.bind('<Control-x>', self.destroy) | |
| self._top.bind('<Control-d>', self._cancel) | self._top.bind('<Alt-q>', self.destroy) | |
|
self._top.bind(' |
self._top.bind(' |
Clone # 166
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 199 | |
| self._top.bind('<Alt-q>', self._cancel) | self._top.bind('<Control-q>', self._cancel) | |
| self._top.bind('<Control-d>', self._cancel) | self._top.bind('<Alt-q>', self._cancel) | |
| self._top.bind('<Alt-x>', self._cancel) | self._top.bind('<Control-d>', self._cancel) | |
| self._top.bind('<Escape>', self._cancel) | self._top.bind('<Alt-x>', self._cancel) |
Clone # 167
Anti-unification distance between two trees = 4
Total size of two trees = 40
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 201 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/cfg.py" The first line is 199 | |
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Escape>', self._cancel) | self._top.bind('<Control-d>', self._cancel) | |
|
self._top.bind(' |
self._top.bind(' |
Clone # 168
Anti-unification distance between two trees = 2
Total size of two trees = 38
Total length of sequences = 10
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/util.py" The first line is 231 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/classify/util.py" The first line is 284 | |
| print 'Training classifier...' | print 'Training classifier...' | |
| classifier = trainer( [(features(n), g) for (n,g) in train] ) | classifier = trainer( [(features(i), l) for (i,l) in train] ) | |
| print 'Testing classifier...' | print 'Testing classifier...' | |
| acc = accuracy(classifier, [(features(n),g) for (n,g) in test]) | acc = accuracy(classifier, [(features(i),l) for (i,l) in test]) | |
| print 'Accuracy: %6.4f' % acc | print 'Accuracy: %6.4f' % acc |
Clone # 169
Anti-unification distance between two trees = 3
Total size of two trees = 38
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 1503 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 1475 | |
|
def __new__(cls, values): values = _flatten(values, FeatureValueConcat) if sum(isinstance(v, Variable) for v in values) == 0: values = _flatten(values, FeatureValueTuple) return FeatureValueTuple(values) if len(values) == 1: return list(values)[0] return tuple.__new__(cls, values) |
def __new__(cls, values): values = _flatten(values, FeatureValueUnion) if sum(isinstance(v, Variable) for v in values) == 0: values = _flatten(values, FeatureValueSet) return FeatureValueSet(values) if len(values) == 1: return list(values)[0] return frozenset.__new__(cls, values) |
Clone # 170
Anti-unification distance between two trees = 2
Total size of two trees = 38
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 550 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 584 | |
|
def about(self, *e): ABOUT = ("NLTK Shift-Reduce Parser Demo\n"+ "Written by Edward Loper") TITLE = 'About: Shift-Reduce Parser Demo' try: from tkMessageBox import Message Message(message=ABOUT, title=TITLE).show() ShowText(self._top, TITLE, ABOUT) |
def about(self, *e): ABOUT = ("NLTK Recursive Descent Parser Demo\n"+ "Written by Edward Loper") TITLE = 'About: Recursive Descent Parser Demo' try: from tkMessageBox import Message Message(message=ABOUT, title=TITLE).show() ShowText(self._top, TITLE, ABOUT) |
Clone # 171
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 625 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 571 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '{\g |
Clone # 172
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 625 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 518 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, r'\g |
Clone # 173
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 625 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 464 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
Clone # 174
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 571 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 518 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '{\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, r'\g |
Clone # 175
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 571 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 464 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '{\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
Clone # 176
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 518 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 464 | |
|
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, r'\g |
def __init__(self, left_tag_pattern, right_tag_pattern, descr): self._left_tag_pattern = left_tag_pattern self._right_tag_pattern = right_tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(left_tag_pattern), tag_pattern2re_pattern(right_tag_pattern))) RegexpChunkRule.__init__(self, regexp, '\g |
Clone # 177
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py" The first line is 115 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/ycoe.py" The first line is 113 | |
|
def tagged_paras(self, documents=None): return self._pos_reader.tagged_paras(self._getfiles(documents, 'pos')) |
def tagged_sents(self, documents=None): return self._pos_reader.tagged_sents(self._getfiles(documents, 'pos')) |
|
|
def parsed_sents(self, documents=None): return self._psd_reader.parsed_sents(self._getfiles(documents, 'psd')) |
def tagged_paras(self, documents=None): return self._pos_reader.tagged_paras(self._getfiles(documents, 'pos')) |
Clone # 178
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 382 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/chunk/regexp.py" The first line is 340 | |
|
def __init__(self, tag_pattern, descr): self._pattern = tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(tag_pattern), ChunkString.IN_CHUNK_PATTERN)) RegexpChunkRule.__init__(self, regexp, '}\g |
def __init__(self, tag_pattern, descr): self._pattern = tag_pattern regexp = re.compile('(?P (tag_pattern2re_pattern(tag_pattern), ChunkString.IN_CHINK_PATTERN)) RegexpChunkRule.__init__(self, regexp, '{\g |
Clone # 179
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1021 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1027 | |
|
def analysis2(*args, **kw): return the_coverage.analysis2(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def analysis3(*args, **kw): return the_coverage.analysis3(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
|
|
def report(*args, **kw): return the_coverage.report(*args, **kw) |
def annotate_file(*args, **kw): return the_coverage.annotate_file(*args, **kw) |
Clone # 180
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1009 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/test/coverage.py" The first line is 1027 | |
|
def begin_recursive(*args, **kw): return the_coverage.begin_recursive(*args, **kw) |
def report(*args, **kw): return the_coverage.report(*args, **kw) |
|
|
def end_recursive(*args, **kw): return the_coverage.end_recursive(*args, **kw) |
def annotate(*args, **kw): return the_coverage.annotate(*args, **kw) |
|
|
def exclude(*args, **kw): return the_coverage.exclude(*args, **kw) |
def annotate_file(*args, **kw): return the_coverage.annotate_file(*args, **kw) |
Clone # 181
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 181 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 183 | |
| text = re.sub(r'<{([^}]+)}>', r'\1', text) | text = re.sub(r'<(@|/?p)>', r'', text) | |
| text = re.sub(r'<(@|/?p)>', r'', text) | text = re.sub(r'<&\w+ \.>', r'', text) | |
| text = re.sub(r'<&\w+ \.>', r'', text) | text = re.sub(r'<!DOCTYPE[^>]*>', r'', text) |
Clone # 182
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 179 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 183 | |
| text = re.sub(r'<\&I[^>]*>', '', text) | text = re.sub(r'<(@|/?p)>', r'', text) | |
| text = re.sub(r'<{([^}]+)}>', r'\1', text) | text = re.sub(r'<&\w+ \.>', r'', text) | |
| text = re.sub(r'<(@|/?p)>', r'', text) | text = re.sub(r'<!DOCTYPE[^>]*>', r'', text) |
Clone # 183
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 185 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 189 | |
| text = re.sub(r'<&\w+ \.>', r'', text) | text = re.sub(r'<\[\/?[^>]+\]*>', r'', text) | |
| text = re.sub(r'<!DOCTYPE[^>]*>', r'', text) | text = re.sub(r'<(\&\w+;)>', r'\1', text) | |
| text = re.sub(r'<\[\/?[^>]+\]*>', r'', text) | text = re.sub(r'&(?!amp|gt|lt|apos|quot)', r'', text) |
Clone # 184
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 179 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 185 | |
| text = re.sub(r'<\&I[^>]*>', '', text) | text = re.sub(r'<&\w+ \.>', r'', text) | |
| text = re.sub(r'<{([^}]+)}>', r'\1', text) | text = re.sub(r'<!DOCTYPE[^>]*>', r'', text) | |
| text = re.sub(r'<(@|/?p)>', r'', text) | text = re.sub(r'<\[\/?[^>]+\]*>', r'', text) |
Clone # 185
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 177 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/senseval.py" The first line is 187 | |
|
text = re.sub(r'<\&frasl>\s* |
text = re.sub(r'<!DOCTYPE[^>]*>', r'', text) | |
| text = re.sub(r'<\&I[^>]*>', '', text) | text = re.sub(r'<\[\/?[^>]+\]*>', r'', text) | |
| text = re.sub(r'<{([^}]+)}>', r'\1', text) | text = re.sub(r'<(\&\w+;)>', r'\1', text) |
Clone # 186
Anti-unification distance between two trees = 2
Total size of two trees = 36
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 203 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 200 | |
|
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
def tagged_words(self, files=None, categories=None): return TaggedCorpusReader.tagged_words( self, self._resolve(files, categories)) |
|
|
def tagged_paras(self, files=None, categories=None): return TaggedCorpusReader.tagged_paras( self, self._resolve(files, categories)) |
def tagged_sents(self, files=None, categories=None): return TaggedCorpusReader.tagged_sents( self, self._resolve(files, categories)) |
Clone # 187
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 88 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 75 | |
|
def paras(self, files=None): return concat([TaggedCorpusView(filename, False, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([TaggedCorpusView(filename, False, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 188
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 101 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 88 | |
|
def tagged_words(self, files=None): return concat([TaggedCorpusView(filename, True, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def paras(self, files=None): return concat([TaggedCorpusView(filename, False, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 189
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 114 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 101 | |
|
def tagged_sents(self, files=None): return concat([TaggedCorpusView(filename, True, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([TaggedCorpusView(filename, True, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 190
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 101 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 75 | |
|
def tagged_words(self, files=None): return concat([TaggedCorpusView(filename, True, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([TaggedCorpusView(filename, False, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 191
Anti-unification distance between two trees = 4
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 114 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 88 | |
|
def tagged_sents(self, files=None): return concat([TaggedCorpusView(filename, True, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def paras(self, files=None): return concat([TaggedCorpusView(filename, False, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 192
Anti-unification distance between two trees = 3
Total size of two trees = 36
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 114 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 75 | |
|
def tagged_sents(self, files=None): return concat([TaggedCorpusView(filename, True, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([TaggedCorpusView(filename, False, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 193
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 75 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 63 | |
|
def sents(self, files=None): return concat([TaggedCorpusView(filename, False, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([TaggedCorpusView(filename, False, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 194
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 127 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 114 | |
|
def tagged_paras(self, files=None): return concat([TaggedCorpusView(filename, True, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def tagged_sents(self, files=None): return concat([TaggedCorpusView(filename, True, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 195
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 88 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 63 | |
|
def paras(self, files=None): return concat([TaggedCorpusView(filename, False, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([TaggedCorpusView(filename, False, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 196
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 127 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 101 | |
|
def tagged_paras(self, files=None): return concat([TaggedCorpusView(filename, True, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def tagged_words(self, files=None): return concat([TaggedCorpusView(filename, True, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 197
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 101 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 63 | |
|
def tagged_words(self, files=None): return concat([TaggedCorpusView(filename, True, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([TaggedCorpusView(filename, False, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 198
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 127 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 88 | |
|
def tagged_paras(self, files=None): return concat([TaggedCorpusView(filename, True, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def paras(self, files=None): return concat([TaggedCorpusView(filename, False, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 199
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 114 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 63 | |
|
def tagged_sents(self, files=None): return concat([TaggedCorpusView(filename, True, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def words(self, files=None): return concat([TaggedCorpusView(filename, False, False, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 200
Anti-unification distance between two trees = 3
Total size of two trees = 35
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 127 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/tagged.py" The first line is 75 | |
|
def tagged_paras(self, files=None): return concat([TaggedCorpusView(filename, True, True, True, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
def sents(self, files=None): return concat([TaggedCorpusView(filename, False, True, False, self._sep, self._word_tokenizer, self._sent_tokenizer, self._para_block_reader) for filename in self.abspaths(files)]) |
Clone # 201
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 2105 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 570 | |
|
def edit_sentence(self, *e): sentence = string.join(self._tokens) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._root, sentence, instr, self.set_sentence, title) |
def edit_sentence(self, *e): sentence = string.join(self._sent) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._top, sentence, instr, self.set_sentence, title) |
Clone # 202
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 856 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 2105 | |
|
def edit_sentence(self, *e): sentence = string.join(self._sent) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._top, sentence, instr, self.set_sentence, title) |
def edit_sentence(self, *e): sentence = string.join(self._tokens) title = 'Edit Text' instr = 'Enter a new sentence to parse.' EntryDialog(self._root, sentence, instr, self.set_sentence, title) |
Clone # 203
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 813 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 814 | |
| __delitem__ = check_frozen(list.__delitem__) | __setitem__ = check_frozen(list.__setitem__) | |
| __setitem__ = check_frozen(list.__setitem__) | __delslice__ = check_frozen(list.__delslice__) | |
| __delslice__ = check_frozen(list.__delslice__) | __setslice__ = check_frozen(list.__setslice__) | |
| __setslice__ = check_frozen(list.__setslice__) | __iadd__ = check_frozen(list.__iadd__) |
Clone # 204
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 818 | |
| __iadd__ = check_frozen(list.__iadd__) | __imul__ = check_frozen(list.__imul__) | |
| __imul__ = check_frozen(list.__imul__) | append = check_frozen(list.append) | |
| append = check_frozen(list.append) | extend = check_frozen(list.extend) | |
| extend = check_frozen(list.extend) | insert = check_frozen(list.insert) |
Clone # 205
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 821 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 822 | |
| insert = check_frozen(list.insert) | pop = check_frozen(list.pop) | |
| pop = check_frozen(list.pop) | remove = check_frozen(list.remove) | |
| remove = check_frozen(list.remove) | reverse = check_frozen(list.reverse) | |
| reverse = check_frozen(list.reverse) | sort = check_frozen(list.sort) |
Clone # 206
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 813 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 815 | |
| __delitem__ = check_frozen(list.__delitem__) | __delslice__ = check_frozen(list.__delslice__) | |
| __setitem__ = check_frozen(list.__setitem__) | __setslice__ = check_frozen(list.__setslice__) | |
| __delslice__ = check_frozen(list.__delslice__) | __iadd__ = check_frozen(list.__iadd__) | |
| __setslice__ = check_frozen(list.__setslice__) | __imul__ = check_frozen(list.__imul__) |
Clone # 207
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 819 | |
| __iadd__ = check_frozen(list.__iadd__) | append = check_frozen(list.append) | |
| __imul__ = check_frozen(list.__imul__) | extend = check_frozen(list.extend) | |
| append = check_frozen(list.append) | insert = check_frozen(list.insert) | |
| extend = check_frozen(list.extend) | pop = check_frozen(list.pop) |
Clone # 208
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 813 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 816 | |
| __delitem__ = check_frozen(list.__delitem__) | __setslice__ = check_frozen(list.__setslice__) | |
| __setitem__ = check_frozen(list.__setitem__) | __iadd__ = check_frozen(list.__iadd__) | |
| __delslice__ = check_frozen(list.__delslice__) | __imul__ = check_frozen(list.__imul__) | |
| __setslice__ = check_frozen(list.__setslice__) | append = check_frozen(list.append) |
Clone # 209
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 820 | |
| __iadd__ = check_frozen(list.__iadd__) | extend = check_frozen(list.extend) | |
| __imul__ = check_frozen(list.__imul__) | insert = check_frozen(list.insert) | |
| append = check_frozen(list.append) | pop = check_frozen(list.pop) | |
| extend = check_frozen(list.extend) | remove = check_frozen(list.remove) |
Clone # 210
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 813 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | |
| __delitem__ = check_frozen(list.__delitem__) | __iadd__ = check_frozen(list.__iadd__) | |
| __setitem__ = check_frozen(list.__setitem__) | __imul__ = check_frozen(list.__imul__) | |
| __delslice__ = check_frozen(list.__delslice__) | append = check_frozen(list.append) | |
| __setslice__ = check_frozen(list.__setslice__) | extend = check_frozen(list.extend) |
Clone # 211
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 821 | |
| __iadd__ = check_frozen(list.__iadd__) | insert = check_frozen(list.insert) | |
| __imul__ = check_frozen(list.__imul__) | pop = check_frozen(list.pop) | |
| append = check_frozen(list.append) | remove = check_frozen(list.remove) | |
| extend = check_frozen(list.extend) | reverse = check_frozen(list.reverse) |
Clone # 212
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 813 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 818 | |
| __delitem__ = check_frozen(list.__delitem__) | __imul__ = check_frozen(list.__imul__) | |
| __setitem__ = check_frozen(list.__setitem__) | append = check_frozen(list.append) | |
| __delslice__ = check_frozen(list.__delslice__) | extend = check_frozen(list.extend) | |
| __setslice__ = check_frozen(list.__setslice__) | insert = check_frozen(list.insert) |
Clone # 213
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 817 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/featstruct.py" The first line is 822 | |
| __iadd__ = check_frozen(list.__iadd__) | pop = check_frozen(list.pop) | |
| __imul__ = check_frozen(list.__imul__) | remove = check_frozen(list.remove) | |
| append = check_frozen(list.append) | reverse = check_frozen(list.reverse) | |
| extend = check_frozen(list.extend) | sort = check_frozen(list.sort) |
Clone # 214
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 8
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/brill.py" The first line is 928 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/corpus/reader/api.py" The first line is 141 | |
| self._tag_positions = None | self._f2c = None #: file-to-category mapping | |
| self._rules_by_position = None | self._c2f = None #: category-to-file mapping | |
| self._positions_by_rule = None | self._pattern = None #: regexp specifying the mapping | |
| self._rules_by_score = None | self._map = None #: dict specifying the mapping |
Clone # 215
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 228 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 225 | |
|
Button(buttonframe, text='Match', underline=0, background='#90f090', foreground='black', command=self.match).pack(side='left') |
Button(buttonframe, text='Expand', underline=0, background='#90f090', foreground='black', command=self.expand).pack(side='left') |
Clone # 216
Anti-unification distance between two trees = 3
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 231 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 228 | |
|
Button(buttonframe, text='Backtrack', underline=0, background='#f0a0a0', foreground='black', command=self.backtrack).pack(side='left') |
Button(buttonframe, text='Match', underline=0, background='#90f090', foreground='black', command=self.match).pack(side='left') |
Clone # 217
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 228 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 234 | |
|
Button(buttonframe, text='Match', underline=0, background='#90f090', foreground='black', command=self.match).pack(side='left') |
Button(buttonframe, text='Shift', underline=0, background='#90f090', foreground='black', command=self.shift).pack(side='left') |
Clone # 218
Anti-unification distance between two trees = 3
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 231 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 237 | |
|
Button(buttonframe, text='Backtrack', underline=0, background='#f0a0a0', foreground='black', command=self.backtrack).pack(side='left') |
Button(buttonframe, text='Reduce', underline=0, background='#90f090', foreground='black', command=self.reduce).pack(side='left') |
Clone # 219
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 237 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 225 | |
|
Button(buttonframe, text='Reduce', underline=0, background='#90f090', foreground='black', command=self.reduce).pack(side='left') |
Button(buttonframe, text='Expand', underline=0, background='#90f090', foreground='black', command=self.expand).pack(side='left') |
Clone # 220
Anti-unification distance between two trees = 3
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 240 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 228 | |
|
Button(buttonframe, text='Undo', underline=0, background='#f0a0a0', foreground='black', command=self.undo).pack(side='left') |
Button(buttonframe, text='Match', underline=0, background='#90f090', foreground='black', command=self.match).pack(side='left') |
Clone # 221
Anti-unification distance between two trees = 2
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 237 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 234 | |
|
Button(buttonframe, text='Reduce', underline=0, background='#90f090', foreground='black', command=self.reduce).pack(side='left') |
Button(buttonframe, text='Shift', underline=0, background='#90f090', foreground='black', command=self.shift).pack(side='left') |
Clone # 222
Anti-unification distance between two trees = 3
Total size of two trees = 32
Total length of sequences = 2
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 240 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 237 | |
|
Button(buttonframe, text='Undo', underline=0, background='#f0a0a0', foreground='black', command=self.undo).pack(side='left') |
Button(buttonframe, text='Reduce', underline=0, background='#90f090', foreground='black', command=self.reduce).pack(side='left') |
Clone # 223
Anti-unification distance between two trees = 4
Total size of two trees = 32
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/containers.py" The first line is 22 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/containers.py" The first line is 21 | |
| def iteritems(self): return iter(sorted(dict.items(self))) | def iterkeys(self): return iter(sorted(dict.keys(self))) | |
| def itervalues(self): return iter(sorted(dict.values(self))) | def iteritems(self): return iter(sorted(dict.items(self))) |
Clone # 224
Anti-unification distance between two trees = 3
Total size of two trees = 31
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 995 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tag/hmm.py" The first line is 968 | |
|
hmm = trainer.train_supervised(sentences[10:200], estimator=lambda fd, bins: LidstoneProbDist(fd, 0.1, bins)) |
hmm = trainer.train_supervised(labelled_sequences[10:], estimator=lambda fd, bins: LidstoneProbDist(fd, 0.1, bins)) |
|
| print 'Training (unsupervised)...' | print 'Testing...' |
Clone # 225
Anti-unification distance between two trees = 3
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 486 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 484 | |
| f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') | f = LogicParser().parse(r'((man x) iff (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| p1 = LogicParser().parse(r'all x.((man x) implies (mortal x))') | f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') |
Clone # 226
Anti-unification distance between two trees = 3
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 486 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/inference/tableau.py" The first line is 482 | |
| f = LogicParser().parse(r'(not ((man x) iff (not (man x))))') | f = LogicParser().parse(r'((man x) implies (man x))') | |
| print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | print '|- %s: %s' % (f.infixify(), Tableau(f).prove()) | |
| p1 = LogicParser().parse(r'all x.((man x) implies (mortal x))') | f = LogicParser().parse(r'((man x) iff (man x))') |
Clone # 227
Anti-unification distance between two trees = 1
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/pchart.py" The first line is 448 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/parse/viterbi.py" The first line is 390 | |
| parses = all_parses.keys() | parses = all_parses.keys() | |
|
if parses: p = reduce(lambda a,b:a+b.prob(), parses, 0)/len(parses) else: p = 0 |
if parses: p = reduce(lambda a,b:a+b.prob(), parses, 0)/len(parses) else: p = 0 |
|
| print '------------------------+------------------------------------------' | print '------------------------------------------' |
Clone # 228
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 92 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 90 | |
|
def __rmul__(self, v): raise TypeError('Tree does not support multiplication') |
def __mul__(self, v): raise TypeError('Tree does not support multiplication') |
|
|
def __add__(self, v): raise TypeError('Tree does not support addition') |
def __rmul__(self, v): raise TypeError('Tree does not support multiplication') |
|
|
def __radd__(self, v): raise TypeError('Tree does not support addition') |
def __add__(self, v): raise TypeError('Tree does not support addition') |
Clone # 229
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 463 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/tree.py" The first line is 461 | |
|
def __imul__(self): raise ValueError, 'ImmutableTrees may not be modified' |
def __iadd__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def append(self, v): raise ValueError, 'ImmutableTrees may not be modified' |
def __imul__(self): raise ValueError, 'ImmutableTrees may not be modified' |
|
|
def extend(self, v): raise ValueError, 'ImmutableTrees may not be modified' |
def append(self, v): raise ValueError, 'ImmutableTrees may not be modified' |
Clone # 230
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 4
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/plot.py" The first line is 630 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/chart.py" The first line is 1916 | |
| menubar.add_cascade(label='Axes', underline=0, menu=axismenu) | menubar.add_cascade(label="Animate", underline=1, menu=animatemenu) | |
| helpmenu = Tkinter.Menu(menubar, tearoff=0) | zoommenu = Tkinter.Menu(menubar, tearoff=0) |
Clone # 231
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 192 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 203 | |
| self._top.bind('<Alt-b>', self.backtrack) | self._top.bind('<r>', self.reduce) | |
| self._top.bind('<Control-b>', self.backtrack) | self._top.bind('<Alt-r>', self.reduce) | |
|
self._top.bind(' |
self._top.bind(' |
Clone # 232
Anti-unification distance between two trees = 3
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 182 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 194 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Control-x>', self.destroy) | self._top.bind('<Alt-q>', self.destroy) | |
| self._top.bind('<Escape>', self.destroy) | self._top.bind('<Alt-x>', self.destroy) |
Clone # 233
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 188 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 200 | |
| self._top.bind('m', self.match) |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 234
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 191 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 203 | |
| self._top.bind('b', self.backtrack) |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 235
Anti-unification distance between two trees = 3
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 193 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 194 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Control-x>', self.destroy) | self._top.bind('<Alt-q>', self.destroy) | |
|
self._top.bind(' |
self._top.bind(' |
Clone # 236
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 199 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 200 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<s>', self.shift) | self._top.bind('<Alt-s>', self.shift) | |
| self._top.bind('<Alt-s>', self.shift) | self._top.bind('<Control-s>', self.shift) |
Clone # 237
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 202 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 203 | |
| self._top.bind('<Control-s>', self.shift) | self._top.bind('<r>', self.reduce) | |
| self._top.bind('<r>', self.reduce) | self._top.bind('<Alt-r>', self.reduce) | |
| self._top.bind('<Alt-r>', self.reduce) | self._top.bind('<Control-r>', self.reduce) |
Clone # 238
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 183 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 182 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Escape>', self.destroy) | self._top.bind('<Control-x>', self.destroy) | |
| self._top.bind('e', self.expand) |
self._top.bind(' |
Clone # 239
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 188 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 185 | |
| self._top.bind('m', self.match) | self._top.bind('e', self.expand) | |
|
self._top.bind(' |
self._top.bind('m', self.match) | |
| self._top.bind('<Control-m>', self.match) | self._top.bind('<Alt-m>', self.match) |
Clone # 240
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 183 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 193 | |
|
self._top.bind(' |
self._top.bind(' |
|
| self._top.bind('<Escape>', self.destroy) | self._top.bind('<Control-x>', self.destroy) | |
| self._top.bind('e', self.expand) |
self._top.bind(' |
Clone # 241
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 193 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 203 | |
| self._top.bind('<Control-b>', self.backtrack) | self._top.bind('<r>', self.reduce) | |
| self._top.bind('<Control-z>', self.backtrack) | self._top.bind('<Alt-r>', self.reduce) | |
| self._top.bind('<BackSpace>', self.backtrack) | self._top.bind('<Control-r>', self.reduce) |
Clone # 242
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 182 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 195 | |
| self._top.bind('<Control-q>', self.destroy) | self._top.bind('<Alt-q>', self.destroy) | |
| self._top.bind('<Control-x>', self.destroy) | self._top.bind('<Alt-x>', self.destroy) | |
| self._top.bind('<Escape>', self.destroy) | self._top.bind('<space>', self.step) |
Clone # 243
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 193 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 195 | |
| self._top.bind('<Control-q>', self.destroy) | self._top.bind('<Alt-q>', self.destroy) | |
| self._top.bind('<Control-x>', self.destroy) | self._top.bind('<Alt-x>', self.destroy) | |
| self._top.bind('<Alt-q>', self.destroy) | self._top.bind('<space>', self.step) |
Clone # 244
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 202 | |
| self._top.bind('<s>', self.shift) | self._top.bind('<Control-s>', self.shift) | |
| self._top.bind('<Alt-s>', self.shift) | self._top.bind('<r>', self.reduce) | |
| self._top.bind('<Control-s>', self.shift) | self._top.bind('<Alt-r>', self.reduce) |
Clone # 245
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 206 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 208 | |
| self._top.bind('<Delete>', self.reset) | self._top.bind('<Alt-u>', self.undo) | |
| self._top.bind('<u>', self.undo) | self._top.bind('<Control-u>', self.undo) | |
| self._top.bind('<Alt-u>', self.undo) | self._top.bind('<Control-z>', self.undo) |
Clone # 246
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 190 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 188 | |
|
self._top.bind(' |
self._top.bind('m', self.match) | |
| self._top.bind('b', self.backtrack) |
self._top.bind(' |
|
| self._top.bind('<Alt-b>', self.backtrack) | self._top.bind('<Control-m>', self.match) |
Clone # 247
Anti-unification distance between two trees = 3
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 193 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 191 | |
|
self._top.bind(' |
self._top.bind('b', self.backtrack) | |
| self._top.bind('<Control-z>', self.backtrack) | self._top.bind('<Alt-b>', self.backtrack) | |
| self._top.bind('<BackSpace>', self.backtrack) | self._top.bind('<Control-b>', self.backtrack) |
Clone # 248
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 191 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 200 | |
| self._top.bind('b', self.backtrack) |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 249
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/rdparser.py" The first line is 193 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 207 | |
| self._top.bind('<Control-b>', self.backtrack) | self._top.bind('<u>', self.undo) | |
| self._top.bind('<Control-z>', self.backtrack) | self._top.bind('<Alt-u>', self.undo) | |
| self._top.bind('<BackSpace>', self.backtrack) | self._top.bind('<Control-u>', self.undo) |
Clone # 250
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 200 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 203 | |
| self._top.bind('<s>', self.shift) | self._top.bind('<r>', self.reduce) | |
|
self._top.bind(' |
self._top.bind(' |
|
|
self._top.bind(' |
self._top.bind(' |
Clone # 251
Anti-unification distance between two trees = 4
Total size of two trees = 30
Total length of sequences = 6
| Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 206 | Source file "/home/peter/clone_digger/nltk-0.9.2/nltk/draw/srparser.py" The first line is 209 | |
| self._top.bind('< |