“Greedy string search” performs a search that allows characters (as well as word boundaries) to intervene between parts of the search string.
The interface has a box for entering the number of characters that are
allowed to intervene between the segmentations of words with the search.
The number for intervening characters is set to “0” by default.
Failure to set the number to a value greater than “0” makes Greedy string search no greedier than Basic string search.
For example, a “Liberal”
Greedy string search with intervening characters set at “0”
will return the same results as a “Liberal” Basic string search.
Submitting a search string brings up search results.
Immediately following each entry is a link to the tree for that entry in the form of the ID number for that entry.
Following the link opens a tree view for the result.
Beneath the search results,
there is a button that allows you to download all the results of the search in a comma-separated values (.csv) format.
The interface allows for four interpretations of what is entered as a search string,
with radio buttons to select between
“Liberal”,
“Character”,
“Mine”,
and
“Strict”.
-
The default
“Character”
triggers a
search
with no constraints on the segmentation of matched results
other than that the left-most character
of the search string should correspond to the start of a word
while the right most character
should be the end of a word.
As a consequence the string “123” becomes a search for the
segmentations of
[1][2][3],
[12][3],
[1][23],
and
[123].
-
With “Liberal”
there is the same interpretation as when “Character” is selected,
but without the requirements
that the first character should be preceeded by a word boundary
and the last character should be followed by a word boundary.
As a consequence the string “123” becomes a search for the
segmentations of
[(...)1][2][3(...)],
[(...)12][3(...)],
[(...)1][23(...)],
and
[(...)123(...)].
-
Choice of “Strict”
enforces the exact segmentation that the user provides.
Adding a character space between characters indicates a word boundary.
Thus the search string “123” can only find [123],
while “12 3”,
with a character space between “12” and
“3”,
can only find [12][3].
For a string search consisting of a single character,
“Character” and
“Strict”
yield the same results.
-
Choice of
“Mine” gives a version of
“Strict”
but without the requirement
that left and right edges of the search string should invoke word boundaries.
Thus the search string “123” yields [(...)123(...)],
while “12 3”,
with a character space between “12” and
“3”,
yields [(...)12][3(...)].