A probabilistic model of Ancient Egyptian writing

Mark Jan Nederhof; Fahrurrozi Rahman

doi:10.15398/jlm.v5i1.150

A probabilistic model of Ancient Egyptian writing

Mark Jan Nederhof, Fahrurrozi Rahman

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	131-163
Journal	Journal of Language Modelling
Volume	5
Issue number	1
DOIs	https://doi.org/10.15398/jlm.v5i1.150
Publication status	Published - 1 Jul 2017

Keywords

Ancient Egyptian
Writing systems
Language models

Access to Document

10.15398/jlm.v5i1.150Licence: CC BY

Nederhof-2017-A-probabilistic-model-JLM-131-CC
Copyright the Authors 2017. This work is licensed under the Creative Commons Attribution 3.0 Unported License.
Final published version, 324 KBLicence: CC BY

Mark Nederhof
- mn31st-andrews.acuk
- School of Computer Science - Senior Lecturer
Person: Academic

Cite this

@article{e2752ce4480f4e0eabd095b3511735c9,

title = "A probabilistic model of Ancient Egyptian writing",

abstract = "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.",

keywords = "Ancient Egyptian, Writing systems, Language models",

author = "Nederhof, {Mark Jan} and Fahrurrozi Rahman",

year = "2017",

month = jul,

day = "1",

doi = "10.15398/jlm.v5i1.150",

language = "English",

volume = "5",

pages = "131--163",

journal = "Journal of Language Modelling",

issn = "2299-8470",

publisher = "Institute of Computer Science, Polish Academy of Sciences",

number = "1",

}

TY - JOUR

T1 - A probabilistic model of Ancient Egyptian writing

AU - Nederhof, Mark Jan

AU - Rahman, Fahrurrozi

PY - 2017/7/1

Y1 - 2017/7/1

N2 - 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.

AB - 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.

KW - Ancient Egyptian

KW - Writing systems

KW - Language models

U2 - 10.15398/jlm.v5i1.150

DO - 10.15398/jlm.v5i1.150

M3 - Article

SN - 2299-8470

VL - 5

SP - 131

EP - 163

JO - Journal of Language Modelling

JF - Journal of Language Modelling

IS - 1

ER -

A probabilistic model of Ancient Egyptian writing

Abstract

Keywords

Access to Document

Fingerprint

Profiles

Mark Nederhof

Cite this