Compute the frequency distribution of a search term in a series of texts. For example, Arthur Conan Doyle wrote a total of 60 Sherlock Holmes stories, comprised of 54 short stories and 4 longer novels. I wanted to test my own subjective impression that, in many of the stories, Sherlock Holmes' popularity was used as bait to induce the reader to read a story that is essentially not primarily a Sherlock Holmes story. I used the term "Holmes" as a search pattern, since Watson would frequently address him by name, or use his name to describe something that he was doing. My hypothesis is that the frequency distribution of the search pattern "Holmes" is a good proxy for the degree to which a story is or is not truly a Sherlock Holmes story. The results are presented in a manuscript that is available as a vignette and online at <https://barryzee.github.io/Concordance/index.html>.
Version: 1.0.1 Depends: R (≥ 4.2.0) Imports: qpdf, stringr, dpseg, tableHTML, plotrix, zoo, stargazer, utils, graphics, grDevices, stats, textBoxPlacement, plot.matrix, devtools Suggests: knitr, rmarkdown, testthat (≥ 3.0.0) Published: 2023-03-28 DOI: 10.32614/CRAN.package.SherlockHolmes Author: Barry Zeeberg [aut, cre] Maintainer: Barry Zeeberg <barryz2013 at gmail.com> License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] NeedsCompilation: no CRAN checks: SherlockHolmes results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=SherlockHolmes to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4