kaldi-gstreamer-server
ChessPositionRanking
kaldi-gstreamer-server | ChessPositionRanking | |
---|---|---|
4 | 29 | |
1,054 | 132 | |
- | - | |
0.0 | 2.5 | |
over 3 years ago | 5 months ago | |
Python | Haskell | |
BSD 2-clause "Simplified" License | 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.
kaldi-gstreamer-server
- Real-time full-duplex speech recognition server, based on Kaldi and GStreamer
- Ask HN: What problem are you close to solving and how can we help?
-
Open Source ASR with user-specific custom vocabularies?
Through my research, the most promising real-time transcription options appear to be Vosk or Kaldi Gstreamer. I’ve set them both up & they appear to work well for general transcription, but I’m not sure how to handle the user-specific custom vocabularies.
-
Speech to text software
It is kind of difficult to find something like this free of charge (and open source) since the ASR service needs to be hosted somewhere. If you are really interested in the topic then you could take a lit into kaldi and its pretrained models (but kaldi is kind of difficult to learn so I don't really recommend it if you want something quick) and then you could also combine that with kaldi-gstreamer in order to set up a server which you can turn on and off whenever you like.
ChessPositionRanking
- Chess Position Ranking
-
How to Store a Chess Game in 26 Bytes Using Bit-Level Magic
3. There's extra nuanced things you might want to handle in the coding, like that pawns can't be on their own back row. That is significantly harder.
It looks to me like https://github.com/tromp/ChessPositionRanking has resolved these sorts of issues, but I haven't dug into exactly how.
-
Permutation Iteration and Random Access
Multinomial rankings can be combined with a dozen others to rank a subset of all chess positions including all legal ones. This allows one to sample millions of random such positions, determine how many are legal, and thus obtain an accurate estimate of 4.8&10^44 legal chess positions [2].
[1] https://github.com/tromp/ChessPositionRanking/blob/main/src/...
[2] https://github.com/tromp/ChessPositionRanking
-
The number of legal Chess diagrams is less than 4 × 10^37 which is an improvement on the previous upper bound of 2 × 10^40 by Steinerberger.
The key words being "without promotion". Both bounds, this one and Steinerberger's, only consider positions reachable without promotion. Allowing promotions, one estimate suggests that the number is close to 4.82 × 10^44.
-
eli5 With billions and billions of people over time, how can fingerprints be unique to each person. With the small amount of space, wouldn’t they eventually have to repeat the pattern?
source
- Accurately estimating the number of legal chess positions
-
"Chess too simple for my big brain, not like mobile strategy game"
This one as well as Shannon number wiki seem to say that possible sensible moves are about 10^40 while and 10^120 while taking any moves (maybe including some illogical / illegal ones) .
-
How to build a Chess Engine, an interactive guide
Shannon's estimate was based on very primitive methods; by generating random positions and using fairly advanced methods to see whether they are legal or not (ie., can you construct a proof game for it, or prove that it could never happen), you will get much closer. A group of people have been working on this, and their current best estimate is (4.822 +- 0.028) * 10^44, or a bit over 148 bits. (Amazingly enough, Shannon wasn't all that far off on this account! His estimated number of legal games seems much more dodgy, though.)
http://talkchess.com/forum3/viewtopic.php?f=7&t=77685&sid=e3...
Practically speaking, https://github.com/tromp/ChessPositionRanking gives a number between 0 and approx. 8.7 * 10^45 for any legal position, so it's only a couple of bits away from optimality.
-
Ask HN: Teach Me Something New
The number of chess positions has now been estimated with 2 digits of accuracy as ~ 4.8 x 10^44: https://github.com/tromp/ChessPositionRanking
What are some alternatives?
espnet - End-to-End Speech Processing Toolkit
hackernews - Hacker News web site source code mirror.
vosk-server - WebSocket, gRPC and WebRTC speech recognition server based on Vosk and Kaldi libraries
FUZIX - FuzixOS: Because Small Is Beautiful
Kaldi Speech Recognition Toolkit - kaldi-asr/kaldi is the official location of the Kaldi project.
mtpng - A parallelized PNG encoder in Rust
rhasspy - Offline private voice assistant for many human languages
swi-mqtt-pack - MQTT pack for SWI-Prolog
bert-for-inference - A small repo showing how to easily use BERT (or other transformers) for inference
Etar Calendar - Android open source calendar
syzygy-tables.info - User interface and public API for probing Syzygy endgame tablebases