BibTex RIS Cite

Türkçe Metinler için Olay Sıralaması

Year 2011, Volume: 4 Issue: 1 - Volume: 4 Issue: 1, - , 24.06.2016

Şadi Evren Şeker Banu Diri

Abstract

Bu çalışmanın amacı, doğal dilde hazırlanan metinlerin içerisinde geçen olayları sıralı göstermek için kullanılan sistemlerin, Türkçe için genişletilmesidir. Günümüzde doğal dildeki metinler üzerinde, doğal dil işlemesi yapılarak çıkarılan anlambilimsel gösterimlerin, olaylar arasındaki zamansal bağlantıyı göstermesi için veya işlenen doğal dildeki metinde bulunan olayları sıralaması için, ilave işlemler gerekmektedir. Bu işlemlerin sistematik olarak dilbilimsel bir temele oturtulmasını sağlayan başta İngilizce olmak üzere çeşitli dillerde çalışmalar bulunmaktadır.Her dilde ortak olan zamansal mantıklara ilave olarak, her dilin kendisine özgü bazı farklı zamansal özellikleri de bulunmaktadır. Bu çalışma kapsamında öncelikle literatürde bulunan zamansal mantıklar incelenmiştir. Bu mantıklardan, doğal dil için kullanımı öne çıkan bazıları, daha sonra hesaplanabilir dillere dönüştürülebilmektedir. Bu hesaplanabilir diller ve dayandıkları mantıklar incelenerek, Türkçe TimeML üzerinden iyileştirme yapılmıştır.

Keywords

Olay Sıralama Kronoloji Çıkarımı Zamansal Mantıklar İşlenebilir Zamansal Diller

References

  • [1] Pnuelı, A. (1971) The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (Providence, RI.). IEEE, New York, pp. 46-57.
  • [2] Rosner, R. And Pnuelı, A. (1986). A choppy logic. In Proceedings of the First IEEE Symposium on Logic in Computer Science, IEEE Press, Piscataway, NJ, 306–313.
  • [3] Clarke, E. M., Emerson, E. A., And Sıstla, A. P., (1986). Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2 (Apr. 1986), 244–263.
  • [4] Clarke, E. M. And Grumberg, O. (1987). The model checking problem for concurrent systems with many similar processes. In Proceedings of the International Conference on Temporal Logic in Specification (Altrincham, UK, Apr. 8–10), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York, NY, 188–201.
  • [5] Stırlıng, C. (1987). Comparing linear and branching time temporal logics. In Proceedings of the International Conference on Temporal Logic in Specification (Altrincham, UK, Apr. 8–10), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York, NY, 1–20.
  • [6] Ben-Arı, M., Pnuelı, A., And Manna, Z. (1983). The temporal logic of branching time. Acta Inf. 20.
  • [7] Halpern, J., Manna, Z., And Moszkowskı, B. (1983). A hardware semantics based on temporal intervals. In Proceedings of the Tenth Colloquium on Automata Languages and Programming (Barcelona, Spain, July), J. Diaz, Ed. Springer-Verlag, New York.
  • [8] Moszkowskı, B. And Manna, Z. (1984). Reasoning in interval logic. In Proceedings of the ACM/NSF/ONR Workshop on Logics of Programs, Springer-Verlag, Secaucus, NJ, 371–384.
  • [9] Moszkowskı, B. C. (1986). Executing temporal logic programs. Ph.D. Dissertation. Cambridge University Press, New York, NY.
  • [10] Mellıar-Smıth, P. M. (1987). Extending interval logic to real time systems. In Proceedings of the Conference on Temporal Logic Specification (UK, Apr.), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer-Verlag, New York, 224–242.
  • [11] Schwartz, R. L., Mellıar-Smıth, P. M., And Vogt, F. H. (1983). An interval logic for higherlevel temporal reasoning. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing (Aug.), ACM Press, New York, NY, 173–186.
  • [12] Razouk, R. And Gorlıck, M. (1989). Real-time interval logic for reasoning about executions of realtime programs. SIGSOFT Softw. Eng. Notes 14, 8 (Dec. 1989), 10–19.
  • [13] Allen, J. F. (1984). A General Model of Action and Time. Artificial Intelligence 23, 2, July 1984.
  • [14] Reıchenbach, H., (1947). Elements of Symbolic Logic, New York: Macmillan
  • [15] Pustejovsky, J., Castaño, J., Ingria, R., Aurí, R., Gaizauskas, R., Setzer, A. And Katz, G., (2003). TimeML: Robust Specification of Event and Temporal Expressions in Text. IWCS-5, Fifth International Workshop on Computational Semantics

Event Ordering in Turkish Texts

Year 2011, Volume: 4 Issue: 1 - Volume: 4 Issue: 1, - , 24.06.2016

Şadi Evren Şeker Banu Diri

Abstract

Aim of this study is advancing current event ordering methodologies to cover Turkish temporal logic. Currently, some additional operations are required to demonstrate the relation between events or ordering events in a natural language text, after outputting the semantical representation. There are some systematic studies based on English temporal logic and covering most of the Latin family. There are some differences between temporal logics in the languages in addition to common temporal properties.In this study, the temporal logics in the literature are researched. Some of these temporal logics are suitable for machine computation and some are suitable for natural language processing. An optimization is suggested on these computable and natural laguage processing suitable temporal logics to cover Turkish temporal logic.

Keywords

Event Ordering Chronology Extraction Temporal Logic Computable Temporal Languages TimeML

