iReteslaw

Is Word Order Asymmetry Mathematically Expressible?

Pokaż uproszczony rekord

dc.contributor.author Arikawa, Koji
dc.date.accessioned 2020-01-30T11:20:20Z
dc.date.available 2020-01-30T11:20:20Z
dc.date.issued 2013
dc.identifier.uri https://hdl.handle.net/20.500.12528/1503
dc.description.abstract 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. en
dc.language.iso en_US en
dc.subject human natural language en
dc.subject word order en
dc.subject Chomsky Noam en
dc.subject mathematical linguistics en
dc.title Is Word Order Asymmetry Mathematically Expressible? en
dc.type Article en


Pliki tej pozycji

Pozycja umieszczona jest w następujących kolekcjach

Pokaż uproszczony rekord

Szukaj w iReteslawie


Szukanie zaawansowane

Przeglądaj

Moje konto