A Straightforward Approach to Morphological Analysis and Synthesis
| dc.creator | Sgarbas, Kyriakos N. | |
| dc.creator | Fakotakis, Nikos D. | |
| dc.creator | Kokkinakis, George K. | |
| dc.date | 2001-12-10 | |
| dc.date.accessioned | 2026-07-07T03:18:01Z | |
| dc.date.available | 2026-07-07T03:18:01Z | |
| dc.description | In this paper we present a lexicon-based approach to the problem of morphological processing. Full-form words, lemmas and grammatical tags are interconnected in a DAWG. Thus, the process of analysis/synthesis is reduced to a search in the graph, which is very fast and can be performed even if several pieces of information are missing from the input. The contents of the DAWG are updated using an on-line incremental process. The proposed approach is language independent and it does not utilize any morphophonetic rules or any other special linguistic information. | |
| dc.description | 4(+2) pages, 3 figures, 1 table, 10 references. Keywords: Morphology, Directed Acyclic Word Graphs, Lexicon Structures. For related work, see also http://slt.wcl.ee.upatras.gr | |
| dc.identifier | https://arxiv.org/abs/cs/0112010 | |
| dc.identifier | http://arxiv.org/abs/cs/0112010 | |
| dc.identifier | Proc. COMLEX 2000, Workshop on Computational Lexicography and Multimedia Dictionaries, pp.31-34, Kato Achaia, Greece, 22-23 September 2000. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30944 | |
| dc.subject | Computation and Language | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | I.2.7; F.2.2; E.1 | |
| dc.title | A Straightforward Approach to Morphological Analysis and Synthesis | |
| dc.type | text |