The computational analysis of the syntax and interpretation of free word order in Turkish
The computational analysis of the syntax and interpretation of free word order in Turkish
Parsing some constrained grammar formalisms
Computational Linguistics
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Unification Categorial Grammar: a concise, extendable grammar for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
The combinatory morphemic lexicon
Computational Linguistics
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
| Hi-index | 0.00 |
In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the predicate-argument structure, this work proposes a Combinatory Categorial Grammar formulation of relating surface case cues to categories and types for correctly placing the arguments in the predicate-argument structure. This is achieved by treating case markers as type shifters. Unlike other CG formulations, type shifting does not proliferate or cause spurious ambiguity. Categories of all argument-encoding grammatical functions follow from the same principle of category assignment. Normal order evaluation of the combinatory form reveals the predicate-argument structure. The application of the method to Turkish is shown.