A Native Speaker

Intro To Recursion: Recursive Types

Intro to Recursion: Factorial
Here’s a quick and dirty animation of a recursive definition of factorial. Pink represents the current computation.

Intro to Recursion: Factorial

Here’s a quick and dirty animation of a recursive definition of factorial. Pink represents the current computation.

C to ASM to OBJECT : Expansion & Compression
Another view. Not only can physical interactions be compressed into a symbolic notation, symbolic notation can be unwound into execution.

to ASM to OBJECT : Expansion & Compression

Another view. Not only can physical interactions be compressed into a symbolic notation, symbolic notation can be unwound into execution.

C to ASM to OBJECT : Abstraction & Compilation
Here’s a side-by-side comparison of the compilation from C source code to machine code. The graphic tries to showcase the powerful concepts of compression, representation, and abstraction - in this case, the abstraction on electrical impulses into symbolic language.

C to ASM to OBJECT : Abstraction & Compilation

Here’s a side-by-side comparison of the compilation from C source code to machine code. The graphic tries to showcase the powerful concepts of compression, representation, and abstraction - in this case, the abstraction on electrical impulses into symbolic language.

Microproject: jPanes. 
Windows that are draggable and resizable have outlived their usefulness. A couple hundred lines of code define a lightweight app that lets a user open a set of browser windows in preset configurations, mitigating the hassle of managing and tracking multiple browser window locations and positions.

Microproject: jPanes. 

Windows that are draggable and resizable have outlived their usefulness. A couple hundred lines of code define a lightweight app that lets a user open a set of browser windows in preset configurations, mitigating the hassle of managing and tracking multiple browser window locations and positions.

Here’s some sample output from the first iteration of Reify. The above is the first five chapters of Moby Dick, passed through the program with present tense verbs highlighted in orange, past tense verbs highlighted in red, and singular nouns highlighted in dark gray, then compressed into a bitmap where each bit represents a lexical token. The input was 69489 characters of plaintext (approximately 12000 words, or 24 pages of 12pt, monospaced text). It took the program slightly under 10 seconds to parse the input and return the above.

Here’s some sample output from the first iteration of Reify. The above is the first five chapters of Moby Dick, passed through the program with present tense verbs highlighted in orange, past tense verbs highlighted in red, and singular nouns highlighted in dark gray, then compressed into a bitmap where each bit represents a lexical token. The input was 69489 characters of plaintext (approximately 12000 words, or 24 pages of 12pt, monospaced text). It took the program slightly under 10 seconds to parse the input and return the above.

TeleGeography Maps

Global Internet Map

As a fan of signal processing and networking, let me say, you will not be disappointed.

A second, responsive interface paradigm for Reify.

Potential interface paradigms for Reify.

Reify: A Natural Language Syntax Highlighter

A given text is a conjunct of semantic meaning filtered through syntactic structures. What if, as a reader, it was easy to quickly and naturally switch between those levels of abstraction in a text? Reify is a proposed tool that processes natural language according to various sorting paradigms, in order to highlight the syntactic structures controlling and pinning a text. It’s syntax highlighting for English, reifying semantic words into syntactic objects, vertices that define syntactic vectors in a text.