A probabilistic model of Ancient Egyptian writing

• Autorzy: Nederhof M.-J. , Rahman F.

Identyfikatory

DOI

10.15398/jlm.v5i1.150

• Języki publikacji: EN

Abstrakty

EN

This article offers a formalization of how signs form words in Ancient Egyptian writing, for either hieroglyphic or hieratic texts. The formalization is in terms of a sequence of sign functions, which concurrently produce a sequence of signs and a sequence of phonemes. By involving a class of probabilistic automata, we can define the most likely sequence of sign functions that relates a given sequence of signs to a given sequence of phonemes. Experiments with two texts are discussed.

Słowa kluczowe

EN

Ancient Egyptian; writing systems; language models

• Wydawca: Instytut Podstaw Informatyki PAN
• Czasopismo: Journal of Language Modelling
• Rocznik: 2017
• Tom: Vol. 5, No. 1
• Strony: 131--163
• Opis fizyczny: Bibliogr. 31 poz., rys., tab.

Twórcy

autor

Nederhof M.-J.

• School of Computer Science, University of St Andrews, United Kingdom

autor

Rahman F.

• School of Computer Science, University of St Andrews, United Kingdom

Bibliografia

• [1] J. P. Allen (2000), Middle Egyptian: An Introduction to the Language and Culture of Hieroglyphs, Cambridge University Press.
• [2] F. Barthélemy and S. Rosmorduc (2011), Intersection of multitape transducers vs. cascade of binary transducers: the example of Egyptian Hieroglyphs transliteration, in Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, pp. 74-82, Blois, France.
• [3] S. Billet-Coat and D. Hérin-Aime (1994), A Multi-Agent Architecture for an Evolving Expert System Module, in Database and Expert Systems Applications, 5th International Conference, volume 856 of Lecture Notes in Computer Science, pp. 581-590, Springer-Verlag, Athens, Greece.
• [4] A. M. Blackman (1932), Middle-Egyptian Stories – Part I, Fondation Égyptologique Reine Élisabeth.
• [5] A. M. Blackman (1988), The Story of King Kheops and the Magicians, J. V. Books.
• [6] P. F. Brown, S. A. Della Pietra, V. J. Della Pietra, and R. L. Mercer (1993), The Mathematics of Statistical Machine Translation: Parameter Estimation, Computational Linguistics, 18 (4): 263-311.
• [7] P.T. Daniels and W. Bright, editors (1996), The World’s Writing Systems, Oxford University Press, New York.
• [8] C. T. de Vartavan (2010), Snt[r]/snṯ[r] means ‘[Divine/Godly] Scent’, Advances in Egyptology, 1: 5-17.
• [9] E. W. Dijkstra (1959), A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, 1: 269-271.
• [10] N. Durrani, H. Schmid, A. Fraser, P. Koehn, and H. Schütze (2015), The Operation Sequence Model — Combining N-Gram-Based and Phrase-Based Statistical Machine Translation, Computational Linguistics, 41 (2): 157-186.
• [11] W. A. Gale and G. Sampson (1995), Good-Turing Frequency Estimation Without Tears, Journal of Quantitative Linguistics, 2 (3): 217-237.
• [12] L. Galescu and J. F. Allen (2002), Pronunciation of proper names with a joint n-gram model for bi-directional grapheme-to-phoneme conversion, In Proceedings of the Seventh International Conference on Spoken Language Processing (ICSLP-2002), pp. 109-112, Denver, CO, USA.
• [13] A. Gardiner (1957), Egyptian Grammar, Griffith Institute, Ashmolean Museum, Oxford.
• [14] R. Hannig (1995), Grosses Handwörterbuch Ägyptisch-Deutsch: die Sprache der Pharaonen (2800-950 v.Chr.), Verlag Philipp von Zabern, Mainz.
• [15] G. Ifrah (1981), Histoire Universelle des Chiffres, Editions Seghers, Paris.
• [16] S. M. Katz (1987), Estimation of probabilities from sparse data for the language model component of a speech recognizer, IEEE Transactions on Acoustics, Speech, and Signal Processing, 35 (3): 400-401.
• [17] K. Knight and J. Graehl (1998), Machine Transliteration, Computational Linguistics, 24 (4): 599-612.
• [18] A. Loprieno (1995), Ancient Egyptian: a linguistic introduction, Cambridge University Press.
• [19] M. G. A. Malik, C. Boitet, and P. Bhattacharyya (2008), Hindi Urdu machine transliteration using finite-state transducers, in The 22nd International Conference on Computational Linguistics, volume 1, pp. 537-544, Manchester, UK.
• [20] M.-J. Nederhof (2008), Automatic Alignment of Hieroglyphs and Transliteration, in N. Strudwick, editor, Information Technology and Egyptology in 2008, Proceedings of the meeting of the Computer Working Group of the International Association of Egyptologists, pp. 71-92, Gorgias Press.
• [21] S. Polis, A.-C. Honnay, and J. Winand (2013), Building an Annotated Corpus of Late Egyptian, in S. Polis and J. Winand, editors, Texts, Languages & Information Technology in Egyptology, pp. 25-44, Presses Universitaires de Liège.
• [22] S. Polis and S. Rosmorduc (2013), Réviser le codage de l’égyptien ancien. Vers un répertoire partagé des signes hiéroglyphiques, Document Numérique, 16 (3): 45-67.
• [23] S. Polis and S. Rosmorduc (2015), The Hieroglyphic Sign Functions. Suggestions for a Revised Taxonomy, in H. Amstutz, A. Dorn, M. Müller, M. Ronsdorf, and S. Uljas, editors, Fuzzy Boundaries: Festschrift für Antonio Loprieno, volume 1, pp. 149-174, Widmaier Verlag, Hamburg.
• [24] L. R. Rabiner (1989), A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition, Proceedings of the IEEE, 77 (2): 257-286.
• [25] S. Rosmorduc (2002/3), Codage informatique des langues anciennes, Document Numérique, 6: 211-224.
• [26] S. Rosmorduc (2008), Automated Transliteration of Egyptian Hieroglyphs, In N. Strudwick, editor, Information Technology and Egyptology in 2008, Proceedings of the meeting of the Computer Working Group of the International Association of Egyptologists, pp. 167-183, Gorgias Press.
• [27] W. Schenkel (1971), Zur Struktur der Hieroglyphenschrift, Mitteilungen des deutschen archäologischen Instituts, Abteilung Kairo, 27: 85-98.
• [28] W. Schenkel (1984), Aus der Arbeit an einer Konkordanz zu den altägyptischen Sargtexten, volume 12 of Göttinger Orientforschungen, IV. Reihe, Harrassowitz.
• [29] R. Sproat (2000), A Computational Theory of Writing Systems, Cambridge University Press, Cambridge.
• [30] A. Tsukamoto (1997), Automated Transcription of Egyptian Hieroglyphic Texts: via transliteration using computer, Journal of the Faculty of Culture and Education, 2 (1): 1-40, Saga-University.
• [31] E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco (2005), Probabilistic Finite-State Machines — Part II, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 (7): 1026-1039.