A suite of functions that allow a full, fast, and efficient Bayesian treatment of the Bradley--Terry model. 
             Prior assumptions about the model parameters can be encoded through a multivariate normal prior distribution. 
             Inference is performed using a latent variable representation of the model.

Label, recode, rename, and convert datasets and ASCII files more efficiently. 'speedycode' automates the code necessary for labeling variables with the 'labelled' package, recoding and renaming variables with 'dplyr' syntax, and converting ASCII files with the 'readroper' package. Most functions require only the name of the dataset and the code will be automatically written. Some convenience functions useful for converting ASCII files are also included.

Import classification results from the 'RDP Classifier' (Ribosomal Database Project),' 'USEARCH sintax,' 'vsearch sintax' and the 'QIIME2' (Quantitative Insights into Microbial Ecology) classifiers into 'phyloseq' tax_table objects.

Functions for fitting semiparametric regression models for
        panel count survival data. An overview of the package can be found 
        in Wang and Yan (2011) <doi:10.1016/j.cmpb.2010.10.005> and
	Chiou et al. (2018) <doi:10.1111/insr.12271>.

Performs estimation and testing of the treatment effect in a 2-group randomized clinical trial with a quantitative, dichotomous, or right-censored time-to-event endpoint. The method improves efficiency by leveraging baseline predictors of the endpoint. The inverse probability weighting technique of Robins, Rotnitzky, and Zhao (JASA, 1994) is used to provide unbiased estimation when the endpoint is missing at random.

A set of functions for computing potential evapotranspiration and several widely used drought indices including the Standardized Precipitation-Evapotranspiration Index (SPEI).

Corrects the spelling of a given word in English 
    using a modification of Peter Norvig's spell correct 
    algorithm (see <http://norvig.com/spell-correct.html>) 
    which handles up to three edits. The algorithm tries to 
    find the spelling with maximum probability of intended
    correction out of all possible candidate corrections from
    the original word.