Abstract
We propose pivotal synchronization languages (PSLs) that represent alignments of parallel processes. PSLs are closely related to synchronization languages [10], but the strings in PSLs are partitioned into sequences of pivots. In the partitioned representation, each pivot gathers and aligns simultaneous process boundaries (starts and terminations). The paper demonstrates that PSLs (and new join operators) provide a unified framework for implementing some independent formalisms. In particular, we show that at least two existing formalisms, generalized synchronization expressions [10] and interleave-disjunction-lockexpressions [8] have PSL-based counterparts. Furthermore, we sketch tentatively a new formalism that adapts the ideas of the operator of generalized restriction [11] to PSLs. All this suggests that the union of these formalisms might be implementable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and Computation 181, 57–74 (2003)
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)
Bird, S., Ellison, T.M.: One-level phonology: Autosegmental representations and rules as finite automata. Computational Linguistics 20(1), 55–90 (1994)
Bird, S., Liberman, M.: A formal framework for linguistic annotation. Speech Communication 33, 23–60 (2001)
Hélary, J.M., Mostefaoui, A., Raynal, M.: Interval consistency of asynchronous distributed computations. Journal of Computer and System Sciences 64, 329–349 (2002)
Kiraz, G.A.: Multitiered nonlinear morphology using multitape finite automata: A case study on Syriac and Arabic. Computational Linguistics 26(1), 77–105 (2000)
Koskenniemi, K.: Two-level morphology: a general computational model for word-form recognition and production. Publications of the Department of General Linguistics, vol. 11, University of Helsinki, Yliopistopaino, Helsinki (1983)
Nederhof, M.-J.: IDL-expressions: A formalism for representing and parsing finite languages in natural language processing. Journal of Artificial Intelligence Research 21, 287–317 (2004)
Ryl, I., Roos, Y., Clerbot, M.: About synchronization languages. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 533–542. Springer, Heidelberg (1998)
Salomaa, K., Yu, S.: Synchronization expressions with extended join operation. Theoretical Computer Science 207, 73–88 (1998)
Yli-Jyrä, A.M., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: Cleophas, L., Watson, B.W. (eds.) The Eindhoven FASTAR Days, Proceedings, Computer Science Reports 04/40, Technische Universiteit Eindhoven, Eindhoven, The Netherlands, September 3–4 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yli-Jyrä, A., Niemi, J. (2006). Pivotal Synchronization Languages: A Framework for Alignments. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_26
Download citation
DOI: https://doi.org/10.1007/11780885_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35467-3
Online ISBN: 978-3-540-35469-7
eBook Packages: Computer ScienceComputer Science (R0)