liblevenshtein-java

liblevenshtein-java copied to clipboard

The most common ones can have constant methods to reduce the memory footprint, rather than requiring fields to store the indices and errors.

dylon

dylon

- Return a set of indexed objects by key, like a fuzzy, associative map - Use KeyProviders to extract key terms from arbitrary objects, and index those objects accordingly

dylon

The classes could be memoized, etc. http://stackoverflow.com/a/2946402/206543

dylon

Support sophisticated, parsing rules when reading a dictionary

1

For example, the parser would need to distinguish between characters and integers in the following, SO post: http://stackoverflow.com/q/37058112/206543 This would depend on the completion of #58

dylon

https://github.com/EvoSuite/evosuite

dylon

This is a good, next step to something akin to a double-array trie, etc.

dylon

Create demos for the following JVM-based languages: - [x] Java - [ ] Scala - [ ] Clojure - [ ] Groovy

dylon

###### Additional serializers: - [x] PlainTextSerializer - Serializes dictionaries to plain text files (newline-delimited terms) - [x] PropertiesSerializer - Serializes transducer attributes - [ ] XMLSerializer - [ ] JSONSerializer...

dylon