Apache License 2.0

项目介绍

lum-ai/odinson 是一个托管在 GitHub 上的开源项目,主要使用 Scala 编写,采用 Apache License 2.0 许可证,目前获得 73 个 Star、23 次 Fork。

仓库全名
lum-ai/odinson
开源许可证
Apache License 2.0
Star 数
73
Fork 数
23
未关闭 Issue
43

README 摘要

Odinson Odinson can be used to rapidly query a natural language knowledge base and extract structured relations. Query patterns can be designed over (a) surface, syntax, or a combination of both. In particular, Odinson has been highly optimized to deliver these results in near real-time, which enables users to dynamically develop queries, receiving immediate feedback on the coverage and precision of the patterns at…

完整内容见 GitHub 原始 README 或本页 。

常见问题

odinson 用什么语言开发?

主要使用 Scala 编写,采用 Apache License 2.0 许可证,目前有 73 个 Star。

odinson 可以免费商用吗?

仓库采用 Apache License 2.0 许可证,可免费使用与修改,商业使用请遵守许可证条款(例如保留版权声明与许可声明)。

如何获取 odinson 的源码?

可以直接克隆仓库:git clone https://github.com/lum-ai/odinson.git;安装与运行步骤见仓库 README。

odinson 最近还在维护吗?

仓库最近一次更新为 2024年3月2日,当前有 43 个未关闭 Issue;Star 数为 73,可作为社区活跃度的参考。

关于

Odinson is a powerful and highly optimized open-source framework for rule-based information extraction. Odinson couples a simple, yet powerful pattern language that can operate over multiple representations of text, with a runtime system that operates in near real time.

描述取自 GitHub 官方 API,中文内容由 GitRead 中文社区 编辑团队整理。

简要分析

热度分
192
价值分
55
活跃状态
活跃

语言占比

Scala

README

Tests (GitHub Actions) codecov

Odinson

Odinson can be used to rapidly query a natural language knowledge base and extract structured relations. Query patterns can be designed over (a) surface, syntax, or a combination of both. In particular, Odinson has been highly optimized to deliver these results in near real-time, which enables users to dynamically develop queries, receiving immediate feedback on the coverage and precision of the patterns at scale. Please see our LREC 2020 paper for technical details and evaluation.

Documentation

Please see https://lum.ai/odinson/docs/ for documentation, including information about installation, capabilities, and learning how to build queries.

Project overview

Odinson supports a wide range of features, including:

  • Patterns over tokens, including boolean patterns over token features like lemma, POS tags, NER tags, chunk tags, etc
  • Patterns over syntax by matching paths in a dependency graph. Note that this actually agnostic to the tags in the graph edges and it could be repurposed for matching over semantic roles or something else.
  • Named captures for extracting the different entities involved in a relation
  • Support for greedy and lazy quantifiers, lookaround assertions, etc.
  • Support for an internal state to hold intermediate mentions, allowing for the application of patterns in a cascade
  • Support for grammars
  • Filtering results by document metadata (e.g., authors, publication date)
  • and much, much more!

Again, please see our documentation for more information!

We would also love to hear any questions, requests, or suggestions you may have.

Contributions

If you would like to contribute to this project with code, rule sets, or other repo material, that’s awesome! Please do! Some of these materials will help you get started:

  • There is a document covering some of the technical issues related to contributing like the Pull Request Process and Formatting Tips.
  • We do ask you to be nice, and we spell that out in a Covenant Code of Conduct. Of course you can expect the same behavior of us.
  • Please ensure the contributions you propose are yours to give and you are comfortable with the shared rights. There is a Contributor License Agreement (CLA) that you will sign before a pull request is accepted so there are no surprises for any of us. Please take a look at the CLA before you get too far, just in case, as there are legal ramifications.

Thanks for your interest in Odinson!

评论

暂无评论