neubig

#!/usr/bin/python

from math import exp
import numpy as np
import matplotlib.pyplot as plt

def rbf_kernel(x1, x2, variance = 1):
    return exp(-1 * ((x1-x2) ** 2) / (2*variance))

def gram_matrix(xs):

neubig

#!/usr/bin/python

################################################################################
# pequalnp.py
#  Graham Neubig
#  4/1/2014
#
# This is a program that provides an answer for the age-old problem of whether
# the class of problems that can be verified in polynomial time (NP) is equal
# to the class of problems for which an answer can be provided in polynomial

neubig

#!/usr/bin/python

# crf.py (by Graham Neubig)
#  This script trains conditional random fields (CRFs)
#  stdin: A corpus of WORD_POS WORD_POS WORD_POS sentences
#  stdout: Feature vectors for emission and transition properties

from collections import defaultdict
from math import log, exp
import sys

neubig

#!/usr/bin/python

# This code implements the training part of the Restricted Boltzmann Machine
# language model described by:
#   Three New Graphical Models for Statistical Language Modeling
#   Andriy Mnih and Geoffrey Hinton
#   ICML 2007
#   http://www.gatsby.ucl.ac.uk/~amnih/papers/threenew.pdf
#
# Usage: train-rbmlm.py training-file.txt

neubig

#!/usr/bin/python
# ***************************
# * solve-3sat.py
# *  by Graham Neubig
# *  4/1/2013
# ***************************
#
# This is a Python program to provide an answer for satisfiability problems
# in conjunctive normal form with 3 variables per clause (3SAT) in LINEAR time.
#

neubig

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
import re
import datetime

pattern = ur'電力.*供給'

neubig

#!/usr/bin/python

# A python implementation of the string rewriting kernel
#  by Graham Neubig
#
# Reference:
#  Fan Bu, Hang Li, Xiaoyan Zhu. "String Rewriting Kernel". ACL 2012
#  http://aclweb.org/anthology-new/P/P12/P12-1047.pdf

from math import factorial

neubig

#!/usr/bin/perl
# This is a script to change KyTea's POS tags in Japanese to English 
# abbreviations

use strict;
use utf8;
use Getopt::Long;
use List::Util qw(sum min max shuffle);
binmode STDIN, ":utf8";
binmode STDOUT, ":utf8";

neubig

#include <vector>
#include <iostream>
#include <cstdlib>
#include <cmath>

using namespace std;

int SampleMultinomial(const vector<double> & distribution) {
    double value = (double)rand()/RAND_MAX;
    for(int i = 0; i < distribution.size(); i++)

neubig

#!/usr/bin/python

from nltk.tree import Tree
import sys

# A program to display parse trees (in Penn treebank format) with NLTK
#
#  To install NLTK on ubuntu: sudo apt-get install python-nltk

for line in sys.stdin: