the general algo goes like so:
for chunk in corpus:
e-step
m-step
gensim hacks in multiple passes:
the general algo goes like so:
for chunk in corpus:
e-step
m-step
gensim hacks in multiple passes:
I hereby claim:
To claim this, I am signing this object:
private IDisposable _shimContext { get; set; } | |
/// <summary> | |
/// <para>Rules for evaluating expected HTTP requests under test.</para> | |
/// <para>When a rule is matched, the shim will be set up with the information contained in the tuple: the raw HTTP return code and response string.</para> | |
/// <para>Each rule is a function and is given the original Uri of the request and, as a convenience, the parsed query portion of the HTTP request. | |
/// The functions are expected to return a boolean value of whether the parameters match.</para> | |
/// </summary> | |
protected Dictionary<Func<Uri, NameValueCollection, bool>, Tuple<HttpStatusCode, string>> expectedHttpRequests; |
def clone(source, target, bare=False, fresh=False): | |
if os.path.exists(target) and fresh: | |
shutil.rmtree(target) | |
# so dulwich doesn't shit the bed when given a github url | |
if not source.endswith('.git'): | |
source = source + '.git' | |
if not os.path.exists(target): | |
mkdir(target) |
@language python | |
import datetime | |
import os.path | |
worklog_name = 'Worklogs' | |
numdays = 5 * 365 | |
def generate_node(primary_node, node_name, child=True, body_text=''): | |
node = g.findNodeInTree(c, primary_node, node_name) |
class Test | |
def thing | |
@thing ||= "Hi" | |
end | |
def thing=(new_thing) | |
@thing = new_thing | |
end | |
def do_stuff |
{ | |
"kind": "discovery#restDescription", | |
"description": "Business logic for the Meetings app.", | |
"servicePath": "", | |
"rootUrl": "https://meetings.googleapis.com/", | |
"basePath": "", | |
"ownerDomain": "google.com", | |
"name": "meetings", | |
"batchPath": "batch", | |
"revision": "20181113", |