Comments (5)
The simplest entrypoint might be to check how the qgram.jl
file changed in this:
https://github.com/robertfeldt/StringDistances.jl/blob/simpler_counter_design/src/distances/qgram.jl
from stringdistances.jl.
That looks good. Maybe it'd be even better to remove the _count
function, and define a countmatches!(mc::AbstractWordMatchCounter, d1::QGramIterator, d2::QGramIterator)
method instead.
from stringdistances.jl.
Thanks for taking a look. Hmm, yes, but there would be no performance benefit, right, since we still need to create the full dict currently done in _count
. Might clean up the code somewhat but not by much. I guess we might save some memory by not having to send the result from values(d)
back but can just iterate over it. Or am I missing something?
BTW, thanks for making me a contributor. Should I still do PRs from my forked repo or is there a simplification in the workflow? (I couldn't see what rights came with the new role).
from stringdistances.jl.
For the workflow, I think the idea is that you should still do PR (as I should, I need to stop committing directly), but then you can merge them by yourself (when you think it is ready, say, after a few days).
For my proposition, yes itβs just about cleaning the code a bit, not about changing performances
from stringdistances.jl.
Could you make a PR with your code? Maybe it's better to un-export QGramDict
and QgramSortedVector
(or the new names you use). Not sure why I did that in the first place.
from stringdistances.jl.
Related Issues (20)
- Phonetic distance HOT 1
- Tag a new version HOT 1
- `Base.findmin(s1, s2, dist::Partial)`
- bug in `DamerauLevenshtein` HOT 9
- `compare` with `Partial` distances gives negative answers HOT 4
- DamerauLevenshtein() vs Levenshtein() why the same distance ? HOT 1
- Speeding up qgram distances with pre-counting of qgrams HOT 9
- (Partial) Hamming distance HOT 5
- TagBot trigger issue HOT 5
- `Partial` only looks at substrings of the same length... HOT 1
- pairwise not working with StringDistances HOT 3
- unexpected behavior when computing distance with an array HOT 2
- Non-strings HOT 4
- The value of "compare" is probably wrong. HOT 1
- Feature Request: Parallel processing HOT 4
- incremental compilation may be fatally broken for this module HOT 5
- Julia v1.7 Jaro() doesn't work HOT 2
- incomplete readme documentation HOT 1
- NaN (or ArgumentError) from QGram distances for short strings HOT 4
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 stringdistances.jl.