Substring Relation: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - ". ----" to ". ----") |
||
Line 8: | Line 8: | ||
** a [[Subset Relation]], for a [[set]]. | ** a [[Subset Relation]], for a [[set]]. | ||
* <B>See:</B> [[n-Gram]], [[Character n-Gram Feature]], [[Edit Distance Function]]. | * <B>See:</B> [[n-Gram]], [[Character n-Gram Feature]], [[Edit Distance Function]]. | ||
---- | ---- | ||
---- | ---- |
Latest revision as of 02:27, 24 September 2021
A Substring Relation is a string relation that signals whether one string can be transformed into another string (a substring) with the use of string deletion operations.
- Context:
- It can range from being a Contiguous Substring Relation to being a Noncontiguous Substring Relation.
- It can be used to define a Substring.
- …
- Counter-Example(s):
- a Subsequence Relation, for infinite strings (sequences).
- a Subset Relation, for a set.
- See: n-Gram, Character n-Gram Feature, Edit Distance Function.