Abstract
We propose a novel architecture for categorial grammar that clarifies the relationship between semantically relevant combinatoric reasoning and semantically inert reasoning that only affects surface-oriented phonological form. To this end, we employ a level of structured phonology that mediates between syntax (abstract combinatorics) and phonology proper (strings). To notate structured phonologies, we employ a lambda calculus analogous to the φ-terms of [8]. However, unlike Oehrle’s purely equational φ-calculus, our phonological calculus is inequational, in a way that is strongly analogous to the functional programming language LCF [10]. Like LCF, our phonological terms are interpreted into a Henkin frame of posets, with degree of definedness (’height’ in the preorder that interprets the base type) corresponding to degree of pronounceability; only maximal elements are actual strings and therefore fully pronounceable. We illustrate with an analysis (also new) of some complex constituent-order phenomena in Japanese.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldridge, J.: Lexically Specified Derivational Control in Combinatory Categorial Grammar. Ph.D. thesis, University of Edinburgh (2002), http://comp.ling.utexas.edu/jbaldrid/papers/dissertation.html
Bernardi, R.: Reasoning with Polarity in Categorial Type Logic. Ph.D. thesis, University of Utrecht (2002), http://www.inf.unibz.it/~bernardi/finalthesis.html
Kubota, Y.: Solving the morpho-syntactic puzzle of the Japanese -te form complex predicate: A Multi-Modal Combinatory Categorial Grammar analysis. In: Bonami, O., Hofherr, P.C. (eds.) Empirical Issues in Syntax and Semantics, vol. 7 (2008), http://www.cssp.cnrs.fr/eiss6
Moortgat, M.: Categorial Type Logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 93–177. Elsevier, Amsterdam (1997)
Morrill, G., Solias, T.: Tuples, discontinuity, and gapping in categorial grammar. In: Proceedings of the Sixth Conference on European Chapter of the Association for Computational Linguistics, pp. 287–296. Association for Computational Linguistics, Morristown (1993)
Morrill, G.V.: Type Logical Grammar: Categorial Logic of Signs. Kluwer Academic Publishers, Dordrecht (1994)
Oehrle, R.T.: Multi-dimensional compositional functions as a basis for grammatical analysis. In: Oehrle, R.T., Bach, E., Wheeler, D. (eds.) Categorial Grammars and Natural Language Structures, pp. 349–389. Reidel, Dordrecht (1988)
Oehrle, R.T.: Term-labeled categorial type systems. Linguistics and Philosophy 17(6), 633–678 (1994)
Plotkin, G.: LCF considered as a programming language. Theoretical Computer Science 5(3), 223–255 (1977)
Scott, D.: A type-theoretical alternative to iswim, cuch, owhy. Theoretical Computer Science 121, 411–440 (1993) (revision of unpublished 1969 manuscript)
Solias, M.T.: Gramáticas Categoriales, Coordinación Generalizada Y Elisión. Ph.D. thesis, Departamento de Lingüística, Lógica, Lenguas Modernas y Filsofía de la Ciencia, Universidad Autónoma de Madrid (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kubota, Y., Pollard, C. (2010). Phonological Interpretation into Preordered Algebras. In: Ebert, C., Jäger, G., Michaelis, J. (eds) The Mathematics of Language. MOL MOL 2009 2007. Lecture Notes in Computer Science(), vol 6149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14322-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-14322-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14321-2
Online ISBN: 978-3-642-14322-9
eBook Packages: Computer ScienceComputer Science (R0)