The algorithms in 26, 28 yield (up to polylog factors) these nearly optimal precision and Boolean cost bounds for the worst case polynomial rootfinding.
Source: wiktionary
Ranked by relevance and common usage.
OpenGloss and ConceptNet supply richer edges like generalizations, collocations, and derivations.
1 total sentences available.
The algorithms in 26, 28 yield (up to polylog factors) these nearly optimal precision and Boolean cost bounds for the worst case polynomial rootfinding.
Source: wiktionary
Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.