Recursive linearization

Datos Bibliográficos

ID20344156
AutoresJoost Kremers (Frankfurt University of Applied Sciences, autor de correspondencia)
Año2009
Volumen26
Número1
Fecha de publicación2009-01-01
Peer ReviewedSí
Open AccessNo
TipoARTICLE
RevistaThe Linguistic Review (JOURNAL)
Identificadores de la revistaISSN: 0167-6318 • E-ISSN: 1613-3676
EditorialWalter de Gruyter GmbH (PUBLISHER • DE)
DOI10.1515/tlir.2009.004
OpenAlexW4253496298
IdiomaEN
Citas recibidas6
Referencias citadas3

Linguistic structures are represented as hierarchical tree structures, although utterances are linear. To deal with this discrepancy, the grammar model needs to specify in which way linear order is derived from hierarchical structure. This article examines the idea that linearization is a PF procedure, implemented as a recursive procedure searching the hierarchical tree top-down for terminal elements. It is shown that we can describe linearization by positing one linearization principle and two parameters, one a modified head parameter, and one parameter to linearize adjuncts. The resulting system is applied to the domain of the Arabic and English noun phrases. Although these domains have vastly different linear orders, with the proposed model their syntactic structures turn out to be only minimally different

Algorithm · Binary tree · Combinatorics · Grammar · Linearization · Linguistics · Mathematical analysis · Natural language processing · Negation · Nonlinear system · Noun · Noun phrase · Programming language · Tree structure · Computer Science · Mathematics · Natural Language Processing Techniques · Speech and dialogue systems · Syntax, Semantics, Linguistic Variation