Wide-coverage parsing, semantics and morphology

Bozşahin, Hüseyin Cem
Çakıcı, Ruket
Steedman, Mark
Wide-coverage parsing poses three demands: broad coverage over preferably free text, depth in semantic representation for purposes such as inference in question answering, and computational efficiency. We show for Turkish that these goals are not inherently contradictory when we assign categories to sub-lexical elements in the lexicon. The presumed computational burden of processing such lexicons does not arise when we work with automata-constrained formalisms that are trainable on word-meaning correspondences at the level of predicate-argument structures for any string, which is characteristic of radically lexicalizable grammars. This is helpful in morphologically simpler languages too, where word-based parsing has been shown to benefit from sub-lexical training.
Citation Formats
H. C. Bozşahin, R. Çakıcı, and M. Steedman, Wide-coverage parsing, semantics and morphology. 2018, p. 174.