Machine Learning Models of Universal Grammar Parameter Dependencies
The use of parameters in the description of natural language syntax has to balance between the need to discriminate among (sometimes subtly different) languages, which can be seen as a cross-linguistic version of Chomsky{'}s (1964) descriptive adequacy, and the complexity of the acquisition task that a large number of parameters would imply, which is a problem for explanatory adequacy. Here we present a novel approach in which a machine learning algorithm is used to find dependencies in a table of parameters. The result is a dependency graph in which some of the parameters can be fully predicted from others. These empirical findings can be then subjected to linguistic analysis, which may either refute them by providing typological counter-examples of languages not included in the original dataset, dismiss them on theoretical grounds, or uphold them as tentative empirical laws worth of further study.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningDescriptiveMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
The Grammar Does the Work: Functional vs. Lexical Dependency Length Minimization Across Universal Dependencies
Dependency length minimization (DLM) is a well-documented processing universal, but previous studies report a single mean dependency distance (MDD) per language, obscuring variation across syntactic relation types. We an…
Enhancing PTB Universal Dependencies for Grammar-Based Surface Realization
Bootstrapping Role and Reference Grammar Treebanks via Universal Dependencies
From Lexical Functional Grammar to Enhanced Universal Dependencies
This is a summary of an invited talk.
Iterated Dependencies in a Breton treebank and implications for a Categorial Dependency Grammar
Categorial Dependency Grammars (CDG) are computational grammars for natural language processing, defining dependency structures. They can be viewed as a formal system, where types are attached to words, combining the cla…