Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "constraint-based grammar" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Aligning speech and co-speech gestu re in a constraint-based grammar
Autorzy:
Alahverdzhieva, K.
Lascarides, A.
Flickinger, D.
Powiązania:
https://bibliotekanauki.pl/articles/103813.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
co-speech gesture
constraint-based grammar
compositional semantics
underspecification
Opis:
This paper concerns the form-meaning mapping of communicative action consisting of speech and improvised co-speech gestures. Based on the findings of previous cognitive and computational approaches, we advance a new theory in which this form-meaning mapping is analysed in a constraint-based grammar. Motivated by observations in naturally occurring examples, we propose several construction rules, which use linguistic form, gesture form and their relative timing to constrain the derivation of a single speech-gesture syntax tree, from which a meaning representation can be composed via standard methods for semantic composition. The paper further reports on implementing these speech-gesture construction rules within the English Resource Grammar (Flickinger 2000). Since gestural form of ten underspecifies its meaning, the logical formulae that are composed via syntax are underspecified so that current models of the semantics/pragmatics interface support the range of possible interpretations of the speech-gesture act in its context of use.
Źródło:
Journal of Language Modelling; 2017, 5, 3; 421-464
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
LFG parse disambiguation for Wolof
Autorzy:
Dione, C. M. B.
Powiązania:
https://bibliotekanauki.pl/articles/103945.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
LFG
computational grammar
Constraint Grammar
c-structure pruning
discriminant-based disambiguation
Wolof
underspecification
optimality marks
Opis:
This paper presents several techniques for managing ambiguity in LFG parsing of Wolof, a less-resourced Niger-Congo language. Ambiguity is pervasive in Wolof and This raises a number of theoretical and practical issues for managing ambiguity associated with different objectives. From a theoretical perspective, the main aim is to design a large-scale grammar for Wolof that is able to make linguistically motivated disambiguation decisions, and to find appropriate ways of controlling ambiguity at important interface representations. The practical aim is to develop disambiguation strategies to improve the performance of the grammar in terms of efficiency, robustness and coverage. To achieve these goals, different avenues are explored to manage ambiguity in the Wolof grammar, including the formal encoding of noun class indeterminacy, lexical specifications, the use of Constraint Grammar models (Karlsson 1990) for morphological disambiguation, the application of the c-structure pruning mechanism (Cahill et al. 2007, 2008; Crouch et al. 2013), and the use of optimality marks for preferences (Frank et al. 1998, 2001). The parsing system is further controlled by packing ambiguities. In addition, discriminant-based techniques for parse disambiguation (Rosén et al. 2007) are applied for treebanking purposes.
Źródło:
Journal of Language Modelling; 2014, 2, 1; 105-165
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint summation in phonological theory
Autorzy:
Magri, Giorgio
Storme, Benjamin
Powiązania:
https://bibliotekanauki.pl/articles/1818888.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
constraint-based phonology
optimality theory
harmonic grammar
dispersion theory
paradigm uniformity
optimal paradigms model
Opis:
The classical constraints used in phonological theory apply to a single candidate at a time. Yet, some proposals in the phonological literature have enriched the classical constraint toolkit with constraints that instead apply to multiple candidates simultaneously. For instance, Dispersion Theory (Flemming 2002, 2004, 2008) adopts distinctiveness constraints that penalize pairs of surface forms which are not sufficiently dispersed. Also, some approaches to paradigm uniformity effects (Kenstowicz 1997; McCarthy 2005) adopt Optimal Paradigm faithfulness constraints that penalize pairs of stems in a paradigm which are not sufficiently similar. As a consequence, these approaches need to “lift” the classical constraints from a single candidate to multiple candidates by summing constraint violations across multiple candidates. Is this assumption of constraint summation typologically innocuous? Or do the classical constraints make different typological predictions when they are summed, independently of the presence of distinctiveness or optimal paradigm faithfulness constraints? The answer depends on the underlying model of constraint optimization, namely on how the profiles of constraint violations are ordered to determine the smallest one. Extending an independent result by Prince (2015), this paper characterizes those orderings for which the assumption of constraint summation is typologically innocuous. As a corollary, the typological innocuousness of constraint summation is established within both Optimality Theory and Harmonic Grammar.
Źródło:
Journal of Language Modelling; 2020, 8, 2; 251--294
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint summation in phonological theory
Autorzy:
Magri, Giorgio
Storme, Benjamin
Powiązania:
https://bibliotekanauki.pl/articles/1818892.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
constraint-based phonology
optimality theory
harmonic grammar
dispersion theory
paradigm uniformity
optimal paradigms model
Opis:
The classical constraints used in phonological theory apply to a single candidate at a time. Yet, some proposals in the phonological literature have enriched the classical constraint toolkit with constraints that instead apply to multiple candidates simultaneously. For instance, Dispersion Theory (Flemming 2002, 2004, 2008) adopts distinctiveness constraints that penalize pairs of surface forms which are not sufficiently dispersed. Also, some approaches to paradigm uniformity effects (Kenstowicz 1997; McCarthy 2005) adopt Optimal Paradigm faithfulness constraints that penalize pairs of stems in a paradigm which are not sufficiently similar. As a consequence, these approaches need to “lift” the classical constraints from a single candidate to multiple candidates by summing constraint violations across multiple candidates. Is this assumption of constraint summation typologically innocuous? Or do the classical constraints make different typological predictions when they are summed, independently of the presence of distinctiveness or optimal paradigm faithfulness constraints? The answer depends on the underlying model of constraint optimization, namely on how the profiles of constraint violations are ordered to determine the smallest one. Extending an independent result by Prince (2015), this paper characterizes those orderings for which the assumption of constraint summation is typologically innocuous. As a corollary, the typological innocuousness of constraint summation is established within both Optimality Theory and Harmonic Grammar.
Źródło:
Journal of Language Modelling; 2020, 8, 2; 251--294
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies