Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis 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
7
views
10
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
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.
