[
https://issues.apache.org/jira/browse/LUCENE-4947?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13640586#comment-13640586
]
Steve Rowe commented on LUCENE-4947:
------------------------------------
bq. I think it's best that you do the license change yourself and that we don't
have any active role in making the change since you are the only person
entitled to make the change.
+1
bq. After this has been done, please make a tarball and attach it to this JIRA
and indicate that this is the code you wish to grant and also inform us about
the MD5 hash of the tarball. (This will go into the IP-clearance document and
will be used to identify the codebase.)
I and Dawid had been advocating using Github for this, but I agree with
Christian: a tarball attached to this issue by you, [~klawson88], will remove
all ambiguity about what is being donated and by whom. Also, Github is not
under ASF control, and in the future if that business goes under, the ASF will
lose the history of this donation.
> Java implementation (and improvement) of Levenshtein & associated lexicon
> automata
> ----------------------------------------------------------------------------------
>
> Key: LUCENE-4947
> URL: https://issues.apache.org/jira/browse/LUCENE-4947
> Project: Lucene - Core
> Issue Type: Improvement
> Affects Versions: 4.0-ALPHA, 4.0-BETA, 4.0, 4.1, 4.2, 4.2.1
> Reporter: Kevin Lawson
>
> I was encouraged by Mike McCandless to open an issue concerning this after I
> contacted him privately about it. Thanks Mike!
> I'd like to submit my Java implementation of the Levenshtein Automaton as a
> homogenous replacement for the current heterogenous, multi-component
> implementation in Lucene.
> Benefits of upgrading include
> - Reduced code complexity
> - Better performance from components that were previously implemented in
> Python
> - Support for on-the-fly dictionary-automaton manipulation (if you wish to
> use my dictionary-automaton implementation)
> The code for all the components is well structured, easy to follow, and
> extensively commented. It has also been fully tested for correct
> functionality and performance.
> The levenshtein automaton implementation (along with the required MDAG
> reference) can be found in my LevenshteinAutomaton Java library here:
> https://github.com/klawson88/LevenshteinAutomaton.
> The minimalistic directed acyclic graph (MDAG) which the automaton code uses
> to store and step through word sets can be found here:
> https://github.com/klawson88/MDAG
> *Transpositions aren't currently implemented. I hope the comment filled,
> editing-friendly code combined with the fact that the section in the Mihov
> paper detailing transpositions is only 2 pages makes adding the functionality
> trivial.
> *As a result of support for on-the-fly manipulation, the MDAG
> (dictionary-automaton) creation process incurs a slight speed penalty. In
> order to have the best of both worlds, i'd recommend the addition of a
> constructor which only takes sorted input. The complete, easy to follow
> pseudo-code for the simple procedure can be found in the first article I
> linked under the references section in the MDAG repository)
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
