This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var Unit = function(value, grad) { | |
this.value = value; | |
this.grad = grad; | |
}; | |
var multiplyGate = function(){ }; | |
multiplyGate.prototype = { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import nltk, re, pprint | |
import json | |
import sys | |
# a function to convert a tree into an array for json encoding | |
def tree_to_dict(tree): | |
return {tree.label(): [tree_to_dict(t) if isinstance(t, nltk.Tree) else t for t in tree]} | |
# download required corpora | |
required_downloads = [ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function categorizeGroups(token) { | |
var previous = null; | |
var current = null; | |
var string = ""; | |
for(var c in token) { | |
var ch = token[c]; | |
var next = null; | |
// Y is a special case, it is only a vowel if preceeded by a vowel. | |
if(ch === "y") { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// NOTE: These are not rock-solid benchmarks, just a quick illustrative test. | |
var wordnet = new natural.WordNet(); | |
var fs = require("fs"); | |
var loops = 100; | |
var allWords = []; | |
// NOTE: This file should exist on most UNIX varieties | |
var dictionary = "/usr/share/dict/words"; | |
var trie = new natural.Trie(false); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/bash | |
# CHANGE THIS TO MATCH YOUR PROJECT | |
root_dir=/var/www/example.com; | |
while read oldrev newrev refname | |
do | |
branch=$(git rev-parse --symbolic --abbrev-ref $refname); | |
branch_dir=$root_dir/$branch/$newrev; | |
echo "[CI] Commit recieved on branch $branch"; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Requires Node.js and [Natural](https://github.com/NaturalNode/natural) | |
var natural = require("natural"); | |
var fs = require("fs"); | |
// NOTE: This file should exist on most UNIX varieties | |
var dictionary = "/usr/share/dict/words"; | |
var trie = new natural.Trie(false); | |
console.time("Build Trie"); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var Trie = require("./index").Trie; | |
var t = new Trie(); | |
// ... add your word dictionary .... | |
t.addStrings(["experts", "exchange", "pen", "island", "choose", "spain", "kids", "express", "childrens", "wear", "dickson", "web"]); | |
var testDomains = ["expertsexchange", "penisland", "choosespain", "kidsexpress", "childrenswear", "dicksonweb"]; | |
function decompose(search) { | |
// find all of the words which start from the first letter |
NewerOlder