quantleaf-language-documentation
probly-search
Our great sponsors
quantleaf-language-documentation | probly-search | |
---|---|---|
3 | 3 | |
6 | 50 | |
- | - | |
1.4 | 4.1 | |
12 months ago | 3 months ago | |
Rust | ||
- | 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.
quantleaf-language-documentation
-
The language that almost all programmers use
See https://github.com/quantleaf/quantleaf-language-documentation/tree/master/examples for Swedish and English code examples.
-
A Search Engine with a normalized scoring function
Hey! I am involved in a project where I am trying to create a programming language that uses machine learning to compile text as computer code, some info here (https://github.com/quantleaf/quantleaf-language-documentation). This is not yet open source as a whole, but I am currently in the process of doing so. The first subproject to be released is a search engine library that enables you to score documents with a value between 0 and 1 (I call it “zero-to-one” score). In short, this is done by evaluating the product of how close we are to a perfect match regarding document length and query length, but also in terms of the amount of tokens, in the document and in the query.
-
April 2021 monthly "What are you working on?" thread
I am working on a natural language programming language! Will soon post a launch announcement on this subreddit. I currently call it the Quantleaf Language.Here is a small a small introduction to the syntax which will be available!
probly-search
- In memory full text search in Rust?
-
First project: A Search Engine for normalized scoring
I have spent my last two weeks learning Rust, and by doing so I created a Search Engine library. The purpose of this is to enable users to perform normalized scoring that scores documents between 0 and 1 (1 would mean that the query is exactly matching the document). I developed the algorithm initially in Javascript 2 years ago. I was curious about the performance of a "low level" language (coming from purely Java/Python/Javascript background) and how you can use it with Web assembly, so I thought it would be a great idea to get started with Rust! (I am so far very pleased) Demo: https://quantleaf.github.io/probly-search-demo/ Source: https://github.com/quantleaf/probly-search
-
A Search Engine with a normalized scoring function
Library source code: https://github.com/quantleaf/probly-search Demo source code: https://github.com/quantleaf/probly-search-demo
What are some alternatives?
kuroko - Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
calypso - Calypso is a mostly imperative language with some functional influences that is focused on flexibility and simplicity.
elasticlunr-rs - A partial port of elasticlunr to Rust. Intended to be used for generating compatible search indices.
fatcoach
Toshi - A full-text search engine in rust
delta - C* is a hybrid low-level/high-level systems programming language focused on performance and productivity.
flexsearch - Next-Generation full text search library for Browser and Node.js
bluebird
probly-search-demo - probly-search demo app using React and wasm
pkg-tasks - Aument package for asynchronous I/O
PumpkinDB - Immutable Ordered Key-Value Database Engine