jbowles

package main
import "fmt"

// PART THREE: if characters are not the same, we step through a comparison against each character to
////  determine DELETION, INSERTION, SUBSTITUTION and get the minimum of the three values.

func MinInt(a ...int) int {
  min := int(^uint(0) >> 1)
	for _, i := range a {
		if i < min {

jbowles

package main
import "fmt"

// PART TWO: step through each string character and vector/cell of dynamic programming table to determine difference.
//// This handles the case where both characters are an exact match, and only the "no-change" condition is used.

func LevenshteinTwo(s1, s2 string) {
  m := len(s1)
	n := len(s2)
	width := n - 1

jbowles

package main
import "fmt"

// http://en.wikipedia.org/wiki/Levenshtein_distance

// FIRST PART: define vector/cell for the dynamic programming table based on string lengths

func PartOneLevenshtein(s1, s2 string) {
  m := len(s1)
	n := len(s2)

jbowles

//package state_gacket // soft 'g', like state_dʒacket
package main 

import (
  "fmt"
  "reflect"
)
/*
type Metadata struct {
  EntryLength int

jbowles

/*jslint node:true*/
"use strict";

function normal_random(mean, variance) {
  if (mean === undefined) {
    mean = 0.0;
  }
  if (variance === undefined) {
    variance = 1.0;
  }

jbowles

/*jshint node:true*/
"use strict";
  // SEND REQUEST TO CLASSIFY TEXT

var http = require('http'),
  fs = require('fs'),
  natural = require('natural'),
  classifier = new natural.BayesClassifier();

// flatten an array

jbowles

require 'treat'
include Treat::Core::DSL

doc1 = document('http://en.wikipedia.org/wiki/List_of_best-selling_fiction_authors')
doc2 = document('http://en.wikipedia.org/wiki/List_of_best-selling_books')

[d1,d2].apply(:chunk, :segment, :tokenize)
#Check it!
doc1.sentences
doc1.sentences.count

jbowles

```clojure
;; Clojure Step
(declare step check-valid base-complete check-user)

(defn one-of [coll]
  (if (seq coll)
    [(rand-nth coll)]))

(defn step[] (concat (check-valid) (base-complete) (check-user)))
(defn check-valid[] (one-of [0 1]))

jbowles

(def simple-grammar
  {:hub [:node-unique-accept :node-unique-check :node-unique-persist]
   :node-unique-accept [:ParseUrl :ParseParams :AcceptBool]
   :node-unique-check [:FormatRead :FormatCheckBool]
   :node-unique-persist [:SaveOrUpdate :PersistBool]
   :ParseUrl #{"http, www, mattcutts.com, /blog/seo-glossary-url-definitions/" "http, jbowles, github.com/" "http, www, cs.dartmouth.edu, /~mckeeman/cs48/mxcom/doc, FiniteAutomata.pdf" "https, www, ruby-toolbox.com, categories/state_machines.html"}
   :ParseParams #{"program address city state zip" "fname lname school program address city state zip" "fname lname school state zip" "fname lname city state zip"}
   :AcceptBool #{"0" "1"} ;;[] (one-of [0 1])
   :FormatRead #{"UTF8" "other stuff"}

jbowles

The :hub is the transaction and/or application (more on this later). Each :node is wrapper around a Hero Formula responsible for passing the non-boolean values to the :hub, but it also returns a boolean. Each camel-cased line inside the :node parentheses is a Hero :formula and the values in quotes are the return values of a Formula's :step. Formula.step is the only thing responsible for changing state.

The following is in Clojure but it should be interpretable from a Ruby perspective; it's the relations that matter here not the syntax.

[:hub ;; begin transaction
 ( ;; begin set of Nodes
  
  :node-unique-accept