Structural properties of the string statistics problem
Journal of Computer and System Sciences
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Theoretical Computer Science
Discovering characteristic expressions in literary works
Theoretical Computer Science
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Mining from Literary Texts: Pattern Discovery and Similarity Computation
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Theoretical Computer Science
Hi-index | 0.00 |
The class of pattern languages was introduced by Angluin (1980), and a lot of studies have been undertaken on it from the theoretical viewpoint of learnabilities. However, there have been few practical studies except for the one by Shinohara (1982), in which patterns are restricted so that every variable occurs at most once. In this paper, we distinguish repetitive variables from those occurring only once within a pattern, and focus on the number of occurrences of a repetitive-variable and the length of strings it matches, in order to model the rhetorical device based on repetition of words in classical Japanese poems. Preliminary result suggests that it will lead to characterization of individual anthology, which has never been achieved, up till now.