Skip to content

armgit / laya

Public Imported from GitHub
0

Non-autoregressive System 1 decision engine. Typed choice, score and yes/no decisions over any text in a single forward pass, in 100+ languages, with a router that picks the right checkpoint per request.

docs(router): correct the abstention claim in the routing guide

Nandakishorc1dcc0ba101b
diff --git a/docs/routing.md b/docs/routing.md
index 6753fd43..801abd30 100644
--- a/docs/routing.md
+++ b/docs/routing.md
@@ -91,8 +91,15 @@ def detect_request_language(state):
router = Router(lang_guess=detect_request_language)
```
-An unrecognized or empty hint does not force a checkpoint; routing continues to the next rule.
-This keeps an abstaining detector from silently pinning requests to the wrong model.
+An abstaining hint does not force a checkpoint; routing continues to the next rule. That covers
+`None`, a blank string, and the codes that name no language (`C`, `POSIX`, `C.UTF-8`, `und`,
+`zxx`, `mul`), which is what a detector returns when it has nothing to say, so an abstention
+cannot silently pin requests to the wrong model.
+
+An unrecognized hint is not an abstention. Any other value, including `"xx"`, `False` and `0`,
+is read as "not English" and routes to the multilingual checkpoint. So a detector that returns
+a garbage code rather than `None` does pick a checkpoint, and if that matters, map its unknown
+case to `None` before passing it on.
Built-in detection is a lightweight script and language heuristic, not a general-purpose language
identification model. It analyzes string values in text, dict, and list states; dictionary keys are