Efficient Lexical Encoding of Natural Language
Overview
This project developed and evaluated NLC (Natural Language Compression), a language-agnostic lexical text encoder optimized for natural language (NL). Efficient NL encoding is most applicable for bandwidth-constrained systems, including satellite text communication, backup/emergency low-bitrate communication systems, decentralized or post-disaster mesh network messaging, remote research, and other applications where reduced bandwidth is necessary for data reception or cost reduction. Unlike standard byte/character-oriented and general-purpose encoders, NLC encoded lexemes as single units. A lexeme was defined as a word, punctuation mark, word combination ("such as"), or word segment (-"ing"). NLC assigned identifiers to lexemes, which were variably encoded with bit-lengths proportional to its frequency in a user's isolect (derived from a corpus shared between encoder and decoder). NLC used contextual sub-lexicons to predict succeeding lexemes, analyzed standard usages of punctuation and spaces to implicitly encode whitespace characters from context, and morphologically segmented unknown words into sub-lexemes. Tests were individually performed on 1,757,861 sentences across seven languages, including English. In English, NLC encoded at a median of 2.47 BPC (Bits Per Character), Q1 2.18, and Q3 2.85. While some existing compression algorithms achieve lower benchmarked BPCs on large corpora, they are computationally intensive or degrade in efficiency on short messages. NLC is a lightweight encoder, suitable for underpowered devices, that would reduce transmission costs for short NL messages in bandwidth-limited environments. Future work will explore optimizing unusual NL usage, language-specific optimizations, and porting to lower-level programming languages.
Awards (1)
- Association for the Advancement of Artificial Intelligence: AAAI Student Memberships for each finalist that is part of the 1st, 2nd, and 3rd Prize Winning projects and 5 Honorable Mention winning projects (up to 3 students per project) (in-kind award / part of the 1st-3rd prize)
Competition history
- ISEF 2026
Resources
Related projects
ISEF · 2025
Efficient Lexical Encoding of Natural Language
CSEF · 2010
A Novel Approach to Text Compression Using N-Grams
CSEF · 2015
Text Compression Algorithm Based on Popularity Using Global English Dictionary
ISEF · 2020
Enhanced Lossless Data Compression Using Logistic Context Mixing and Predictive Analysis
CSEF · 2018
The Design of Algorithms to Encode English Text in Amino Acids Using Digital Data Compression Techniques
ISEF · 2023
Dimensionality Reduction and Optimization of the GloVe Words Database Using Principal Component Analysis and Birch Clustering
CSEF · 2010
Linguistic Creativity and the Zipfian Distribution: An Entropic, Stylometric, and Computational Analysis
JSHS · 2022
“Minimally Calibrated High Performance Communication Interfaces for the Neurologically Impaired”: New Directions Using Language Models
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair