greedy_match {triebeard} | R Documentation |
Greedily match against a tree
Description
greedy_match
accepts a trie and a character vector
and returns the values associated with any key that is "greedily" (read: fuzzily)
matched against one of the character vector entries.
Usage
greedy_match(trie, to_match, include_keys = FALSE)
Arguments
trie |
a trie object, created with |
to_match |
a character vector containing the strings to check against the trie's keys. |
include_keys |
a logical value indicating whether to include the keys in the returned results or not. If TRUE (not the default) the returned object will be a list of data.frames, rather than of vectors. |
Value
a list, the length of to_match
, with each entry containing any trie values
where the to_match
element greedily matches the associated key. In the case that
nothing was found, the entry will contain NA
. In the case that include_keys
is TRUE, the matching keys will also be included
See Also
longest_match
and prefix_match
for longest and prefix matching, respectively.
Examples
trie <- trie(keys = c("afford", "affair", "available", "binary", "bind", "blind"),
values = c("afford", "affair", "available", "binary", "bind", "blind"))
greedy_match(trie, c("avoid", "bring", "attack"))