[BAR07b] Multi-Grain Relations
Conférence Internationale avec comité de lecture :
CIAA'07 Int. Conf. on Implementation and Application of Automata, Prague (Rep. Tchèque),
January 2007,
Vol. 4783,
pp.243-252,
Series LNCS,
motcle:
Résumé:
In this paper, a subclass of rational relations is defined for which
there is not only a global correspondence between strings of a given
tuple, but also a structured correspondence between substrings.
This structure is denoted in strings using postfixed inner-node
markers. These relations are closed under rational operations. Some
additional conditions are defined to obtain also a closure under
intersection. This approach is interesting for applications where
several level of analysis are relevant. An example in Natural
Language Processing is given.