Modelling a Morpheme-based Lexicon for Modern Greek.
This paper presents a method for designing and organizing a multi-purpose morpheme-based lexical database for Modern Greek. The authors are in favour of multi-purpose lexical databases, to avoid a repetition of effort from one application to another, and of morpheme-based lexica, to achieve flexibil...
| Publicado en: | Literary & Linguistic Computing Vol. 17; no. 4; pp. 475 - 491 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Oxford University Press / USA
Nov2002
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=10037180&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 10037180 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 02681145 BJ1 jtl: Literary & Linguistic Computing issn: 02681145 maglogo: N pubinfo: dt: Nov2002 vid: 17 iid: 4 pid: 622 pub: Oxford University Press / USA artinfo: ui: 10037180 10.1093/llc/17.4.475 ppf: 475 ppct: 16 formats: fmt: @attributes: type: P size: 155KB tig: atl: Modelling a Morpheme-based Lexicon for Modern Greek. aug: au: Papakitsos, E. Grigoriadou, M. Philokyprou, G. su: Databases Lexicology sug: subj: Databases Lexicology ab: This paper presents a method for designing and organizing a multi-purpose morpheme-based lexical database for Modern Greek. The authors are in favour of multi-purpose lexical databases, to avoid a repetition of effort from one application to another, and of morpheme-based lexica, to achieve flexibility, reusability, expandability, and compact representation of data for future developments. The suggested method for modelling the lexical database in the word-processing function is the Entity/Relationship model, according to the linguistic theory of Generative Lexical Morphology. In the framework of this model, which depicts rich linguistic information, we can introduce new data structures for storing the morphemes. These new data structures are matrix encoding schemes; one type, called the Cartesian Lexicon, has been designed as a part of our research. The matrix data structures combine the advantages of hash-tables and tries, which are very popular data structures in supporting machine readable dictionaries. Our system was tested on the Modern Greek language, and demonstrated a satisfactory overall performance in word processing. These methods could also be applicable to other languages having morphological systems similar to Modern Greek. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: © 2019 EADH: The European Association for Digital Humanities. item: Literary & Linguistic Computing holder: Oxford University Press / USA dt: @attributes: year: 2002 holdings: @attributes: islocal: N |
|---|