Wolfram Research
Mathematica
MathWorld
Wolfram Science
More »
HOME
TOPICS
LATEST
ABOUT
FAQS
PARTICIPATE
AUTHORING AREA
Redundancy in Written Language
Languages have different levels of redundancy. Move the slider to remove increasing numbers of letters. Some languages remain readable even after removing a significant portion of the letters, while others become unreadable much sooner.
Contributed by:
Kovas Boguta
and
Fred Meinberg
Show Initialization Code
(34 lines omitted)
X
X
X
Cryptography and Cryptanalysis
(
NKS|Online
)
"
Redundancy in Written Language
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/RedundancyInWrittenLanguage/
Contributed by:
Kovas Boguta
and
Fred Meinberg
Report an issue »
Coding Theory
Cryptography
Data Compression
Linguistics
Perception
Statistics
High School Mathematics
High School Statistics
Puzzles and Recreations: Advanced
School Language Arts
School Puzzles and Recreations
Browse all topics
Browse all education topics
Frequencies of Character Pairs
Letter Highlighting in Text
Readable Mess between First and Last Letters
Compressed Constrained Cellular Automaton Initialization
De Bruijn Graph Arcs
Binary Run-Length Encoding
Oriented Run-Length Compression
Hackers Language
Chinese Remainder Theorem
Edit Distance
Email
Link to URL
Embed
Bookmark
Make a new version of this Demonstration
Upload a new Demonstration
Note: To run this Demonstration you need the free
Mathematica Player
or
Mathematica 7+
Download or upgrade to
Mathematica Player 7
I already have
Mathematica Player
or
Mathematica 7+