----------------------------------------------
Required Lisp Functions for each Awk function:
----------------------------------------------
vrogers

Train: dolist, incf, read-line, read, if, aref, setf, let

Ranges: dolist, incf, setf, let, position (for strings), subseq

Rounds: if, else, dolist, aref, _?_:_ (basically if, else), setf, 
	basic math functions, format t/nil, let

Twos: while, aref, setf, let

Test: setf, let, dolist, if, sort, rand

Matched: dotimes, aref, setf, let, basic math functions, 
	position (for strings), subseq

Normalize: let, dolist, setf, math functions, 
	   round (for rounding floats)

Push: aref, incf or just use the lisp function: push

OO: format t/nil, dolist setf, aref or just use the lisp 
    function format t/nil

jwood13
	 
-learn
A wrapper for the actual learning in learn1. Calls ranges followed by learn1 
for each class in the unique class list. Lisp code needed: dolist

-round0
This is the first round of ranking/pruning, to be followed by rounds.
Lisp code needed: dolist, aref, setf, math ops, if, progn

-belief inject
A function to split up beliefs into ideas and put them in which.
Lisp code needed: a parser like sequence-split or tokens, dolist, aref, setf

-two
Picks and combines two unlike things.
Lisp code needed: setf, if, progn

-score
Creates the values needed to make a score in score1.
Lisp code needed: aref, setf, do, if, math ops

-explode
Expands a list into a sample of things repeted by relative frequency.
Lisp code needed: dolist, do, aref, setf

-fv
Combines a feature and range.
Lisp code needed: list

-values
A print function for array values.
Lisp code needed: print, possibly dolist or sort depending.

pwojciec

learn1: Begins the process of finding a rule for the current class and then tests that rule.
	Requires Lisp functions format,setf,if

chop: Keeps only the first few rules in the current list of possible rules
	Requires lisp functions dotimes, setf, aref

beliefsreview: Prints the current list of possible rules.
	Requires lisp functions dolist, format 

combine: Combines a pair of rules so that no conditions are repeated and conditions are grouped based on feature
	Requires lisp functions dotimes, if, setf, incf, aref, concatenate, dolist

score1: Computes the score of a rule based on the chosen chriterion
	Requires lisp functions cond, *,+,/

one: Returns a random item from an array
	Requires lisp functions nth, length, random

most: Returns the greatest value in an array.
	Requires lisp functions let, setf, if, dolist

o: Prints a sorted array.
	Requires lisp functions format, if, setf