Comments (6)
Seems to equally apply to the Algorithm.STANDARD
algorithm.
It starts popping up when maxDistance is increased to 3, although this last comment is of circumstantial nature. Possibly people typically only go up until 2.
from liblevenshtein-java.
Hi,
What do you mean by, findAll
results? Also, please provide a test case that demonstrates the issue.
from liblevenshtein-java.
Sorry about that, it was the name of my Scala wrapper around tranduce
. It will take a huge amount of creativity being able to demonstrate this without providing the proprietary lexicon... but it should be demonstrated in a reproducible way, I know. Lets put it on hold until I get to that.
from liblevenshtein-java.
Okay. In the meantime, please test your wrapper against version 2.2.0, as the issue #6 was a pretty bad bug and may be the root cause of this.
from liblevenshtein-java.
On first examination, looks like the bug I reported here consistently reproduces with 2.1.2 but not with 2.2.0. I will check again tomorrow. Any idea how the fix for #6 may have solved this?
from liblevenshtein-java.
Yes, I do. Depending on the terms provided, some of the non-final nodes were overwriting the final ones, and vice-versa. The way the final nodes were stored missed a few edge cases. The tiny list I was using for testing happened to not have such terms, which is how the bug made it to production.
While debugging #6, I encountered similar behavior to what this issue describes, which is why I recognized it as the likely root cause.
from liblevenshtein-java.
Related Issues (20)
- Support sophisticated, parsing rules when reading a dictionary HOT 1
- Create specialized DawgNodes for common characters
- Consider dynamically-compiling node classes that return constant values
- Support customizing the dictionary-search strategy
- Add development wiki
- Test the example code before generating the documentation
- Create integration test suite
- Create regression test suite
- Cache commands across template tasks for same, Gradle process
- Support variable, error penalties by error type (weighted errors)
- Support variable, error penalties by error type and context
- Support generic, dictionary nodes HOT 1
- Periodically-tweet about resolved issues
- Collapse consecutive, dictionary nodes with only one, outgoing edge HOT 1
- Create a Coverity Scan, Java model
- Before each release, ensure that every closed bug has a regression test
- Add support for One-JAR HOT 1
- Generating string variants constrained by Levenshtein distance HOT 10
- Weighted Levenshtein distance support HOT 2
- Is a transducer thread-safe ? HOT 3
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from liblevenshtein-java.