With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Stop vibe-debugging.
Plug Claude into your app's actual errors.
AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
Based on the Buckwalter Morphological Analyzer (Version 1.0) for doing Arabic stemming and POS tagging. Includes a rewrite of the original Perl script, with better documentation and more flexible options, and a C++ interface (usable as a library or app).
The Unstructured Information Management Architecture (UIMA) Framework is an open, scalable and extensible platform for building analytic solutions that process unstructured information to find latent meaning, relationships and relevant facts.
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
The Text Annotation Environment (tae) can be used to annotate natural language text manually or automatically (UIMA Annotator) with meta information (tokens, part-of-speech, named entities, ...). Tae is based on Eclipse and IBM's UIMA.
The bandit project is a repository of the various known algorithmic solutions for the multi-armed bandit problem. The project is also a repository of several datasets that could be used for benchmarking purposes.
The Annotation Graph Schema API aims to aid developers in the creation and querying
of Annotation bases where the use of XML-based tools is needed. It is easily integratable with any persistent representation and has a flexible in-memory model.
This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net