nowfound

Life & fun · February 8, 2016

LB

Liber Brunoniana – Hacking a Better Encyclopedia

Liber Brunoniana – Hacking a Better Encyclopedia launched on February 8, 2016 with 23 votes, #1,890 of 4,386 launches that month and more than 75% of that year's launches. The site was still online in September 2026, 10 years on.

In plain words

Liber Brunoniana transforms Martha Mitchell's 1993 Encyclopedia Brunoniana into a searchable digital resource using natural language processing. The project automatically creates over 5,000 hyperlinks between articles, organizes content into categories, and generates year-by-year event pages. Researchers and Brown University community members can browse the encyclopedia through its complete article index or by topic, making Brown's institutional history more accessible and interconnected than the original printed reference work.

written from the facts on this page · September 2026

From the sources

Since its publication in 1993, Martha Mitchell's 629 page Encyclopedia Brunoniana has served as the definitive reference work of Brown University's history. The Liber Brunoniana project utilizes natural language processing techniques to transform Mitchell's text into hypertext, automatically inferring over 5,000 hyperlinks between articles, deliminating content into categories, and constructing pages detailing the events of each year mentioned in the encyclopedia. The encyclopedia may be browsed from its complete index of articles , or by topic. For more information about the creation of Liber Brunoniana , see the Liber Brunoniana pagefrom liber-brunoniana.github.io

Does a similar job

all alternatives →
  • WikiBinge – discover how all things are vaguely connected2023 · wikibinge.com · ▲246

    Connect two articles on Wikipedia, but do it the long way. I've always been a fan of the theory of six degree of separation, but it's an overused concept when exploring the Wiki-graph. Instead of showing the shortest path, which in my opinion is "boring" and ends up connecting super-important central articles, I came up with my own method: WikiBinge selects the smaller, less represented articles on Wikipedia. In a WikiBinge path, the underdogs are the kings! How does it work? It's pretty straightforward! Compute PageRank on the Wiki-graph and assign as weight of each edge the PageRank value…

  • GrokipediaOct 2025 · grokipedia.com · ▲283

    Elon's answer to Wikipedia

  • I mapped HN's favorite books with GPT-4o2024 · hnbooks.pieterma.es · ▲285

    Hey HN! I love finding new books to read on here. I wanted to gather the most mentioned books and recreate the serendipity of physical browsing. I scraped 20k comments from HN threads related to reading, extracted the references and opinions using GPT-4o mini, and visualised their embeddings as a map. - OpenAI's embeddings were processed using UMAP and HDBSCAN. A direct 2D projection from the text embeddings didn't yield visually interesting results. Instead, HDBSCAN is first applied on a high-dimensional projection. Those clusters tend to correspond to different genres. The genre…

  • Now I Get It – Translate scientific papers into interactive webpagesFeb 2026 · nowigetit.us · ▲305

    Understanding scientific articles can be tough, even in your own field. Trying to comprehend articles from others? Good luck. Enter, Now I Get It! I made this app for curious people. Simply upload an article and after a few minutes you'll have an interactive web page showcasing the highlights. Generated pages are stored in the cloud and can be viewed from a gallery. Now I Get It! uses the best LLMs out there, which means the app will improve as AI improves. Free for now - it's capped at 20 articles per day so I don't burn cash. A few things I (and maybe you will) find interesting: * This is…

  • TA
  • Kooba2017 · ▲141

    An interactive graph for finding new books

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, February 2016

the whole month →