展示HN:Lingo – 一个用Rust编写的语言数据库,具有纳秒级性能

1作者: peerlesscasual大约 1 个月前原帖
嗨,HN,我开发了Lingo——一种语义搜索的SQLite。 我是一名自学成才的开发者和研究者,16岁时辍学,花了一些时间探索针对各种前沿问题的系统设计的第一性原理。在这个案例中,人工智能挑战了“越大越好”的变换器范式。 Lingo是我研究的第一部分,是一个高性能的语言数据库,旨在本地设备上运行。 完整的技术概述和宣言可以在这里找到: [https://medium.com/@robm.antunes/bcd1e9752af6](https://medium.com/@robm.antunes/bcd1e9752af6) 论文已在Zenodo上存档,并附有DOI:[https://doi.org/10.5281/zenodo.17196613](https://doi.org/10.5281/zenodo.17196613) 代码是开源的,可以在这里找到:[https://github.com/RobAntunes/lingodb](https://github.com/RobAntunes/lingodb),目前存在一些问题和功能不完整,但我正在努力修复——只是想开始收集一些反馈。 所有基准测试都可以从代码库中复现,并且可以在各种文献中找到。 作为一名没有学术背景的独立开发者,我非常感激您的反馈!我在这里回答任何问题。 谢谢!
查看原文
Hi HN, I made Lingo - the SQLite of semantic search.<p>I&#x27;m a self-taught developer and researcher who left school at 16, and I&#x27;ve spent some time exploring a first-principles approach to system design for various frontier problems. In this case it&#x27;s AI that challenges the &#x27;bigger is better&#x27; transformer paradigm.<p>Lingo is the first piece of that research, a high-performance linguistic database designed to run on-device.<p>The full technical overview and manifesto is here: <a href="https:&#x2F;&#x2F;medium.com&#x2F;@robm.antunes&#x2F;bcd1e9752af6" rel="nofollow">https:&#x2F;&#x2F;medium.com&#x2F;@robm.antunes&#x2F;bcd1e9752af6</a><p>The paper has been archived on Zenodo with a DOI: <a href="https:&#x2F;&#x2F;doi.org&#x2F;10.5281&#x2F;zenodo.17196613" rel="nofollow">https:&#x2F;&#x2F;doi.org&#x2F;10.5281&#x2F;zenodo.17196613</a><p>The code is open-source and can be found at <a href="https:&#x2F;&#x2F;github.com&#x2F;RobAntunes&#x2F;lingodb" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;RobAntunes&#x2F;lingodb</a>, it&#x27;s currently broken and feature incomplete but I&#x27;m working on it - just wanted to start getting some feedback.<p>All benchmarks are reproducible from the repo and can also be found in the various texts.<p>As an independent without academic affiliation, I&#x27;d be incredibly grateful for your feedback! I&#x27;m here to answer any questions.<p>Cheers!