Exploració per tema "Lingüística computacional"

Ara es mostren els items 21-40 de 177

    • Are crossing dependencies really scarce? 

      Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos; Esteban Ángeles, Juan Luis (2018-03-01)
      Article
      Accés obert
      The syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that the number of edge crossings in real ...

    • Automatic evaluation of top-down predictive parsing 

      Creus, Carles; Fernández Durán, Pau; Godoy, Guillem; Mamano, Nil (2016-04-01)
      Report de recerca
      Accés obert
      We develop efficient methods to check whether two given Context-Free Grammars (CFGs) are transformed into parsers that recognize the same language and construct the same Abstract Syntax Trees (ASTs) for each input. In this ...

    • Automatic Selection of HPSG-Parsed Sentences for Treebank Construction 

      Marimon, Montserrat; Bel, Nuria; Padró, Lluís (2014-09-01)
      Article
      Accés obert
      This article presents an ensemble parse approach to detecting and selecting high-quality linguistic analyses output by a hand-crafted HPSG grammar of Spanish implemented in the LKB system. The approach uses full agreement ...

    • Beyond description: Comment on “Approaching human language with complex networks” by Cong and Liu 

      Ferrer Cancho, Ramon (2014-12-01)
      Article
      Accés obert

    • Can Menzerath’s law be a criterion of complexity in communication? 

      González Torre, Ivan; Debowski, Lukasz; Hernández Fernández, Antonio (Public Library of Science (PLOS), 2021-08-20)
      Article
      Accés obert
      Menzerath’s law is a quantitative linguistic law which states that, on average, the longer is a linguistic construct, the shorter are its constituents. In contrast, Menzerath-Altmann’s law (MAL) is a precise mathematical ...

    • Can simple models explain Zipf’s law for all exponents? 

      Ferrer Cancho, Ramon; Servedio, Vito D. P. (RAM-Verlag, 2005-01)
      Article
      Accés obert
      H. Simon proposed a simple stochastic process for explaining Zipf’s law for word frequencies. Here we introduce two similar generalizations of Simon’s model that cover the same range of exponents as the standard Simon ...

    • Caracterització i detecció de textos generats artificialment 

      Casas Muñoz, Antoni (Universitat Politècnica de Catalunya, 2020-06-26)
      Treball Final de Grau
      Accés obert
      Millores recents en el camp dels models de llenguatge natural han portat a la creació de nous models generadors de llenguatge, aquests nous models són de gran qualitat, i en certes ocasions, diferenciar-los d'allò que un ...

    • Compression and the origins of Zipf's law for word frequencies 

      Ferrer Cancho, Ramon (2016-11-01)
      Article
      Accés obert
      Here we sketch a new derivation of Zipf's law for word frequencies based on optimal coding. The structure of the derivation is reminiscent of Mandelbrot's random typing model but it has multiple advantages over random ...

    • Computational coverage of TLG : the Montague test 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2015)
      Text en actes de congrés
      Accés obert
      This paper reports on the empirical coverage of Type Logical Grammar (TLG) and on how it has been computer implemented. We analyse the Montague fragment computationally and we proffer this task as a challenge to computational ...

    • Computational coverage of TLG: displacement 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2015)
      Text en actes de congrés
      Accés obert
      This paper reports on the coverage of TLG of Morrill (1994) and Moortgat (1997), and on how it has been computer implemented. We computer-analyse examples of displacement: discontinuous idioms, quantification, (medial) ...

    • Computational coverage of TLG: nonlinearity 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2015)
      Text en actes de congrés
      Accés obert
      We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devise four conservative extensions of the displacement calculus with brackets, Db!, Db!?, Db!b and Db!b?r which contain the ...

    • Computational coverage of type logical grammar: The Montague test 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2016)
      Text en actes de congrés
      Accés obert
      It is nearly half a century since Montague made his contributions to the field of logical semantics. In this time, computational linguistics has taken an almost entirely statistical turn and mainstream linguistics has ...

    • Constant conditional entropy and related hypotheses 

      Ferrer Cancho, Ramon; Debowski, Lukasz; Moscoso del Prado Martín, Fermín (Institute of Physics (IOP), 2013-07-04)
      Article
      Accés obert
      Constant entropy rate (conditional entropies must remain constant as the sequence length increases) and uniform information density (conditional probabilities must remain constant as the sequence length increases) are two ...

    • Count-invariance including exponentials 

      Kuznetsov, Stepan; Morrill, Glyn; Valentín Fernández Gallart, José Oriol (Association for Computational Linguistics, 2017)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      We define infinitary count-invariance for categorial logic, extending countinvariance for multiplicatives (van Benthem, 1991) and additives and bracket modalities (Valentín et al., 2013) to include exponentials. This ...

    • Crossings as a side effect of dependency lengths 

      Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (2016-11-01)
      Article
      Accés obert
      The syntactic structure of sentences exhibits a striking regularity: dependencies tend to not cross when drawn above the sentence. We investigate two competing explanations. The traditional hypothesis is that this trend ...

    • Decoding least effort and scaling in signal frequency distributions 

      Ferrer Cancho, Ramon (2005-01)
      Article
      Accés obert
      Here, assuming a general communication model where objects map to signals, a power function for the distribution of signal frequencies is derived. The model relies on the satisfaction of the receiver (hearer) communicative ...

    • Del texto a la información 

      Atserias Batalla, Jordi; Castell Ariño, Núria; Catala Roig, Neus; Rodríguez Hontoria, Horacio; Turmo Borras, Jorge (Asociación de Técnicos de Informática, 1998-05)
      Article
      Accés obert
      Las aplicaciones informáticas centradas en el Tratamiento de la Lengua (TL) han experimentado en los últimos años un notable auge sobre todo en el ámbito del acceso a la información textual no restriginda (ni codifica­da). ...

    • Direct and indirect evidence of compression of word lengths: Zipf’s law of abbreviation revisited 

      Petrini, Sonia; Casas Muñoz, Antoni; Cluet Martinell, Jordi; Wang, Mengxue; Bentz, Christian; Ferrer Cancho, Ramon (2023)
      Article
      Accés obert
      Zipf’s law of abbreviation, the tendency of more frequent words to be shorter, is one of the most solid candidates for a linguistic universal, in the sense that it has the potential for being exceptionless or with a number ...

    • Displacement logic for anaphora 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2014-03)
      Article
      Accés obert
      The displacement calculus of Morrill, Valentín and Fadda (2011) [25] aspires to replace the calculus of Lambek (1958) [13] as the foundation of categorial grammar by accommodating intercalation as well as concatenation ...

    • Efficient coding in dolphin surface behavioral patterns 

      Ferrer Cancho, Ramon; Lusseau, David (2009-05)
      Article
      Accés obert
      We show that the law of brevity, i.e. the tendency of words to shorten as their frequency increases, is also found in dolphin surface behavioral patterns. As far as we know, this is the first evidence of the law in another ...