David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 19 (3):353-381 (2010)
A method is described for inducing a type-logical grammar from a sample of bare sentence trees which are annotated by lambda terms, called term-labelled trees . Any type logic from a permitted class of multimodal logics may be specified for use with the procedure, which induces the lexicon of the grammar including the grammatical categories. A first stage of semantic bootstrapping is performed, which induces a general form lexicon from the sample of term-labelled trees using Fulop’s (J Log Lang Inf 14(1):49–86, 2005) procedure. Next we present a two-stage procedure for performing distributional learning by unifying the lexical types that are initially discovered. The first structural unification algorithm in essence unifies the initial family of sets of types so that the resulting grammar will generate all term-labelled trees that follow the usage patterns evident from the learning sample. Further altering the lexical categories to generate a recursively extended language can be accomplished by a second unification. The combined unification algorithm is shown to yield a new type-logical lexicon that extends the learning sample to a possibly infinite (and possibly context-sensitive) language in a principled fashion. Finally, the complete learning strategy is analyzed from the perspective of algorithmic learning theory; the range of the procedure is shown to be a class of term-labelled tree languages which is finitely learnable from good examples (Lange et al in Algorithmic learning theory, Vol 872 of lecture notes in artificial intelligence, Springer, Berlin, pp 423–437), and so is identifiable in the limit as a corollary.
|Keywords||Categorial grammar Type-logical grammar Grammar induction Algorithmic learning theory Language acquisition|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono (2007). Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier.
Jeffrey Mark Siskind (1996). A Computational Study of Cross-Situational Techniques for Learning Word-to-Meaning Mappings. Cognition 61 (1-2):39-91.
Johan Van Benthem (1991). Language in Action. Journal of Philosophical Logic 20 (3):225-263.
P. B. Andrews (2002). An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Kluwer Academic Publishers.
Alonzo Church (1940). A Formulation of the Simple Theory of Types. Journal of Symbolic Logic 5 (2):56-68.
Citations of this work BETA
No citations found.
Similar books and articles
Chongli Zou & Nianxi Xia (2008). A Formal Treatment of the Causative Constructions in Chinese. Frontiers of Philosophy in China 3 (2):307-316.
Jacek Marciniec (1997). Infinite Set Unification with Application to Categorial Grammar. Studia Logica 58 (3):339-355.
Emmon Bach, ACTL Semantics: Compositionality and Morphosemantics: II: Words, Morphemes, Constructions, Interpretations.
Chris Barker & Chung-chieh Shan (2006). Types as Graphs: Continuations in Type Logical Grammar. [REVIEW] Journal of Logic, Language and Information 15 (4):331-370.
Daniel Feinstein & Shuly Wintner (2008). Highly Constrained Unification Grammars. Journal of Logic, Language and Information 17 (3):345-381.
Alex Lascarides, Ted Briscoe, Nicholas Asher & Ann Copestake (1996). Order Independent and Persistent Typed Default Unification. Linguistics and Philosophy 19 (1):1 - 90.
Sean A. Fulop (2005). Semantic Bootstrapping of Type-Logical Grammar. Journal of Logic, Language and Information 14 (1):49-86.
Added to index2009-12-19
Total downloads23 ( #161,118 of 1,793,000 )
Recent downloads (6 months)2 ( #344,815 of 1,793,000 )
How can I increase my downloads?