quantleaf-language-documentation VS probly-search

See https://github.com/quantleaf/quantleaf-language-documentation/tree/master/examples for Swedish and English code examples.

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.

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!

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

Library source code: https://github.com/quantleaf/probly-search Demo source code: https://github.com/quantleaf/probly-search-demo