Open AccessIs Word Order Asymmetry Mathematically Expressible?
Author(s) -
Koji Arikawa
Publication year - 2013
Publication title -
biolinguistics
Language(s) - English
Resource type - Journals
ISSN - 1450-3417
DOI - 10.5964/bioling.8967
Subject(s) - equilateral triangle , merge (version control) , asymmetry , mathematics , antisymmetry , simple (philosophy) , combinatorics , order (exchange) , symmetry (geometry) , symmetric group , transformation (genetics) , word (group theory) , pure mathematics , computer science , physics , geometry , linguistics , philosophy , biochemistry , chemistry , epistemology , finance , quantum mechanics , gene , economics , information retrieval
The computational procedure for human natural language (CHL) shows an asymmetry in unmarked orders for S, O, and V. Following Lyle Jenkins, it is speculated that the asymmetry is expressible as a group-theoretical factor (included in Chomsky’s third factor): “[W]ord order types would be the (asymmetric) stable solutions of the symmetric still-to-be-discovered ‘equations’ governing word order distribution”. A possible “symmetric equation” is a linear transformation f(x) = y, where function f is a set of merge operations (transformations) expressed as a set of symmetric transformations of an equilateral triangle, x is the universal base vP input expressed as the identity triangle, and y is a mapped output tree expressed as an output triangle that preserves symmetry. Although the symmetric group S3 of order 3! = 6 is too simple, this very simplicity is the reason that in the present work cost differences are considered among the six symmetric operations of S3. This article attempts to pose a set of feasible questions for future research.