lookups

Highly optimized Trie/DAWG dictionary builder and lookups.

Explore on GitHub Read Hacker News discussions

2Distinct people

3Mentions

0Explicit recommenders

86GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

Highly optimized Trie/DAWG dictionary builder and lookups.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year3 dated mentions

Observed mentions: 2011-03-23 04:44:50 UTC to 2015-11-12 14:25:00 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
2011	2011-01-01 00:00:00 UTC	2012-01-01 00:00:00 UTC	2	2
2012	2012-01-01 00:00:00 UTC	2013-01-01 00:00:00 UTC	0	0
2013	2013-01-01 00:00:00 UTC	2014-01-01 00:00:00 UTC	0	0
2014	2014-01-01 00:00:00 UTC	2015-01-01 00:00:00 UTC	0	0
2015	2015-01-01 00:00:00 UTC	2016-01-01 00:00:00 UTC	1	1

What Hacker News says

3 sources

mckoss·Nov 12, 2015

Also called DAWGs (Directed Acyclic Word Graphs [1]). John Resig blogged about a similar problem 5 years ago, for which I wrote a JavaScript solution [2]. [1] https://en.m.wikipedia.org/wiki/Directed_acyclic_word_graph [2] https://github.com/mckoss/lookups

In Finite state machines as data structure for representing ordered sets and maps

mbrubeck·Mar 29, 2011

Right now, the only big speed advantage is in processor-intensive JavaScript. You can see this in any JS-intensive application. For example, run the performance tests here in Firefox vs. stock Android browser: http://lookups.pageforest.com/test/perf-test.html (These performance tests are based on a JS library to do efficient dictionary lookups; more info at https://github.com/mckoss/lookups) In other areas, like startup speed, we know that Firefox for Android is still catching up to other browsers. It's improved a lot over the last year, and we'll keep on improving it.

In Mozilla Launches Firefox 4 for Android

mckoss·Mar 23, 2011

This was a fun (and distracting) challenge. After a lot of iterations, I' think I've squeezed about as much compression and performance as I can. You can play with the Trie/DAWG generator here: http://lookups.pageforest.com Source and format documentation here: http://github.com/mckoss/lookups

In Revised JavaScript Dictionary Search