The Underground Railroad (book)

The Underground Railroad Records is an 1872 book by William Still, who is known as the Father of the Underground Railroad. It is subtitled A record of facts, authentic narratives, letters, &c., narrating the hardships, hair-breadth escapes and death struggles of the slaves in their efforts for freedom, as related by themselves and others, or witnessed by the author; together with sketches of some of the largest stockholders, and most liberal aiders and advisers, of the road.

The book chronicles the stories and methods of some 649 slaves who escaped to freedom via the Underground Railroad. Still[1] assembled his carefully compiled and detailed documentation about those that he had helped escape into the pages of The Underground Railroad Records.

Selection of freemen whose narratives are included

gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
gollark: Perhaps it is also possible to construct some sort of regex/deterministic finite automaton to match things matching anagramatically.

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.