# alanrubin/top-parsers-WCFG-Ruby

>   Efficiently find the top-k parses of a WCFG, that produce a given string w, and satisfy a given set of constraints C. Algorithm implementation uses Ruby and is only efficient for small dictionary.

- **Canonical URL**: https://githubrepo.cloud/repo/alanrubin/top-parsers-WCFG-Ruby
- **GitHub Repository**: https://github.com/alanrubin/top-parsers-WCFG-Ruby
- **Maintainer / Creator**: https://github.com/alanrubin
- **Discovered On**: Sep 24, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*