Examples: visualization, C++, networks, data cleaning, html widgets, ropensci.

Found 237 packages in 0.02 seconds

yasp — by Tomasz Kalinowski, 8 years ago

String Functions for Compact R Code

A collection of string functions designed for writing compact and expressive R code. 'yasp' (Yet Another String Package) is simple, fast, dependency-free, and written in pure R. The package provides: a coherent set of abbreviations for paste() from package 'base' with a variety of defaults, such as p() for "paste" and pcc() for "paste and collapse with commas"; wrap(), bracket(), and others for wrapping a string in flanking characters; unwrap() for removing pairs of characters (at any position in a string); and sentence() for cleaning whitespace around punctuation and capitalization appropriate for prose sentences.

runes — by Bryan Jenks, 6 years ago

Convert Strings to Elder Futhark Runes

Convert a string of text characters to Elder Futhark Runes < https://en.wikipedia.org/wiki/Elder_Futhark>.

cowsay — by Scott Chamberlain, 6 months ago

Messages, Warnings, Strings with Ascii Animals

Allows printing of character strings as messages/warnings/etc. with ASCII animals, including cats, cows, frogs, chickens, ghosts, and more.

diffmatchpatch — by Colin Rundel, 5 years ago

String Diff, Match, and Patch Utilities

A wrapper for Google's 'diff-match-patch' library. It provides basic tools for computing diffs, finding fuzzy matches, and constructing / applying patches to strings.

epoxy — by Garrick Aden-Buie, 3 years ago

String Interpolation for Documents, Reports and Apps

Extra strength 'glue' for data-driven templates. String interpolation for 'Shiny' apps or 'R Markdown' and 'knitr'-powered 'Quarto' documents, built on the 'glue' and 'whisker' packages.

RapidFuzz — by Andre Leite, a month ago

String Similarity Computation Using 'RapidFuzz'

Provides a high-performance interface for calculating string similarities and distances, leveraging the efficient library 'RapidFuzz' < https://github.com/rapidfuzz/rapidfuzz-cpp>. This package integrates the 'C++' implementation, allowing 'R' users to access cutting-edge algorithms for fuzzy matching and text analysis. Supported metrics include Levenshtein, Damerau-Levenshtein, Hamming, Jaro, Jaro-Winkler, Longest Common Subsequence (LCS), Optimal String Alignment (OSA), Indel, Prefix, and Postfix distances and similarities, as well as multiple fuzzy matching ratios.

stringb — by Peter Meissner, 5 years ago

Convenient Base R String Handling

Base R already ships with string handling capabilities 'out- of-the-box' but lacks streamlined function names and workflow. The 'stringi' ('stringr') package on the other hand has well named functions, extensive Unicode support and allows for a streamlined workflow. On the other hand it adds dependencies and regular expression interpretation between base R functions and 'stringi' functions might differ. This packages aims at providing a solution to the use case of unwanted dependencies on the one hand but the need for streamlined text processing on the other. The packages' functions are solely based on wrapping base R functions into 'stringr'/'stringi' like function names. Along the way it adds one or two extra functions and last but not least provides all functions as generics, therefore allowing for adding methods for other text structures besides plain character vectors.

heck — by Dyfan Jones, a year ago

Highly Performant String Case Converter

Provides a case conversion between common cases like CamelCase and snake_case. Using the 'rust crate heck' < https://github.com/withoutboats/heck> as the backend for a highly performant case conversion for 'R'.

acss.data — by Henrik Singmann, a year ago

Data Only: Algorithmic Complexity of Short Strings (Computed via Coding Theorem Method)

Data only package providing the algorithmic complexity of short strings, computed using the coding theorem method. For a given set of symbols in a string, all possible or a large number of random samples of Turing machines (TM) with a given number of states (e.g., 5) and number of symbols corresponding to the number of symbols in the strings were simulated until they reached a halting state or failed to end. This package contains data on 4.5 million strings from length 1 to 12 simulated on TMs with 2, 4, 5, 6, and 9 symbols. The complexity of the string corresponds to the distribution of the halting states of the TMs.

String2AdjMatrix — by Tom Drake, 8 years ago

Creates an Adjacency Matrix from a List of Strings

Takes a list of character strings and forms an adjacency matrix for the times the specified characters appear together in the strings provided. For use in social network analysis and data wrangling. Simple package, comprised of three functions.