Data Structures in Lexicography: from Trees to Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00092269" target="_blank" >RIV/00216224:14330/16:00092269 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Data Structures in Lexicography: from Trees to Graphs
Original language description
In lexicography, a dictionary entry is typically encoded in XML as a tree: a hierarchical data structure of parent-child relations where every element has at most one parent. This choice of data structure makes some aspects of the lexicographer’s work unnecessarily difficult, from deciding where to place multi-word items to reversing an entire bilingual dictionary. This paper proposes that these and other notorious areas of difficulty can be made easier by remodelling dictionaries as graphs rather than trees. However, unlike other authors who have proposed a radical departure from tree structures and whose proposals have remained largely unimplemented, this paper proposes a conservative compromise in which existing tree structures become augmented with specific types of inter-entry relations designed to solve specific problems.
Czech name
—
Czech description
—

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of Recent Advances in Slavonic Natural Language Processing, RASLAN 2016
ISBN
9788026310952
ISSN
2336-4289
e-ISSN
—
Number of pages
8
Pages from-to
97-104
Publisher name
Tribun EU
Place of publication
Brno
Event location
Karlova Studánka
Event date
Dec 2, 2016
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)