Text Inclusion Analysis, include matched word level longest common subsequence #92
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
@mgrange1998 has exported this pull request. If you are a Meta employee, you can view the originating Diff in D89493658. |
meta-cla
bot
added
the
CLA Signed
mgrange1998
force-pushed
the
export-D89493658
branch
from
47e38fa to
80f9b4a
Compare
mgrange1998
added a commit
to mgrange1998/PrivacyGuard-1
that referenced
this pull request
Jan 27, 2026
…bsequence (facebookresearch#92) Summary: This diff adds support to text inclusion analysis node for returning the matched text from word level longest common subsequence. This allows us to inspect the matched text, and find the length of the matched text compared to the target and generated text. Reviewed By: lucamelis Differential Revision: D89493658
… cleaned text (facebookresearch#93) Summary: This adds supported for removing consecutive whitespace before comparing text inclusion. Example: ``` I ate \n the apple => I ate the apple ``` Would not match as equal to, as the new line would map to another space. ``` I ate the apple ``` This diff adds support for squashing consecutive whitespace after the filtering so verbatim text is matched correctly. Reviewed By: lucamelis Differential Revision: D89493643
…bsequence (facebookresearch#92) Summary: This diff adds support to text inclusion analysis node for returning the matched text from word level longest common subsequence. This allows us to inspect the matched text, and find the length of the matched text compared to the target and generated text. Reviewed By: lucamelis Differential Revision: D89493658
mgrange1998
force-pushed
the
export-D89493658
branch
from
80f9b4a to
b39d79d
Compare
|
This pull request has been merged in 1dcc960. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary: This diff adds support to text inclusion analysis node for returning the matched text from word level longest common subsequence. This allows us to inspect the matched text, and find the length of the matched text compared to the target and generated text.
Differential Revision: D89493658