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)|
References found in this work BETA
Residuated Lattices: An Algebraic Glimpse at Substructural Logics.Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono - 2007 - Elsevier.
A Computational Study of Cross-Situational Techniques for Learning Word-to-Meaning Mappings.Jeffrey Mark Siskind - 1996 - Cognition 61 (1-2):39-91.
A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof.P. B. Andrews - 2002 - Kluwer Academic Publishers.
Citations of this work BETA
No citations found.
Similar books and articles
A Formal Treatment of the Causative Constructions in Chinese.Zou Chongli & Xia Nianxi - 2008 - Frontiers of Philosophy in China 3 (2):307-316.
Infinite Set Unification with Application to Categorial Grammar.Jacek Marciniec - 1997 - Studia Logica 58 (3):339-355.
ACTL Semantics: Compositionality and Morphosemantics: II: Words, Morphemes, Constructions, Interpretations.Emmon Bach - unknown
Types as Graphs: Continuations in Type Logical Grammar. [REVIEW]Chris Barker & Chung-chieh Shan - 2006 - Journal of Logic, Language and Information 15 (4):331-370.
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics.Rajeev Gore - unknown
Highly Constrained Unification Grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Order Independent and Persistent Typed Default Unification.Alex Lascarides, Ted Briscoe, Nicholas Asher & Ann Copestake - 1996 - Linguistics and Philosophy 19 (1):1 - 90.
Added to index2009-12-19
Total downloads25 ( #195,138 of 2,143,561 )
Recent downloads (6 months)1 ( #386,856 of 2,143,561 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.