Docs
Kifuliiru Data Engines
Applications
Kifuliiru Data Engines
Overview
How to use this documentation
Language reference
Counting nouns in KifuliiruKifuliiru verb conjugatorKifuliiru phonetics (KPG)Building Kifuliiru sentencesKifuliiru word compatibility
Ecosystem
HomeBrowse applications

© 2026 Wekify LLC · Kifuliiru Lab

Homellms.txtkifuliiru.com

Language referenceKifuliiru word compatibility

Kifuliiru word compatibility

Which nouns, verbs, and modifiers may appear together in natural sentences.

Kifuliiru word compatibility answers: given this noun, which verbs and modifiers are allowed in natural sentences?

It is a filter, not a generator. Sentence building queries it before accepting a combination.

Matrix density (planning)

∑Formula
M = linked_pairs / (|nouns| × |verbs|)
  • linked_pairs — explicit noun–verb (or tag) compatibility links.
  • Full cross-product would be huge; M tells you how sparse or rich the matrix is.

Low M means generation stays conservative; raising M increases variety but needs linguist review.

Rule shape

Each constraint is typically:

  • A verb (or verb class pattern), and
  • Allowed object categories or semantic tags (human, food, animate, …).

Generation asks: does this noun’s tags intersect the verb’s allowed set?

Plain-language example

“Eat” requires a living subject and often a food object. “Sleep” may allow animate subjects but no object. If a draft picks table + eat, compatibility blocks or retries until a valid pair appears.

Where rules come from

Compatibility is authored by linguists (not guessed from raw text). Progress metrics help report how much of the matrix is documented; the wording of each rule is the teaching content.

PreviousBuilding Kifuliiru sentencesNextEcosystem

On this page

  • Matrix density (planning)
  • Rule shape
  • Plain-language example
  • Where rules come from