Notice bibliographique
Résumé
Developing computational algorithms that capture the complex structure\nof natural language is an open problem. In particular, learning the\nabstract properties of language only from usage data remains a\nchallenge. In this dissertation, we present a probabilistic\nusage-based model of verb argument structure acquisition that can\nsuccessfully learn abstract knowledge of language from instances of\nverb usage, and use this knowledge in various language tasks. The\nmodel demonstrates the feasibility of a usage-based account of\nlanguage learning, and provides concrete explanation for the\nobserved patterns in child language acquisition.\n\nWe propose a novel representation for the general constructions of\nlanguage as probabilistic associations between syntactic and semantic\nfeatures of a verb usage; these associations generalize over the\nsyntactic patterns and the fine-grained semantics of both the verb and\nits arguments. The probabilistic nature of argument structure\nconstructions in the model enables it to capture both statistical\neffects in language learning, and adaptability in language use. The\nacquisition of constructions is modeled as detecting similar usages\nand grouping them together. We use a probabilistic measure of\nsimilarity between verb usages, and a Bayesian framework for\nclustering them. Language use, on the other hand, is modeled as a\nprediction problem: each language task is viewed as finding the best\nvalue for a missing feature in a usage, based on the available\nfeatures in that same usage and the acquired knowledge of language so\nfar. In formulating prediction, we use the same Bayesian framework as\nused for learning, a formulation which takes into account both the\ngeneral knowledge of language (i.e., constructions) and the specific\nbehaviour of each verb. We show through computational simulation that\nthe behaviour of the model mirrors that of young children in some\nrelevant aspects. The model goes through the same learning stages as\nchildren do: the conservative use of the more frequent usages for each\nindividual verb at the beginning, followed by a phase when general\npatterns are grasped and applied overtly, which leads to occasional\novergeneralization errors. Such errors cease to be made over time as\nthe model processes more input.\n\nWe also investigate the learnability of verb semantic roles, a\ncritical aspect of linking the syntax and semantics of verbs. In\ncontrary to many existing linguistic theories and computational models\nwhich assume that semantic roles are innate and fixed, we show that\ngeneral conceptions of semantic roles can be learned from the semantic\nproperties of the verb arguments in the input usages. We represent\neach role as a semantic profile for an argument position in a general\nconstruction, where a profile is a probability distribution over a set\nof semantic properties that verb arguments can take. We extend this\nview to model the learning and use of verb selectional preferences, a\nphenomenon usually viewed as separate from verb semantic roles. Our\nexperimental results show that the model learns intuitive profiles for\nboth semantic roles and selectional preferences. Moreover, the learned\nprofiles are shown to be useful in various language tasks as observed\nin reported experimental data on human subjects, such as resolving\nambiguity in language comprehension and simulating human plausibility\njudgements.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,004 | 0,017 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,002 |
| Bibliométrie | 0,002 | 0,002 |
| Études des sciences et des technologies | 0,001 | 0,003 |
| Communication savante | 0,003 | 0,009 |
| Science ouverte | 0,003 | 0,002 |
| Intégrité de la recherche | 0,002 | 0,003 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,005 | 0,001 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».