{"id":443,"date":"2010-03-12T14:10:39","date_gmt":"2010-03-12T20:10:39","guid":{"rendered":"http:\/\/www.tamarziv.com\/itp\/?p=443"},"modified":"2010-03-12T14:41:40","modified_gmt":"2010-03-12T20:41:40","slug":"barneys-regular-depression-not-yet","status":"publish","type":"post","link":"https:\/\/www.tamarziv.com\/itp\/barneys-regular-depression-not-yet\/","title":{"rendered":"Barney’s Regular Depression"},"content":{"rendered":"

to being However,
\nHowever, plans or
\nabate. a Mixed Episode
\nevery a Major Depressive Episode
\nmood to these guilt or are However,
\nduring However, mild However, toxin or Moreover, <\/p>\n

be one’s predict
\npredict these lowed
\nunless an irreversible dementia
\noften a Major Depressive Episode
\nwish of prior fully lowed are predict
\nreview predict self predict being lowed predict<\/p>\n

an other failure
\nfailure aches high
\nreturn an irreversible dementia
\noften an increased appetite
\nthis to areas sense high For failure
\nsales. failure When failure every high feature <\/p>\n

or these objects
\nobjects least to
\nsleep, a Mixed Episode
\nfully a Major Depressive Episode
\nthey to there begin to and objects
\nplays, objects Less objects aches to defects <\/p>\n

an there frustrated.
\nfrustrated. guilt is
\nplans, an irreversible dementia
\nfully an increased appetite
\nalso as child down is for frustrated.
\nthink, frustrated. than frustrated. night is frustrated. <\/p>\n

of chief pauses
\npauses often has
\nbetter a week period
\npains a general medical condition
\nless or Other deny, has the pauses
\nalways pauses with pauses there has focuses <\/p>\n

do often treated,
\ntreated, bowel signs
\nsweets an irreversible dementia
\nsleep a Major Depressive Episode
\nfrom of which toxin signs the treated,
\nsales. treated, from treated, weeks signs depressed, <\/p>\n

of worst grades
\ngrades other and
\nunless a week thought
\nthere an increased appetite
\nhave by would twice and the grades
\nasleep grades than grades these and includes <\/p>\n

be least easily
\neasily early in
\nbetter a Mixed Episode
\nworst an increased appetite
\neat. of there these in and easily
\nhaving easily have easily would in Family <\/p>\n

be manic concentration.
\nconcentration. there to
\nsales. a week period
\nThose a Major Depressive Episode
\nthan a myocardial infarction signs to the concentration.
\nmemory concentration. used concentration. these to exertion. <\/p>\n

at count sadness.
\nsadness. often not
\nbefore an irreversible dementia
\nplans an increased appetite
\nwhen a week thought these not for sadness.
\nrather sadness. away sadness. count not muteness. <\/p>\n

by Those infarction,
\ninfarction, Those abuse
\ndumps” a week period
\nsigns a Major Depressive Episode
\nsick a week thought there abuse and infarction,
\ncases, infarction, that infarction, quite abuse definition, <\/p>\n

or often interpersonal
\ninterpersonal looks or
\nmiddle a week thought
\ntoxin an increased appetite
\nthey a week period bowel or and interpersonal
\ndearly interpersonal with interpersonal one’s or terminal <\/p>\n

to least infarction,
\ninfarction, night one
\nperson a Mixed Episode
\ndrawn a Major Depressive Episode
\ngain a myocardial infarction seeks one for infarction,
\ntoward infarction, food infarction, looks one direction, <\/p>\n

or “down negative
\nnegative fully often
\nduring an irreversible dementia
\nthere a general medical condition
\nmost a Mixed Episode quite often the negative
\nwaking negative some negative often often subjective <\/p>\n

be other pauses
\npauses often be
\nperson a week thought
\nloved a general medical condition
\nwith a week period guilt be the pauses
\nsweets pauses face pauses night be excuses <\/p>\n

no other pains
\npains being week
\nnearly a Mixed Episode
\nworst a Major Depressive Episode
\nhave an irreversible dementia areas week for pains
\nsales. pains mood pains skin, week gains <\/p>\n

in sense Frequently
\nFrequently fully four
\nbecome a week thought
\nsense a Major Depressive Episode
\nSome a myocardial infarction often four the Frequently
\nreturn Frequently mild Frequently which four subsequently <\/p>\n

an about symptoms
\nsymptoms there eat.
\nunable a myocardial infarction
\ndeny, an increased appetite
\nmust a Mixed Episode angry eat. The symptoms
\nbefore symptoms they symptoms tasks eat. symptoms <\/p>\n

Yes, Barney has taken a turn to the worst, now he’s using general expressions to express his depressions, there are three different dictionaries, one is general, the other is set to match the 3 last characters of the word for rhyming sake, the last, is a dictionary of sentences beginning with the letter a, to match the following diagram. <\/p>\n

I love you
\nYou love me
\nwe’re a happy family
\nwith a great big hug
\nand a kiss from me to you
\nwon’t you say you love me too<\/p>\n

3 Words, 1 You, 1 Love
\n3 Words, 1 You, 1 Love, 1 Me
\n4 Words, one We
\n5 Words, with a
\n6 Words, with a
\n7 Words, __ you ___, you love me too [rhymes with you]<\/p>\n

w(z) w(any) w(x)
\nw(x) w(z) w(y)
\nw(any) w(a any*2)
\nwith w(a any*3)
\nand w(a any*2) w(y) to w(x)
\nwon’t w(x) w(any) w(x) w(z) w(y) too-([-3:] of w(y))<\/em>
\n<\/br>
\n<\/br><\/p>\n

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
<\/div><\/td>
import<\/span> sys<\/span>                  # builds dictionary from source text, and replaces words from a different text which start with the same letter<\/span>
\nimport<\/span> random<\/span>
\nimport<\/span> re<\/span>                   # use regular expressions<\/span>
\n
\nsource_alpha =<\/span> dict<\/span>(<\/span>)<\/span>                   # dictionary of all words in first text<\/span>
\nsource_endings =<\/span> dict<\/span>(<\/span>)<\/span>                 # dictionary of all words ending with same 3 letters    <\/span>
\nsource_a =<\/span> dict<\/span>(<\/span>)<\/span>                       # dictionary of all strings beginning with the letter a <\/span>
\n
\nsource_file =<\/span> sys<\/span>.argv<\/span>[<\/span>1<\/span>]<\/span>               # first argument passed on command line, sys.argv[0] will be the name of the script file<\/span>
\n
\nignoreList =<\/span> [<\/span>"),"<\/span>,<\/span> ")."<\/span>,<\/span> "Major"<\/span>,<\/span> "major"<\/span>,<\/span> "("<\/span>,<\/span> "AS)."<\/span>,<\/span> "A3)."<\/span>,<\/span> "A9)."<\/span>,<\/span> "(e.g.,"<\/span>,<\/span> "E)."<\/span>,<\/span> "(i.e.,"<\/span>]<\/span>
\nignoreIndex =<\/span> int<\/span>(<\/span>)<\/span>
\nignoreIndex =<\/span> 0<\/span>
\n
\n# create a dictionary of words from the text<\/span>
\n# read each line from source file; split each line into words; store each<\/span>
\n# word in the source_alpha dictionary, according to which letter it starts with<\/span>
\nfor<\/span> line in<\/span> open<\/span>(<\/span>source_file)<\/span>:          # reading lines from major_dep.txt<\/span>
\n    line =<\/span> line.strip<\/span>(<\/span>)<\/span>
\n    words =<\/span> line.split<\/span>(<\/span>" "<\/span>)<\/span>
\n    for<\/span> word in<\/span> words:                                  # loops through each of the words       <\/span>
\n        if<\/span> len<\/span>(<\/span>word)<\/span> ><\/span> 0<\/span>:                               # check to make sure we have a large word<\/span>
\n            lengthWord =<\/span> len<\/span>(<\/span>word)<\/span>                      # get first letter of word<\/span>
\n                                                        # if we've already seen this number, append to list<\/span>
\n            if<\/span> lengthWord in<\/span> source_alpha: 
\n                source_alpha[<\/span>lengthWord]<\/span>.append<\/span>(<\/span>word)<\/span>   # append word to the value of that number<\/span>
\n            else<\/span>:                                       # looks like {'3':['the','big']...} <\/span>
\n                source_alpha[<\/span>lengthWord]<\/span> =<\/span> [<\/span>word]<\/span>       # specify that a new list is made<\/span>
\n
\n
\nfor<\/span> key in<\/span> source_alpha:                                # go through each key in the dict<\/span>
\n    if<\/span> key ><\/span> 0<\/span>:                                        
\n        for<\/span> regect in<\/span> ignoreList:                       # for each word in regects<\/span>
\n            for<\/span> item in<\/span> source_alpha[<\/span>key]<\/span>:              # itirate through members of list<\/span>
\n                if<\/span> regect ==<\/span> item:                      # if word in list is a regect<\/span>
\n                #   print regect + ' before ' + str(source_alpha[key])<\/span>
\n                    source_alpha[<\/span>key]<\/span>.pop<\/span>(<\/span>source_alpha[<\/span>key]<\/span>.index<\/span>(<\/span>regect)<\/span>)<\/span>  #pop it out of the list<\/span>
\n                #   print regect + ' after ' + str(source_alpha[key])<\/span>
\n
\n#print source_alpha<\/span>
\n
\n# source_alpha will be a dictionary whose keys are strings and whose values<\/span>
\n# are lists.<\/span>
\n# uncomment this to see what the data structure created above looks like<\/span>
\n#print source_alpha<\/span>
\n
\n# source_endings will have values of words that share the same 3 last charecters<\/span>
\nfor<\/span> line in<\/span> open<\/span>(<\/span>source_file)<\/span>:          # reading lines from major_dep.txt<\/span>
\n    line =<\/span> line.strip<\/span>(<\/span>)<\/span>
\n    words =<\/span> line.split<\/span>(<\/span>" "<\/span>)<\/span>
\n    for<\/span> word in<\/span> words:                                  # loops through each of the words       <\/span>
\n        if<\/span> len<\/span>(<\/span>word)<\/span> ><\/span> 4<\/span>:                               # check to make sure we have a large word<\/span>
\n            if<\/span> (<\/span>word !=<\/span> "major"<\/span>)<\/span>:  
\n                ending =<\/span> word[<\/span>-3<\/span>:]<\/span>                          # get the last 3 letters<\/span>
\n                                                            # if we've already seen this number, append to list<\/span>
\n                if<\/span> ending in<\/span> source_endings:   
\n                    if<\/span> word in<\/span> source_endings[<\/span>ending]<\/span>:
\n                        ignore =<\/span> "true"<\/span>
\n                    else<\/span>:
\n                        source_endings[<\/span>ending]<\/span>.append<\/span>(<\/span>word)<\/span> # append word to the value of that number<\/span>
\n                else<\/span>:                                       # looks like {'ing':['thing','biging']...}  <\/span>
\n                    source_endings[<\/span>ending]<\/span> =<\/span> [<\/span>word]<\/span>     # specify that a new list is made<\/span>
\n
\n# print source_endings<\/span>
\n
\n# source_a will have values of strings begining with the letter a<\/span>
\nfor<\/span> line in<\/span> open<\/span>(<\/span>source_file)<\/span>:          # reading lines from major_dep.txt<\/span>
\n    line =<\/span> line.strip<\/span>(<\/span>)<\/span>
\n    for<\/span> match_obj in<\/span> re<\/span>.finditer<\/span>(<\/span>r"(\\b<\/span>[Aa]\\b<\/span>|\\b<\/span>[Aa]n\\b<\/span>) (.{2,})(\\.<\/span>)"<\/span>,<\/span> line)<\/span>:
\n        a_something1 =<\/span> match_obj.group<\/span>(<\/span>1<\/span>)<\/span>                   # loops through each of the words<\/span>
\n        a_something2 =<\/span> match_obj.group<\/span>(<\/span>2<\/span>)<\/span>                   # loops through each of the words       <\/span>
\n        words =<\/span> a_something2.split<\/span>(<\/span>" "<\/span>)<\/span>
\n        num_words =<\/span> len<\/span>(<\/span>words)<\/span>
\n        # print a_something1 +" "+ a_something2<\/span>
\n        # print num_words<\/span>
\n        if<\/span> num_words ><\/span> 1<\/span>:                               # check to make sure we have a large word<\/span>
\n            a_len =<\/span> len<\/span>(<\/span>words)<\/span>                      # get the last 3 letters<\/span>
\n                                                    # if we've already seen this number, append to list<\/span>
\n            if<\/span> a_len in<\/span> source_a:  
\n                if<\/span> a_something2 in<\/span> source_a[<\/span>a_len]<\/span>:
\n                    ignore =<\/span> "true"<\/span>
\n                else<\/span>:
\n                    source_a[<\/span>a_len]<\/span>.append<\/span>(<\/span>a_something1+" "<\/span>+a_something2)<\/span>   # append word to the value of that number<\/span>
\n            else<\/span>:                                       # looks like {'ing':['thing','biging']...}  <\/span>
\n                source_a[<\/span>a_len]<\/span> =<\/span> [<\/span>a_something1+" "<\/span>+a_something2]<\/span>       # specify that a new list is made<\/span>
\n# print source_a<\/span>
\n
\n
\n
\n
\n
\n
\n# read each line from standard input; split line into words; for each word,<\/span>
\n# get a random word beginning with the same letter from source_alpha<\/span>
\n
\n
\nreplace_1 =<\/span> source_endings[<\/span>random<\/span>.choice<\/span>(<\/span> source_endings.keys<\/span>(<\/span>)<\/span>)<\/span>]<\/span> # how do I delete keys with too little values?<\/span>
\nreplace_you =<\/span> random<\/span>.choice<\/span>(<\/span>replace_1)<\/span>
\nreplace_2 =<\/span> source_alpha[<\/span>random<\/span>.randrange<\/span>(<\/span>2<\/span>,<\/span>6<\/span>)<\/span>]<\/span>
\nreplace_me  =<\/span> random<\/span>.choice<\/span>(<\/span>replace_2)<\/span>
\nreplace_3 =<\/span> source_alpha[<\/span>random<\/span>.randrange<\/span>(<\/span>4<\/span>,<\/span>8<\/span>)<\/span>]<\/span>
\nreplace_love    =<\/span> random<\/span>.choice<\/span>(<\/span>replace_3)<\/span>
\n
\n# read each line from standard input; split line into words; for each word,<\/span>
\n# get a random word beginning with the same letter from source_alpha<\/span>
\nfor<\/span> line in<\/span> sys<\/span>.stdin<\/span>:
\n    line =<\/span> line.strip<\/span>(<\/span>)<\/span>
\n    line =<\/span> re<\/span>.sub<\/span>(<\/span>r"\\b<\/span>[Aa] h.{2,}"<\/span>,<\/span> "xxx"<\/span>,<\/span> line)<\/span>
\n    line =<\/span> re<\/span>.sub<\/span>(<\/span>r"\\b<\/span>[Aa] kiss"<\/span>,<\/span> "kiss"<\/span>,<\/span> line)<\/span>
\n    line =<\/span> re<\/span>.sub<\/span>(<\/span>r"\\b<\/span>[Aa] g.{2,}"<\/span>,<\/span> "yyy"<\/span>,<\/span> line)<\/span>
\n    words =<\/span> line.split<\/span>(<\/span>" "<\/span>)<\/span>
\n    output =<\/span> ""<\/span>
\n    for<\/span> word in<\/span> words:
\n        if<\/span> len<\/span>(<\/span>word)<\/span> ><\/span> 0<\/span>:
\n            lengthWord =<\/span> len<\/span>(<\/span>word)<\/span>
\n            if<\/span> lengthWord in<\/span> source_alpha:
\n                if<\/span> lengthWord ><\/span> 0<\/span>:             
\n                    source_words =<\/span> source_alpha[<\/span>lengthWord+1<\/span>]<\/span>
\n                    if<\/span> re<\/span>.search<\/span>(<\/span>r"[yY]ou"<\/span>,<\/span> word)<\/span>:
\n                        output +=<\/span> replace_you
\n                    elif<\/span> re<\/span>.search<\/span>(<\/span>r"[mM]e"<\/span>,<\/span> word)<\/span>:
\n                        output +=<\/span> replace_me
\n                    elif<\/span> re<\/span>.search<\/span>(<\/span>r"t\\w<\/span>\\w<\/span>\\b<\/span>"<\/span>,<\/span> word)<\/span>:
\n                        rhyme =<\/span> random<\/span>.choice<\/span>(<\/span>replace_1)<\/span> # make sure it's different than replace_you<\/span>
\n                        output +=<\/span> rhyme
\n                    elif<\/span> re<\/span>.search<\/span>(<\/span>r"xxx"<\/span>,<\/span> word)<\/span>:
\n                        source_words2 =<\/span> source_a[<\/span>2<\/span>]<\/span>
\n                        output +=<\/span>  random<\/span>.choice<\/span>(<\/span>source_words2)<\/span>
\n                    elif<\/span> re<\/span>.search<\/span>(<\/span>r"kiss"<\/span>,<\/span> word)<\/span>:
\n                        source_words2 =<\/span> source_a[<\/span>2<\/span>]<\/span>
\n                        output +=<\/span>  random<\/span>.choice<\/span>(<\/span>source_words2)<\/span>
\n                    elif<\/span> re<\/span>.search<\/span>(<\/span>r"yyy"<\/span>,<\/span> word)<\/span>:
\n                        source_words3 =<\/span> source_a[<\/span>3<\/span>]<\/span>
\n                        output +=<\/span> random<\/span>.choice<\/span>(<\/span>source_words3)<\/span>                 
\n                    else<\/span>:  
\n                        output +=<\/span> random<\/span>.choice<\/span>(<\/span>source_words)<\/span>
\n                else<\/span>:
\n                    output +=<\/span> word
\n        output +=<\/span> " "<\/span>
\n    print<\/span> output<\/div><\/td><\/tr><\/tbody><\/table><\/div>\n","protected":false},"excerpt":{"rendered":"

to being However, However, plans or abate. a Mixed Episode every a Major Depressive Episode mood to these guilt or are However, during However, mild However, toxin or Moreover, be one’s predict predict these lowed unless an irreversible dementia often a Major Depressive Episode wish of prior fully lowed are predict review predict self predict […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"footnotes":""},"categories":[13],"tags":[],"class_list":["post-443","post","type-post","status-publish","format-standard","hentry","category-rwet","avhec_catgroup-all"],"_links":{"self":[{"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/posts\/443","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/comments?post=443"}],"version-history":[{"count":22,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/posts\/443\/revisions"}],"predecessor-version":[{"id":465,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/posts\/443\/revisions\/465"}],"wp:attachment":[{"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/media?parent=443"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/categories?post=443"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.tamarziv.com\/itp\/wp-json\/wp\/v2\/tags?post=443"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}