I Built a Meaning Engine Without Neural Networks

· Source: Naturallanguageprocessing on Medium · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Software Development & Engineering · Depth: Intermediate, short

Summary

A novel "meaning engine" has been developed that learns semantic relationships without relying on neural networks, transformers, or gradient descent. Instead, it builds an inspectable graph of word co-occurrence patterns, weighted by Pointwise Mutual Information (PMI), using a 2-bit ternary {-1, 0, +1} connection system. Trained on dictionaries and 65 public domain books, the system successfully learned word meanings, discovered 247 suffixes and 38 prefixes in Turkish morphology, and established cross-language bridges between English and Turkish with an average Jaccard similarity of 0.47 and a cosine bridge of 0.61 for 10 word pairs. Crucially, it outputs 0 when evidence is insufficient, indicating "I don't know" rather than hallucinating. This experimental system, which processed 1,234,706 sentences and identified 288,407 concepts with ~1.3 GB peak RAM, challenges the dominant "bigger models" AI narrative.

Key takeaway

For AI Architects or Machine Learning Engineers exploring alternatives to large language models for semantic understanding, this "meaning engine" offers a compelling architectural shift. You should consider its graph-based, non-neural approach for applications requiring inspectable relationships, explicit uncertainty handling, or low resource footprints. This system demonstrates that complex linguistic insights, including cross-language bridges and morphology, can emerge from simple co-occurrence patterns, challenging the assumption that scale is the sole path to advanced AI capabilities.

Key insights

A non-neural network "meaning engine" learns semantics via co-occurrence graphs, offering inspectable relationships and explicit uncertainty.

Principles

Method

The system builds a navigable graph by observing word co-occurrences, weighting connections with Pointwise Mutual Information (PMI), and using a 2-bit ternary {-1, 0, +1} state for relationships.

In practice

Topics

Code references

Best for: NLP Engineer, Research Scientist, AI Scientist, Machine Learning Engineer, AI Architect

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Naturallanguageprocessing on Medium.