Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jamra
on June 11, 2015
|
parent
|
context
|
favorite
| on:
Levenshtein Automata (2010)
Yes that makes it supremely clearer. I also found a FastSS implementation, which uses the same d-deletion neighborhood. Here it is:
http://fastss.csg.uzh.ch
I am looking at a python implementation for examples.
lorenzhs
on June 12, 2015
[–]
nice, that seems to be based upon a similar idea as the paper I mentioned (but earlier and less refined).
jamra
on June 12, 2015
|
parent
[–]
The paper you mentioned reduces memory consumption hugely and averages out the query and insertion time. It's a good improvement.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
I am looking at a python implementation for examples.