Learnability and falsifiability of Construction Grammars

Jonathan Dunn

Abstract


The strength of Construction Grammar (CxG) is its descriptive power; its weakness is the learnability and falsifiability of its unconstrained representations. Learnability is the degree to which the optimum set of constructions can be consistently selected from the large set of potential constructions; falsifiability is the ability to make testable predictions about the constructions present in a dataset. This paper uses grammar induction to evaluate learnability and falsifiability: given a discovery-device CxG and a set of observed utterances, its learnability is its stability over sub-sets of data and its falsifiability is its ability to predict a CxG.

Keywords


construction grammar; grammar induction; discovery-device grammar; computational construction grammar

Full Text:

PDF


DOI: http://dx.doi.org/10.3765/plsa.v2i0.4009

Copyright (c) 2017 Jonathan Dunn

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Donate to the Open-Access Fund of the LSA

Linguistic Society of America


Advancing the Scientific Study of Language

ISSN (online): 2473-8689

This publication is made available for free to readers and with no charge to authors thanks in part to your continuing LSA membership and your donations to the open access fund.