- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.059 seconds)| 1 |
A Type System For Combinatory Categorial GrammarErkan, Gunes 01 January 2003 (has links) (PDF)
This thesis investigates the internal structure and the computational representation of
the lexical entries in Combinatory Categorial Grammar (CCG). A restricted form of
typed feature structures is proposed for representing CCG categories. This proposal
is combined with a constraint-based modality system for basic categories of CCG.
We present some linguistic evidence to explain why both a unication-based feature
system and a constraint-based modality system are needed for a lexicalist framework.
An implementation of our system is also presented.
|
| 2 |
Analysis of a multiple dispatch algorithmHolmberg, Johannes January 2004 (has links)
<p>The development of the new programming language Scream, within the project Software Renaissance, led to the need of a good multiple dispatch algorithm. A multiple dispatch algorithm, called Compressed n-dimensional table with row sharing; CNT-RS, was developed from the algorithm Compressed n-dimensional table, CNT. The purpose of CNT-RS was to create a more efficient algorithm. This report is the result of the work to analyse the CNT-RS algorithm. </p><p>In this report the domain of multiple dispatch, the multiple dispatch algorithm CNT and the new extended algorithm CNT-RS are presented. The correctness of CNT- RS algorithm is shown and it’s proven that the CNT-RS algorithm is at least as good as the CNT algorithm, in regards to space complexity of the dispatch structure.</p>
|
| 3 |
Analysis of a multiple dispatch algorithmHolmberg, Johannes January 2004 (has links)
The development of the new programming language Scream, within the project Software Renaissance, led to the need of a good multiple dispatch algorithm. A multiple dispatch algorithm, called Compressed n-dimensional table with row sharing; CNT-RS, was developed from the algorithm Compressed n-dimensional table, CNT. The purpose of CNT-RS was to create a more efficient algorithm. This report is the result of the work to analyse the CNT-RS algorithm. In this report the domain of multiple dispatch, the multiple dispatch algorithm CNT and the new extended algorithm CNT-RS are presented. The correctness of CNT- RS algorithm is shown and it’s proven that the CNT-RS algorithm is at least as good as the CNT algorithm, in regards to space complexity of the dispatch structure.
|
Page generated in 0.0623 seconds