Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Implementing the type-raising algorithm by grammar compiling
Download
index.pdf
Date
2019
Author
Demir, Oğuzhan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
193
views
61
downloads
Cite This
Type-raising is part of theory of Combinatory Categorial Grammar, by which all arguments including complements are type-raised. Generating type-raising rules in an automatic manner in the compile-time via a simple tool would make experimenting with Combinatory Categorial Grammar faster, allowing control on each run. In this study, created tool is tested with various grammars including large scale Eve database, giving results in O(N) where N is the number of verbs in the grammar.
Subject Keywords
Combinatory categorial grammar
,
Combinatory Categorial Grammar
,
Type-Raising
URI
http://etd.lib.metu.edu.tr/upload/12624277/index.pdf
https://hdl.handle.net/11511/45462
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
Supertagging with combinatory categorial grammar for dependency parsing
Akkuş, Burak Kerim; Çakıcı, Ruket; Department of Computer Engineering (2014)
Combinatory Categorial Grammar (CCG) categories contain syntactic and semantic information. CCG derivation trees can be used in extracting partial dependency structures by providing the missing information in order to build complete dependency structures. Therefore, CCG categories are sometimes referred to as supertags. The amount of information encoded in supertags makes it possible to create very accurate and fast parsers as supertagging is considered ``almost parsing''. In this thesis, a maximum entropy ...
Measuring empirical bias toward ergativity and accusativity
Şakiroğulları, Çağrı.; Bozşahin, Hüseyin Cem; Department of Cognitive Sciences (2019)
Starting with six word order possibilities for a basic transitive clause, exposed data can bias English children to the point of making a categorial distinction for SVO. However, for an SVO language there are two categorial possibil- ities, an ergative and an accusative one. The acquisition of ergativity and accusativity is a complex phenomenon, since they both have similar phono- logical structure for the baby. We show, using Eve database of CHILDES, that these possibilities can be acquired from exposed da...
CROSS-LEVEL TYPING THE LOGICAL FORM FOR OPEN-DOMAIN SEMANTIC PARSING
Öztürel, İsmet Adnan; Bozşahin, Cem; Department of Cognitive Sciences (2022-8-29)
This thesis presents a novel approach to assigning types to expressive Discourse Representation Structure (DRS) meaning representations. In terms of linguistic analysis, our typing methodology couples together the representation of phenomena at the same level of analysis that was traditionally considered to belong to distinctive layers. In the thesis, we claim that the realisation of sub-lexical, lexical, sentence and discourse-level phenomena (such as tense, word sense, named entity class, thematic role, a...
Automatic sense prediction of explicit discourse connectives in Turkish with the help of centering theory and morphosyntactic features
Çetin, Savaş; Zeyrek Bozşahin, Deniz; Department of Cognitive Sciences (2018)
Discourse connectives (and, but, however) are one of many means of keeping the discourse coherent. Discourse connectives are classified into groups based on their senses (expansion, contingency, etc.). They describe the semantic relationship of two discourse units. This study aims to build a machine learning system to predict the sense of explicit discourse connectives on the Turkish Discourse Bank data, which is manually gold-annotated. To do so, this study examines the effect of several features: i.e. tra...
Gradient characteristics of the unaccusative/unergative distinction in Turkish : an experimental investigation
Acartürk, Cengiz; Zeyrek Bozşahin, Deniz; Department of Cognitive Sciences (2005)
This thesis investigates the gradient behaviour of monadic intransitive verb classes in Turkish, under an aspectual classification of the unaccusative/unergative verb types, namely The Split Intransitivity Hierarchy. This Hierarchy claims that intransitive verb types are subject to gradient acceptability in certain syntactic constructions. The methods used in judgment elicitation studies in psychophysics, such as the magnitude estimation technique have recently been adapted to be used in capturing gradient ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Demir, “Implementing the type-raising algorithm by grammar compiling,” Thesis (M.S.) -- Graduate School of Informatics. Cognitive Sciences., Middle East Technical University, 2019.