تحقق هذه الورقة في حدود القدرة الإنتاجية للعمليات الإنتاجية، من خلال التركيز على تعقيد المحاكمة العودية في سياقات التنسيق باللغة الإنجليزية (فاجنر، 2010).على الرغم من أن جميع العمليات الصوتية والعمليات الأكثر برودايا هي لغات سلسلة منتظمة حيسانية، نوضح أن المحاصيل العودية ليست كذلك.هي لغة سلسلة الإخراج هي بدلا من ذلك موازية خالية من السياق (Seki et al.، 1991).نحن نقيم تعقيد النمط على السلاسل، ثم انتقل إلى توصيف على الأشجار التي تتطلب عبواب محولات الأشجار متعددة أعلى.عند القيام بذلك، نحن نقدم أساسا للتحقيقات المحددة في المستقبل في مجال بناء جملة البياضات.
This paper investigates bounds on the generative capacity of prosodic processes, by focusing on the complexity of recursive prosody in coordination contexts in English (Wagner, 2010). Although all phonological processes and most prosodic processes are computationally regular string languages, we show that recursive prosody is not. The output string language is instead parallel multiple context-free (Seki et al., 1991). We evaluate the complexity of the pattern over strings, and then move on to a characterization over trees that requires the expressivity of multi bottom-up tree transducers. In doing so, we provide a foundation for future mathematically grounded investigations of the syntax-prosody interface.
References used
https://aclanthology.org/
Paraphrases refer to texts that convey the same meaning with different expression forms. Pivot-based methods, also known as the round-trip translation, have shown promising results in generating high-quality paraphrases. However, existing pivot-based
Most existing simultaneous machine translation (SiMT) systems are trained and evaluated on offline translation corpora. We argue that SiMT systems should be trained and tested on real interpretation data. To illustrate this argument, we propose an in
Recent knowledge graph embedding (KGE) models based on hyperbolic geometry have shown great potential in a low-dimensional embedding space. However, the necessity of hyperbolic space in KGE is still questionable, because the calculation based on hype
Static knowledge graph (SKG) embedding (SKGE) has been studied intensively in the past years. Recently, temporal knowledge graph (TKG) embedding (TKGE) has emerged. In this paper, we propose a Recursive Temporal Fact Embedding (RTFE) framework to tra
Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for finite-state model of its morpho-syntax and morphophonology: how to manage the fu