Begun project exploring best ways to get words from remote address into list
It has begun. Created test file with first test case, currently failing. very basic structure of levenshtein main program. Now to write method to pass first test case.
same length levenshtein test is working
Added diffLengthTest. Added boundary test cases for beginning and end of word differences. All test cases passing now. Think Levenshtein logic basics are worked out.
Created basic structure to find all one step levs of a single word. Now need to modify it to recursively test all the result words
Levenshtein recursive function working! All test cases passing. Now just need to fill in wrapper code.
Levenshtein recursive function working! All test cases passing. Now just need to fill in wrapper code.
Levenshtein recursive function working! All test cases passing. Now just need to fill in wrapper code.
Removing hanging file...
Merge branch 'master' of bitbucket.org:bmdmaze/levenshtein

Conflicts:
	findLevs.py
	test_levenshtein.py
minor changes. Added a print statement to watch new Lev distances as they're discovered.
Minor Cleanup
Optimized findLevs a bit. Each iteration now removes words from master list as they're added to list of LevDistances. The master list will shrink with time, making it faster.
further optimized findLevs function. It eliminates all known new levs before calling findLevs again.
Added README file with notes, takeaways, and long term solution to the Lev Dist problem.
updating .gitignore
Updated README
imported levenshtein as subtree