This paper presents mathematics as a general science of computation in a way different from the tradition. It is based on the radical philosophical standpoint according to which the content, meaning and justification of experience lies in its precise formulation. The requirement on precise, formal content discloses the relational structure of (mathematical) experience, and gives a new meaning t...

The paper aims for a computational model in the theory of meaning. Meaning is conceived as cognition states that can be described in a compressed manner using the differentiated-cognition model. The structured content of that cognition or knowledge is a result of a computational process of extracting information from linguistic constructs by an ideal recipient. This structured content gives the...

This paper describes a treebanking project for Hindi/Urdu. We are annotating dependency syntax, lexical predicate-argument structure, and phrase structure syntax in a coordinated and partly automated manner. The paper focuses on choices in syntactic representation, and the stages we think are most appropriate for annotating differnt types of information.

A generative statistical model of dependency syntax is proposed based on Tesni ere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesni ere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string m...

We introduce a framework for lightweight dependency syntax annotation. Our formalism builds upon the typical representation for unlabeled dependencies, permitting a simple notation and annotation workflow. Moreover, the formalism encourages annotators to underspecify parts of the syntax if doing so would streamline the annotation process. We demonstrate the efficacy of this annotation on three ...

This paper shows how to introduce predicative adjunction in a dependency grammar inspired from TAG, MTT and RG. The addition of predicative adjunction allows us to obtain a modular surface syntactic grammar, the derivation structures of which can be interpreted as semantic representations.

In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and prooftheoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a mod...