This page provides
a string search
that returns displayed tree fragments for how the search string was annotated
together with an associated count.
Clicking on the count opens links to view the full trees.
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(...)].