Implementing the type-raising algorithm by grammar compiling

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

3
views

4
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