Paper Info
Title
Syntactic Categories in the Language of Mathematics
Abstract
We have been studying the structure of simple mathematical statements in English. It has turned out that both phrase structure grammar and type theory are needed. Then we have given an interpretation and generalization of phrase structure grammar in type theory—in other words, an extension of type theory with a system of categories of phrase structure grammar. We have ended up with a formalism that comprises both informal English (that is, strings of words), a system of syntactic categories and syntax trees, and a formal mathematical language. We have shown how syntax trees are sugared into English and interpreted in the mathematical formalism. We have not shown how to define the inverses of sugaring and interpretation, which are by no means trivial. The inverse of sugaring, that is, parsing, was briefly discussed at the end of Section 6. The inverse of interpretation would be a function that takes type-theoretical formulae into syntax trees. It could be combined with the sugaring operation that we already have, to obtain a sugaring method for the mathematical formalism. We have previously tried to define sugaring directly for the mathematical formalism (see Ranta 1994a, chapter 9, and 1994b), but then we did not have access to other categorial structure than the structure of type theory.
Year
DOI
Venue
1994
10.1007/3-540-60579-7_9
TYPES
Keywords
Field
DocType
syntactic categories,type theory
Noun phrase,Computer science,Phrase structure grammar,Abstract syntax tree,Algorithm,Type theory,Phrase structure rules,Artificial intelligence,Natural language processing,Language of mathematics,Syntactic category,Syntax
Conference
ISBN
Citations 
PageRank 
3-540-60579-7
3
0.92
References 
Authors
4
1
Name
Order
Citations
PageRank
Aarne Ranta131636.02