Fix broken hosted-paper link and typos in topic READMEs (#894)

* Fix broken hosted-paper link and typos in topic READMEs

The FRP index links the hosted paper as
[Deprecating the Observer Pattern](deprecating-the observer-pattern.pdf).
The file on disk really is named with a space, but an unescaped space is not
allowed in a CommonMark link destination, so the entry renders as literal text
instead of a link. Percent-encode the space so it resolves to the committed PDF.

Also correct misspellings in paper titles and descriptions:

- Algorithims -> Algorithms (comp_sci_fundamentals_and_history)
- simplifed -> simplified (data_structures)
- sucessful -> successful, numberator -> numerator,
  demoninator -> denominator, authoratitative -> authoritative
  (information_retrieval)
- Expresions -> Expressions (logic_and_programming)
- represention -> representation (mathematics)
- Probablistic -> Probabilistic (robotics, sublinear_algorithms)
- Philppe -> Philippe (streaming_algorithms)

* Rename the Deprecating the Observer Pattern PDF to drop the space

Per review, renaming the file rather than percent-encoding the link.
This commit is contained in:
Toyeshh Medikonda
2026-09-29 04:45:39 -05:00
committed by GitHub
parent ed4bfd95f0
commit 9b92363eac
10 changed files with 11 additions and 11 deletions

View File

@@ -27,7 +27,7 @@ The included documents are
Engine) in the [Anatomy of a Large-Scale Hypertextual Web Search Engine]
http://infolab.stanford.edu/~backrub/google.html which assigned page ranks to
every webpage in the world wide web. Google is currently the most commercially
sucessful generic search engine in the world.
successful generic search engine in the world.
* [:scroll:](okapi-at-trec3.pdf) [Okapi at TREC3](http://trec.nist.gov/pubs/trec3/papers/city.ps.gz) - Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford
@@ -40,7 +40,7 @@ The included documents are
of picking a doc randomly and it containing that term :p(q) = n(q) / D,
where D is the number of documents. The information content based on
shannon's noisy channel model is = -log(p(q)) = log (D / n(q)). Smoothing
by adding a constant to both numberator and demoninator leads to IDF term
by adding a constant to both numerator and denominator leads to IDF term
used in BM25. BM25 has been shown to be one of the best probabilistic
weighting schemes. While the paper was in postscript form, the committer has
changed the format to pdf as per guidelines of papers we love via ps2pdf.
@@ -49,7 +49,7 @@ The included documents are
This paper introduces the **HITS algorithm**, a link analysis algorithm that rates webpages.
Unlike the more famous page rank algorithm, the hits algorithm makes a distinction between
webpage behavior classifies them as hubs and authorities. A page is authoratitative
webpage behavior classifies them as hubs and authorities. A page is authoritative
(in the sense the page has a large number of incoming links) or acts as a hub
(a directory of sort, which can be measured by the number of outgoing link).
The hits algorithm computes two scores for a page (authority and hub score) where