Computing with descriptive and veristic words
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Computing with words [Zadeh, 1995] is fundamental to our understanding the foundation of fuzzy theory. Naturally, there are a large variety of "words" that we need to recognize and utilize in our computational paradigms. However, descriptive and veristic words are essential for the fundamental derivation of fuzzy set and logic formulas. Descriptive linguistic terms help us assign an element to a fuzzy set with a membership value. Whereas the veristic words determine the degree of truthhood associated with a descriptive membership value. Understanding this distinction between descriptive and veristic linguistic terms form the basis of deriving the normal forms of fuzzy set and logic formulas. Within this perspective, there are potentially four possible fuzzy set and logic theories. Each of these has their own unique formulas. Most of the current literature is based on a "myopic" theory which is an approximation of the fuzzy set and two-valued logic based formalism. These issues are presented in our attempt toward restructuring the foundations of fuzzy theory.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it