25.08.2013 Views

PDF (Online Text) - EURAC

PDF (Online Text) - EURAC

PDF (Online Text) - EURAC

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

• Lexical class-dependent screeve formation (e.g. the endings in the<br />

Aorist);<br />

• The dependency between the formation of some screeves from that of<br />

others (e.g. the Imperfect from the Present); and<br />

• The multiple exponence of agreement, that is, the use of suffixes and<br />

prefixes simultaneously, and the simultaneous expression of subject and object<br />

agreement.<br />

The linguistic analysis of Georgian verbal morphology suggested in the previous<br />

section relies on insights from Construction Grammar. Unfortunately, there are<br />

currently no computational implementations of CG capable of handling complex<br />

morphological systems. Bryant (2003) describes a constructional syntactic parser,<br />

based on general principles of chart parsing. However, this parser cannot yet handle<br />

morphological segmentation, and adapting it for Georgian would require substantial<br />

revision.<br />

Fortunately, FST tools for computational morphology have advanced to the point<br />

where they can handle some aspects of non-concatenative morphology. The next<br />

section briefly describes the approach in Beesley & Karttunen (2003) and what makes it<br />

a possible candidate for modelling at least a subset of Georgian verbal morphology.<br />

3.2 Xerox Finite-State Morphology Tools<br />

Beesley & Karttunen (2003) present the state-of-the-art set of tools for creating<br />

finite-state morphological models. The book is accompanied by implementations of<br />

the two Xerox languages: xfst (designed for general finite-state manipulations) and<br />

lexc (designed more specifically for defining lexicons). Since our goal was to reproduce<br />

morphotactic rules of word formation rather than the structure of the lexicon, xfst<br />

was used.<br />

Xfst provides all of the basic commands for building up single or two-level finite-<br />

state networks (i.e., transducers), such as concatenation, intersection, and so forth.<br />

In addition, xfst has several built-in shortcuts that make network manipulation<br />

easier, such as various substitution commands. Xfst distinguishes between words of a<br />

natural language (composed of single characters) and multi-character symbols, used<br />

in our model to indicate morphosyntactic properties such as person or number. Each<br />

completed arc in a finite-state network compiled using xfst represents a mapping<br />

between a set of morphosyntactic and semantic properties (on the upper side) and a<br />

full word form that realises those properties (on the lower side).<br />

234

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!