dictomaton
RVS_Generic_Swift_Toolbox
Our great sponsors
dictomaton | RVS_Generic_Swift_Toolbox | |
---|---|---|
2 | 3 | |
129 | 6 | |
- | - | |
1.8 | 4.4 | |
about 2 years ago | 4 months ago | |
Java | Swift | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
dictomaton
-
Calculate the difference and intersection of any two regexes
Say you want to compute all strings of length 5 that the automaton can generate. Conceptually the nicest way is to create an automaton that matches any five characters and then compute the intersection between that automaton and the regex automaton. Then you can generate all the strings in the intersection automaton. Of course, IRL, you wouldn't actually generate the intersection (you can easily do this on the fly), but you get the idea.
Automata are really a lost art in modern natural language processing. We used to do things like store a large vocabulary in an deterministic acyclic minimized automaton (nice and compact, so-called dictionary automaton). And then to find, say all words within Levenshtein distance 2 of hacker, create a Levenshtein automaton for hacker and then compute (on the fly) the intersection between the Levenshtein automaton and the dictionary automaton. The language of the automaton is then all words within the intersection automaton.
I wrote a Java package a decade ago that implements some of this stuff:
https://github.com/danieldk/dictomaton
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Also related: Levenshtein automata - automata for words that match every word within a given Levenshtein distance. The intersection of a Levenshtein automaton of a word and a DAWG gives you an automaton of all words within the given edit distance.
I haven't done any Java in years, but I made a Java package in 2013 that supports: DAWGs, Levenshtein automata and perfect hash automata:
https://github.com/danieldk/dictomaton
RVS_Generic_Swift_Toolbox
-
Internationalization best practices for front-end developers
[0] https://github.com/RiftValleySoftware/RVS_Generic_Swift_Tool...
[1] https://github.com/RiftValleySoftware/RVS_Generic_Swift_Tool...
[2] https://github.com/RiftValleySoftware/RVS_Generic_Swift_Tool...
[3] https://developer.apple.com/library/archive/documentation/Co...
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Ole Begemann and Chris Eidhoff wrote Advanced Swift, and, in there, described a really efficient FIFO queue.
I implemented a variant ofit, in my Generic Swift Toolbox Package[0]. It’s lightning fast.
[0] https://github.com/RiftValleySoftware/RVS_Generic_Swift_Tool...
-
Swift Playgrounds 4
Found it, but it's not what I need.
I need a target to be a playground; not a project.
The idea is to be able to assign resources, files, and SPM modules to a playground, so they are available to the code running in the playground (an example might be an SPM module like my Generic Swift Toolbox Module[0]). I can then work with the code I'm prototyping in a lightweight text file.
[0] https://github.com/RiftValleySoftware/RVS_Generic_Swift_Tool...
What are some alternatives?
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
plurid-data-structures-typescript - Utility Data Structures Implemented in TypeScript
sdsl-lite - Succinct Data Structure Library 2.0
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials
multiversion-concurrency-contro
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
minisketch - Minisketch: an optimized library for BCH-based set reconciliation
hamt - A hash array-mapped trie implementation in C
TablaM - The practical relational programing language for data-oriented applications
ego - EGraphs in OCaml
RVS_Generic_Swift_Tool
gring - Golang circular linked list with array backend