Reference · Language & intelligence
NLP & linguistics
34 functions in 26 classes, grouped by what they do, each with the explanation the library gives of itself.
The story of this area, for a general reader: what a crafter does with it, an example run and its rated lanes, is on its Platform page.
The functions, by what they do
Testing and checking
- IsNegative TRUE if the sentiment score is -0.05 or below. in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.IsNegative() #--> 0composed from the signature, run for this page - IsPositive TRUE if the sentiment score reaches +0.05. in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.IsPositive() #--> 1composed from the signature, run for this page - IsStopword TRUE if the text is a stopword. in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.IsStopword() #--> 0composed from the signature, run for this page - HasSynonyms wordnet (synonyms + hypernyms) in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.HasSynonyms() #--> 0composed from the signature, run for this page - IsSynonymOf wordnet (synonyms + hypernyms) in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.IsSynonymOf("an") #--> 0composed from the signature, run for this page - HasSemanticModel Upgrades text similarity from lexical bag-of-words to true MEANING via a runtime neural model (load one process-wide with StzNeuralModelQ(path)). With no model loaded these degrade gracefully to the lexical path, so code keeps working and auto-improves once a model is present. TRUE if a runtime embedding model is loaded and ready. in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.HasSemanticModel() #--> 0composed from the signature, run for this page - IsSemanticallySimilarTo semantic layer (neural embeddings) in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.IsSemanticallySimilarTo("an", 2) #--> 0composed from the signature, run for this page - Is copula, CLOSING form: "What the first char of Haro IS" in stzQuestion
- IsAQ "Suppose X IS A fruit" -- records the assumption in the overlay in stzSupposition
Counting and measuring
- NumberOfWords vocabulary & frequency in stzCorpus
composed example
o1 = new stzCorpus("seed document about cats") ? o1.NumberOfWords() #--> 4composed from the signature, run for this page - NumberOfDocumentsWith TF-IDF (the vectorizer feeding the ML floor) in stzCorpus
composed example
o1 = new stzCorpus("seed document about cats") ? o1.NumberOfDocumentsWith("an") #--> 0composed from the signature, run for this page - NumberOfQ NO mid-chain IsQ() and NO NotQ() -- both were linguistically wrong (author's ruling): the sentence-initial IsQ() IS the fronted copula (subject-aux inversion), so a second one doubles it; and English negates comparisons with ANTONYM comparators (DifferentFromQ), predicates with negative FORMS (IsNot*/DoesNot*), and questions with the TAG ("..., or not?" -> OrNot()). "the NUMBER OF <noun>" as a constituent: count mode for this side in stzQuestion
Replacing and setting
- SetWord construction (the parser builds bottom-up) in stzParseTree
- SetApproximate Label agreement measured 1.000 in both rows above -- on separable data the vote absorbed every neighbour the forest missed. Do not read that as a guarantee; read it as the reason AgreementWithExact() takes YOUR queries. in stzKnn
- SetApproximateTrees More trees, better recall, bigger index and a slower build. in stzKnn
- SetApproximateBudget Candidates examined per query before the true distances decide. 0 lets the engine scale it from k. This is the recall dial. in stzKnn
- SetChainToReturn controlling chain process in stzChainOfTruth
Removing
- WithoutStopwords The text with the stopwords removed. in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.WithoutStopwords() #--> Alice met Bob Paris weather finecomposed from the signature, run for this page - StripEdgePunct A word without clinging trailing punctuation ("empty?" -> "empty"). BYTE-based whole-mark matching (StzLeft/StzRight take byte counts while StzLen counts codepoints -- mixing them mangles multibyte words; exact byte-suffix comparison is UTF-8-safe). in stzNaturalEngine
composed example
o1 = new stzNaturalEngine("en", "", [], "") ? o1.StripEdgePunct("a") #--> acomposed from the signature, run for this page
Adding
- AddGolden goldens in stzDLM
Splitting and extracting
- ExtractParamsBackward VERB-FINAL grammar: the parameters precede their verb ("'.'" instead- of "'_'" put). Walk backward to the previous action/creation boundary collecting unconsumed literals, keep the LAST nParamCount in textual order, and mark them consumed so no later verb re-grabs them. in stzNaturalEngine
- Split deterministic head/tail split -- [ oTrain, oTest ] in stzTrainingSet
Converting
- ParseTree part-of-speech tagging (penn treebank) in stzText
composed example
o1 = new stzText("Alice met Bob in Paris. The weather was fine.") ? o1.ParseTree() #--> (S (NP Alice/NNP) (VP met/VBD (NP Bob/NNP) (PP in/IN (NP Paris/NNP))) (NP The/DT weather/NN) (VP was/VBD) fine/JJ)composed from the signature, run for this page - ToBracket rendering ------------------------------------------------------------ Penn Treebank bracket notation (leaves as word/TAG) in stzParseTree
composed example
o1 = new stzParseTree("S") ? o1.ToBracket() #--> /Scomposed from the signature, run for this page - ToTreeString an indented, human-readable tree in stzParseTree
composed example
o1 = new stzParseTree("S") ? o1.ToTreeString() #--> /Scomposed from the signature, run for this page - ParseTreeWithQ custom cascade: paGrammar = [ [ label, "TAG-pattern" ], ... ] in stzText
- ToGraph the learned model as a REAL stzGraph: decision nodes + labeled value edges + leaf nodes -- queryable like any other graph in stzDecisionTree
Showing, drawing and formatting
- ShowTagged Print each word with its part-of-speech tag. in stzText
- ShowEntities Print the named entities found in the text. in stzText
- ShowSentiment Print the sentiment of each sentence. in stzText
Reading and writing
- LoadFrom persistence (*.zdlm -- SELF-CONTAINED) --------------------------------- (extension ruling 2026-07-14: Softanza formats are z + a short abbreviation -- .zdlm, .zknw, .zcnv, .zrlz) LOAD the bundle back INTO this DLM -- the mirror of Save(), and the object's OWN act (named LoadFrom: 'Load' collides with Haro's keyword). in stzDLM
- ExportNeuralGguf export the trained neural rung as a real .gguf (the Foundry artifact) in stzDLM
- ExportToGguf R4 step 8 -- GGUF EXPORT: the trained network written in the format neural/ reads (arch 'stz-mlp'; tensors blk.N.weight [units x prev] row-major + blk.N.bias). Softanza writes what it reads -- the foundry's artifact loop closes. in stzNeuralNetwork
Walking and applying
- FilterByTypeQ Cuts the entities of one type into their own list -- an OBJECT, hence Q. For the plain data, EntitiesOfType() already answers. in stzListOfEntities
The explanations are the ones the library gives of itself, read from its documentation comments on 2026-10-01 04:14, from the library at commit 0e72e2e2c, by the library's own stzSelfDoc over 635 class sources.
The classes of this area
- stzQuestion · 1076 methods
- stzText · 82 methods
- stzNaturalEngine · 64 methods
- stzChainOfValue · 44 methods
- stzEntity · 35 methods
- stzListOfEntities · 29 methods
- stzDLM · 26 methods
- stzCorpus · 19 methods
- stzParseTree · 19 methods
- stzTruthChain · 16 methods
- stzKnn · 13 methods
- stzLogisticRegression · 11 methods
- stzChainOfTruth · 10 methods
- stzKMeans · 9 methods
- stzNeuralNetwork · 9 methods
- stzOrdinal · 9 methods
- stzDecisionTree · 8 methods
- stzNaiveBayes · 7 methods
- stzTrainingSet · 7 methods
- stzTrainer · 6 methods
- stzListOfTexts · 5 methods
- stzApriori · 4 methods
- stzKindConstraint · 4 methods
- stzSupposition · 4 methods
Narrations about this area
- From "Quick" to "Quickly": Programmatic Adverb Formation(opens in a new tab)
- Softanza: Functions as Linguistic Artifacts - A Comprehensive Narration(opens in a new tab)
- Writability vs. Readability of Computer Code— Softanza Asks: Why NOT Both?(opens in a new tab)
- Smart Adverb Generation in Softanza(opens in a new tab)
- Near-Natural Programming: Bridging Human Thought and Code Execution(opens in a new tab)
- Softanza Near-Natural Programming Tutorial(opens in a new tab)
- Probabilistic Quantifiers in Softanza: Natural Proportions Meet Logical Precision(opens in a new tab)
- Reaxis: A Natural Model for Reactive Programming in Haro, by Softanza(opens in a new tab)
- Natural Folder Navigation in Softanza(opens in a new tab)
- **Natural Language Programming, Reimagined: The `stzNatural` Class in Softanza**(opens in a new tab)
- Why I Built `stzNatural`: A Journey from Haro's NaturalLib to Softanza's Natural System(opens in a new tab)
- Walking at the Edge — A Naturally-Oriented and Practical Design(opens in a new tab)