References

  • [1] Pnuelı, A. (1971) The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (Providence, RI.). IEEE, New York, pp. 46-57.
  • [2] Rosner, R. And Pnuelı, A. (1986). A choppy logic. In Proceedings of the First IEEE Symposium on Logic in Computer Science, IEEE Press, Piscataway, NJ, 306–313.
  • [3] Clarke, E. M., Emerson, E. A., And Sıstla, A. P., (1986). Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2 (Apr. 1986), 244–263.
  • [4] Clarke, E. M. And Grumberg, O. (1987). The model checking problem for concurrent systems with many similar processes. In Proceedings of the International Conference on Temporal Logic in Specification (Altrincham, UK, Apr. 8–10), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York, NY, 188–201.
  • [5] Stırlıng, C. (1987). Comparing linear and branching time temporal logics. In Proceedings of the International Conference on Temporal Logic in Specification (Altrincham, UK, Apr. 8–10), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York, NY, 1–20.
  • [6] Ben-Arı, M., Pnuelı, A., And Manna, Z. (1983). The temporal logic of branching time. Acta Inf. 20.
  • [7] Halpern, J., Manna, Z., And Moszkowskı, B. (1983). A hardware semantics based on temporal intervals. In Proceedings of the Tenth Colloquium on Automata Languages and Programming (Barcelona, Spain, July), J. Diaz, Ed. Springer-Verlag, New York.
  • [8] Moszkowskı, B. And Manna, Z. (1984). Reasoning in interval logic. In Proceedings of the ACM/NSF/ONR Workshop on Logics of Programs, Springer-Verlag, Secaucus, NJ, 371–384.
  • [9] Moszkowskı, B. C. (1986). Executing temporal logic programs. Ph.D. Dissertation. Cambridge University Press, New York, NY.
  • [10] Mellıar-Smıth, P. M. (1987). Extending interval logic to real time systems. In Proceedings of the Conference on Temporal Logic Specification (UK, Apr.), B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Springer-Verlag, New York, 224–242.
  • [11] Schwartz, R. L., Mellıar-Smıth, P. M., And Vogt, F. H. (1983). An interval logic for higherlevel temporal reasoning. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing (Aug.), ACM Press, New York, NY, 173–186.
  • [12] Razouk, R. And Gorlıck, M. (1989). Real-time interval logic for reasoning about executions of realtime programs. SIGSOFT Softw. Eng. Notes 14, 8 (Dec. 1989), 10–19.
  • [13] Allen, J. F. (1984). A General Model of Action and Time. Artificial Intelligence 23, 2, July 1984.
  • [14] Reıchenbach, H., (1947). Elements of Symbolic Logic, New York: Macmillan
  • [15] Pustejovsky, J., Castaño, J., Ingria, R., Aurí, R., Gaizauskas, R., Setzer, A. And Katz, G., (2003). TimeML: Robust Specification of Event and Temporal Expressions in Text. IWCS-5, Fifth International Workshop on Computational Semantics
There are 15 citations in total.

Details

Other ID JA37HS28HY
Journal Section Makaleler(Araştırma)
Authors

Şadi Evren Şeker This is me

Banu Diri This is me

Publication Date June 24, 2016
Published in Issue Year 2011 Volume: 4 Issue: 1 - Volume: 4 Issue: 1

Cite

APA Şeker, Ş. E., & Diri, B. (2016). Türkçe Metinler için Olay Sıralaması. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi, 4(1).
AMA Şeker ŞE, Diri B. Türkçe Metinler için Olay Sıralaması. TBV-BBMD. June 2016;4(1).
Chicago Şeker, Şadi Evren, and Banu Diri. “Türkçe Metinler için Olay Sıralaması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi 4, no. 1 (June 2016).
EndNote Şeker ŞE, Diri B (June 1, 2016) Türkçe Metinler için Olay Sıralaması. Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi 4 1
IEEE Ş. E. Şeker and B. Diri, “Türkçe Metinler için Olay Sıralaması”, TBV-BBMD, vol. 4, no. 1, 2016.
ISNAD Şeker, Şadi Evren - Diri, Banu. “Türkçe Metinler için Olay Sıralaması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi 4/1 (June 2016).
JAMA Şeker ŞE, Diri B. Türkçe Metinler için Olay Sıralaması. TBV-BBMD. 2016;4.
MLA Şeker, Şadi Evren and Banu Diri. “Türkçe Metinler için Olay Sıralaması”. Türkiye Bilişim Vakfı Bilgisayar Bilimleri Ve Mühendisliği Dergisi, vol. 4, no. 1, 2016.
Vancouver Şeker ŞE, Diri B. Türkçe Metinler için Olay Sıralaması. TBV-BBMD. 2016;4(1).

Article Acceptance

Use user registration/login to upload articles online.

The acceptance process of the articles sent to the journal consists of the following stages:

1. Each submitted article is sent to at least two referees at the first stage.

2. Referee appointments are made by the journal editors. There are approximately 200 referees in the referee pool of the journal and these referees are classified according to their areas of interest. Each referee is sent an article on the subject he is interested in. The selection of the arbitrator is done in a way that does not cause any conflict of interest.

3. In the articles sent to the referees, the names of the authors are closed.

4. Referees are explained how to evaluate an article and are asked to fill in the evaluation form shown below.

5. The articles in which two referees give positive opinion are subjected to similarity review by the editors. The similarity in the articles is expected to be less than 25%.

6. A paper that has passed all stages is reviewed by the editor in terms of language and presentation, and necessary corrections and improvements are made. If necessary, the authors are notified of the situation.

0

.   This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.