| 1. |
- Amanaki, Erini, et al.
(författare)
-
Fine-grained Entailment: Resources for Greek NLI and Precise Entailment
- 2022
-
Ingår i: Proceedings of the Workshop on Dataset Creation for Lower-Resourced Languages within the 13th Language Resources and Evaluation Conference. - Marseille, France : European Language Resources Association (ELRA). - 9782493814067
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present a number of fine-grained resources for Natural Language Inference (NLI). In particular, we present a number of resources and validation methods for Greek NLI and a resource for precise NLI. First, we extend the Greek version of the FraCaS test suite to include examples where the inference is directly linked to the syntactic/morphological properties of Greek. The new resource contains an additional 428 examples, making it in total a dataset of 774 examples. Expert annotators have been used in order to create the additional resource, while extensive validation of the original Greek version of the FraCaS by non-expert and expert subjects is performed. Next, we continue the work initiated by (CITATION), according to which a subset of the RTE problems have been labeled for missing hypotheses and we present a dataset an order of magnitude larger, annotating the whole SuperGlUE/RTE dataset with missing hypotheses. Lastly, we provide a de-dropped version of the Greek XNLI dataset, where the pronouns that are missing due to the pro-drop nature of the language are inserted. We then run some models to see the effect of that insertion and report the results.
|
|
| 2. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
A Compositional Bayesian Semantics for Natural Language
- 2018
-
Ingår i: Proceedings of the First International Workshop on Language Cognition and Computational Models, COLING 2018, August 20, 2018 Santa Fe, New Mexico, USA. - : COLING. - 1525-2477. - 9781948087575
-
Konferensbidrag (refereegranskat)abstract
- We propose a compositional Bayesian semantics that interprets declarative sentences in a natural language by assigning them probability conditions. These are conditional probabilities that estimate the likelihood that a competent speaker would endorse an assertion, given certain hypotheses. Our semantics is implemented in a functional programming language. It estimates the marginal probability of a sentence through Markov Chain Monte Carlo (MCMC) sampling of objects in vector space models satisfying specified hypotheses. We apply our semantics to examples with several predicates and generalised quantifiers, including higher-order quantifiers. It captures the vagueness of predication (both gradable and non-gradable), without positing a precise boundary for classifier application. We present a basic account of semantic learning based on our semantic system. We compare our proposal to other current theories of probabilistic semantics, and we show that it offers several important advantages over these accounts.
|
|
| 3. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
A Computational Treatment of Anaphora and its Algorithmic Implementation
- 2021
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 30, s. 1-29
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach-Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.
|
|
| 4. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
A Wide-Coverage Symbolic Natural Language Inference System
- 2019
-
Ingår i: Proceedings of the 22nd Nordic Conference on Computational Linguistics, 30 September – 2 October, 2019, Turku, Finland / Mareike Hartmann, Barbara Plank (Editors). - University of Linköping : Linköping University Electronic Press. - 1650-3686 .- 1650-3740. - 9789179299958
-
Konferensbidrag (refereegranskat)
|
|
| 5. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Applied Temporal Analysis: A Complete Run of the FraCaS Test Suite
- 2021
-
Ingår i: Proceedings of the 14th International Conference on Computational Semantics, June 17 - 18, 2021, Groningen, The Netherlands (Online). - Stroudsburg, PA : The Association for Computational Linguistics. - 9781954085190
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we propose an implementation of temporal semantics that translates syntax trees to logical formulas, suitable for consumption by the Coq proof assistant. The analysis supports a wide range of phenomena including: temporal references, temporal adverbs, aspectual classes and progressives. The new semantics are built on top of a previous system handling all sections of the FraCaS test suite except the temporal reference section, and we obtain an accuracy of 81 percent overall and 73 percent for the problems explicitly marked as related to temporal reference. To the best of our knowledge, this is the best performance of a logical system on the whole of the FraCaS.
|
|
| 6. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Bayesian Inference Semantics: A Modelling System and A Test Suite
- 2019
-
Ingår i: Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (*SEM), 6-7 June 2019, Minneapolis, Minnesota, USA / Rada Mihalcea, Ekaterina Shutova, Lun-Wei Ku, Kilian Evang, Soujanya Poria (Editors). - Stroudsburg, PA : Association for Computational Linguistics. - 9781948087933
-
Konferensbidrag (refereegranskat)abstract
- We present BIS, a Bayesian Inference Semantics, for probabilistic reasoning in natural language. The current system is based on the framework of Bernardy et al. (2018), but departs from it in important respects. BIS makes use of Bayesian learning for inferring a hypothesis from premises. This involves estimating the probability of the hypothesis, given the data supplied by the premises of an argument. It uses a syntactic parser to generate typed syntactic structures that serve as input to a model generation system. Sentences are interpreted compositionally to probabilistic programs, and the corresponding truth values are estimated using sampling methods. BIS successfully deals with various probabilistic semantic phenomena, including frequency adverbs, generalised quantifiers, generics, and vague predicates. It performs well on a number of interesting probabilistic reasoning tasks. It also sustains most classically valid inferences (instantiation, de Morgan’s laws, etc.). To test BIS we have built an experimental test suite with examples of a range of probabilistic and classical inference patterns.
|
|
| 7. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Bayesian Inference Semantics for Natural Language
- 2022
-
Ingår i: Probabilistic Approaches to Linguistic Theory / edited by Jean-Philippe Bernardy, Rasmus Blanck, Stergios Chatzikyriakidis, Shalom Lappin, Aleksandre Maskharashvili.. - Stanford : CSLI Publications. - 9781684000791 ; , s. 161-228
-
Bokkapitel (refereegranskat)abstract
- We present a Bayesian Inference Semantics for natural language, which computes the probability conditions of sentences compositionally, through semantic functions matching with the types of their syntactic constituents. This system captures the vagueness of classifier terms and scalar modifiers. It also offers a straightforward treatment of the sorites paradox. Our framework expresses probabilistic inferences, which rely on lexically encoded priors, and it captures the effect of informational update on these inferences, through Bayesian modelling. The central device with which we represent probabilistic interpretation is the assignment of measurable spaces to objects and properties. We estimate the probability of a predication by measuring the density of relevant objects in the space of the property that the predicate denotes. We explore two alternative models for the priors. The first one is based on Gaussian distributions, but it exhibits computational intractability with some cases of Monte Carlo sampling. The second is based on uniform densities, and in a number of important instances, it allows us to avoid Monte Carlo sampling. We construct a test suite to illustrate the range of syntactic and semantic constructions, and the inference types, that our system covers.
|
|
| 8. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Improving the precision of natural textual entailment problem datasets
- 2020
-
Ingår i: Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020), Marseille, 11–16 May 2020. - Paris : ELRA – European Language Resources Association. - 9791095546344
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we propose a method to modify natural textual entailment problem datasets so that they better reflect a more precise notion of entailment. We apply this method to a subset of the Recognizing Textual Entailment datasets. We thus obtain a new corpus of entailment problems, which has the following three characteristics: 1. it is precise (does not leave out implicit hypotheses) 2. it is based on ``real-world'' texts (i.e. most of the premises were written for purposes other than testing textual entailment). 3. its size is 150. % Broadly, the method that we employ is to make any missing hypotheses explicit using a crowd of experts. We discuss the relevance of our method in improving existing NLI datasets to be more fit for precise reasoning and we argue that this corpus can be the basis a first step towards wide-coverage testing of precise natural-language inference systems.
|
|
| 9. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Predicates as Boxes in Bayesian Semantics for Natural Language
- 2019
-
Ingår i: Proceedings of the 22nd Nordic Conference on Computational Linguistics (NoDaLiDa 2019), 30 September-2 October, 2019, Turku, Finland / Mareike Hartmann, Barbara Plank (Editors). - Linköping : Linköping University Electronic Press. - 1650-3686 .- 1650-3740. - 9789179299958
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present a Bayesian approach to natural language semantics. Our main focus is on the inference task in an environment where judgments require probabilistic reasoning. We treat nouns, verbs, adjectives, etc. as unary predicates, and we model them as boxes in a bounded domain. We apply Bayesian learning to satisfy constraints expressed as premises. In this way we construct a model, by specifying boxes for the predicates. The probability of the hypothesis (the conclusion) is evaluated against the model that incorporates the premises as constraints.
|
|
| 10. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
What Kind of Natural Language Inference are NLP Systems Learning: Is this Enough?
- 2019
-
Ingår i: Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2, February 19-21, 2019, Prague, Czech Republic / editors: Ana Rocha ; Luc Steels and Jaap van den Herik. - : SciTePress. - 9789897583506
-
Konferensbidrag (refereegranskat)
|
|
| 11. |
- Bizzoni, Yuri, 1989, et al.
(författare)
-
"Deep" Learning : Detecting Metaphoricity in Adjective-Noun Pairs
- 2017
-
Ingår i: Proceedings of the Workshop on Stylistic Variation, EMNLP2017, Copenhagen, Denmark, September 7–11, 2017. - Copenhagen, Denmark : Association for Computational Linguistics (ACL). - 9781945626999
-
Konferensbidrag (refereegranskat)abstract
- Metaphor is one of the most studied and widespread figures of speech and an essential element of individual style. In this paper we look at metaphor identification in Adjective-Noun pairs. We show that using a single neural network combined with pre-trained vector embeddings can outperform the state of the art in terms of accuracy. In specific, the approach presented in this paper is based on two ideas: a) transfer learning via using pre-trained vectors representing adjective noun pairs, and b) a neural network as a model of composition that predicts a metaphoricity score as output. We present several different architectures for our system and evaluate their performances. Variations on dataset size and on the kinds of embeddings are also investigated. We show considerable improvement over the previous approaches both in terms of accuracy and w.r.t the size of annotated training data.
|
|
| 12. |
- Chatzikyriakidis, Stergios, 1980
(författare)
-
A Dynamic Account of Clitic Climbing: A First Sketch.
- 2009
-
Ingår i: The Dynamics of Lexical Interfaces. - : Center for the Study of Language and Information (CSLI). - 9781575866147
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 13. |
- Chatzikyriakidis, Stergios, 1980
(författare)
-
A dynamic account of clitic positioning in Cypriot Greek
- 2012
-
Ingår i: Lingua. - 0024-3841.
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, a full account of clitic positioning in Cypriot Greek is attempted within the framework of Dynamic Syntax. Firstly, it is shown that the existing approaches dealing with CG clitic positioning are inadequate to deal with the full range of clitic positioning phenomena as these are described by Pappas (2010) and Chatzikyriakidis (2010). Then it is argued that this complex system can be effectively captured assuming a lexical entry where three generalized parsing strategies, i.e. ways of structure building, function as lexical triggers for parsing CG clitics. Variation in positioning with the non-factive complementizer oti as well as the causal subordinator epidi are accounted for assuming that these elements can be parsed as either subordinators or coordinators. Furthermore, the challenge of providing an account for complex markers/subordinators formed with the coordinator tze is provided, arguing that the unexpected enclisis caused in these cases is due to the fact that these elements provide two separate linked domains where the first acts as the context in which the second is parsed (e.g. a negative context). Lastly, the account proposed will be shown to be grounded in historical considerations as well, arguing that the transition from a descriptively simpler system (that of Medieval Cypriot Greek, MCG) to a more complex one (CG) is only epiphenomenal, showing that the transition from MCG to CG involves simplification of the lexical entry for clitics.
|
|
| 14. |
|
|
| 15. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
A Type-Theoretical system for the FraCaS test suite: Grammatical Framework meets Coq.
- 2017
-
Ingår i: Proceedings of IWCS 2017 long papers volume, ACL anthology W17 - 68 xx. 12th International Conference on Computational Semantics, Montpellier 19 - 22 September 2017. Edited by Claire Gardent & Christian Retoré. - : Association for Computational Linguistics.
-
Konferensbidrag (refereegranskat)
|
|
| 16. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Adjectival and Adverbial Modification: The View from Modern Type Theories
- 2017
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 26:1, s. 45-88
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we present a study of adjectival/adverbial modification using modern type theories (MTTs), i.e. type theories within the tradition of Martin-Lof. We present an account of various issues concerning adjectival/adverbial modification and argue that MTTs can be used as an adequate language for interpreting NL semantics. MTTs are not only expressive enough to deal with a range of modification phenomena, but are furthermore well-suited to perform reasoning tasks that can be easily implemented (e.g. in proof-assistants) given their proof-theoretic nature. In MTT-semantics, common nouns are interpreted as types rather than predicates. Therefore, in order to capture the semantics of adjectives adequately, one needs to meet the challenge of modeling CNs modified by adjectives as types. To explicate that this can be done successfully, we first look at the mainstream classification of adjectives, i.e. intersective, subsective and non-subsective adjectives. There, we show that the rich type structure available in MTTs, along with a suitable subtyping framework, offers an adequate mechanism to model these cases. In particular, this modelling naturally takes care of the characterising inferences associated with each class of adjectives. Then, more advanced issues on adjectival modification are discussed: (a) degree adjectives, (b) comparatives and (c) multidimensional adjectives. There, it is shown that the use of indexed types can be usefully applied in order to deal with these cases. In the same vein, the issue of adverbial modification is discussed. We study two general typings for sentence and VP adverbs respectively. It is shown that the rich type structure in MTTs further provides useful organisational mechanisms in giving formal semantics for adverbs. In particular, we discuss the use of -types to capture the veridicality/non-veridicality distinction and further discuss cases of intensional adverbs using the type theoretic notion of context (i.e. without resorting to intensional typing). We also look at manner, subject and speech act adverbials and propose solutions using MTTs. Finally, we show that the current proof technology can help mechanically check the associated inferences. A number of our proposals concerning adjectival and adverbial modification have been formalised in the proof assistant Coq and many of the associated inference patterns are checked to be correctly captured.
|
|
| 17. |
|
|
| 18. |
|
|
| 19. |
|
|
| 20. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Clitics as Calcified Processing Strategies
- 2009
-
Ingår i: Proceedings of the 14th international conference on Lexical Functional Grammar. - : Center for the Study of Language and Information (CSLI). - 1098-6782 .- 1098-6782.
-
Konferensbidrag (refereegranskat)
|
|
| 21. |
|
|
| 22. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Cognitive science, language as a tool for interaction, and a new look at language evolution
- 2017
-
Ingår i: Proceedings of the Formal Approaches to the Dynamics of Linguistic Interaction workshop, ESSLLI 2017. Toulouse, France, July 17-21, 2017. Edited by Christine Howes, Hannes Rieser. Vol 1863.. - Aachen : M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen. - 1613-0073.
-
Konferensbidrag (refereegranskat)
|
|
| 23. |
- Chatzikyriakidis, Stergios, 1980
(författare)
-
Constructive Dynamic syntax
- 2019
-
Ingår i: 3rd Dynamic Syntax Conference, Valleta, Malta, 16-17 May 2019.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 24. |
|
|
| 25. |
|
|
| 26. |
|
|
| 27. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Gradability in MTT-semantics
- 2019
-
Ingår i: Thirteenth International Tbilisi Symposium on Language, Logic and Computation, 16 -20 September 2019.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 28. |
|
|
| 29. |
|
|
| 30. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Intro: Modern Perspectives in Type Theoretical Semantics
- 2017
-
Ingår i: Modern Perspectives in Type Theoretical Semantics edited by Stergios Chatzikyriakidis, Zhaohui Luo.. - Cham : Springer International Publishing. - 9783319504209 ; , s. 1-8
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 31. |
|
|
| 32. |
- Chatzikyriakidis, Stergios, 1980
(författare)
-
Modification in Dynamic Syntax
- 2017
-
Ingår i: Peer-reviewed abstract and presentation at the 1st Dynamic Syntax Conference. 19 -20 April 2017, London.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 33. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
On the Interpretation of Common Nouns: Types versus Predicates
- 2016
-
Ingår i: Modern Perspectives in Type-Theoretical Semantics / Chatzikyriakidis, Stergios, Luo, Zhaohui (eds.). - Cham : Springer. - 0924-4662. - 9783319504209 ; , s. 43-70
-
Bokkapitel (refereegranskat)
|
|
| 34. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Prepositional genitives in Northern Greek: beyond suppletion.
- 2016
-
Ingår i: Peer-reviewed abstract and presentation at the 7th International Conference on Modern Greek dialects and Linguistic Theory. 6-8 Οctober 2016, House of Culture, Rethymno.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 35. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Promiscuous apo-phrases in Grevena Greek
- 2015
-
Ingår i: Peer-reviewed abstract and presentation at the 12th International Conference on Greek Linguistics, 16-19 September, 2015, Berlin..
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 36. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Proof Assistants for Natural Language Semantics
- 2016
-
Ingår i: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) 9th International Conference, LACL 2016, Nancy, France, December 5-7, 2016, Proceedings / edited by Maxime Amblard, Philippe de Groote, Sylvain Pogodalla, Christian Retoré.. - Springer : Berlin Heidelberg. - 0302-9743. - 9783662538258
-
Konferensbidrag (refereegranskat)abstract
- In this paper we discuss the use of interactive theorem provers (also called proof assistants) in the study of natural language semantics. It is shown that these provide useful platforms for NL semantics and reasoning on the one hand, and allow experiments to be performed on various frameworks and new theories, on the other. In particular, we show how to use Coq, a prominent type theory based proof assistant, to encode type theoretical semantics of various NL phenomena. In this respect, we can encode the NL semantics based on type theory for quantifiers, adjectives, common nouns, and tense, among others, and it is shown that Coq is a powerful engine for checking the formal validity of these accounts as well as a powerful reasoner about the implemented semantics. We further show some toy semantic grammars for formal semantic systems, like the Montagovian Generative Lexicon, Type Theory with Records and neo-Davidsonian semantics. It is also explained that experiments on new theories can be done as well, testing their validity and usefulness. Our aim is to show the importance of using proof assistants as useful tools in natural language reasoning and verification and argue for their wider application in the field.
|
|
| 37. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Standard Modern and Pontic Greek Person Restrictions: A feature-free Dynamic Account
- 2011
-
Ingår i: Journal of Greek Linguistics. - 1566-5844.
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, using new evidence from Pontic Greek (PG) in addition to Standard Modern Greek, we argue that the Person Case Constraint (PCC), generally presumed to be an irreducible morphosyntactic constraint on clitic pronoun combinations and argued by several to provide evidence of feature-driven syntactic operations, is a direct consequence of processing considerations, these new data being inexplicable under any of the current feature-driven analyses (Anagnostopoulou 2003, 2005; Béjar & Rezac 2003; Bianchi 2006; Adger & Harbour 2007; Nevins 2007; Pescarini 2010 among others). Adopting the Dynamic Syntax (DS) perspective of Cann et al. (2005), in which syntax is defined as the monotonic incremental growth of semantic structure, with structural underspecification and update as the core syntactic notion, we argue that the PCC is wholly due to restrictions on tree-growth imposed by the logic of finite trees: that these should underpin observed gaps in possible clitic combinations is due to clitics being calcified reflexes of previously available tree-growth update-sequences whose variability is the source of word order variation. More specifically, we argue that PCC effects, including the problematic PG data, are the consequence of a tree-logic restriction that only one unfixed node can be present in a tree at any stage in the tree growth process. PG, a dialect in which no 3rd person clitic clusters are allowed, provides strong evidence for such a feature-free account. Contrary to current feature-based analyses, which would preclude such data, the analysis presented here is shown to directly predict the Pontic Greek data, thus pointing towards a feature-free account of the PCC.
|
|
| 38. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
The Bantu-Romance-Greek connection revisited: Processing constraints in auxiliary and clitic placement from a cross-linguistic perspective
- 2017
-
Ingår i: Glossa: a journal of general linguistics. - : Open Library of the Humanities. - 2397-1835. ; 2:1, s. 1-39
-
Tidskriftsartikel (refereegranskat)abstract
- This paper explores a connection between Romance and Greek on the one hand, and Bantu on the other. More specifically, we look at auxiliary placement in Rangi and clitic placement in Tobler Mussafia languages, with a special emphasis on Cypriot Greek, and argue that a common explanation for their distribution can be found once a move into a dynamic framework is made. Rangi exhibits an unusual word order alternation in auxiliary constructions under which the position of the auxiliary appears to be sensitive to an element appearing at the left periphery of the clause. A similar sensitivity to a left-peripheral element can be seen to regulate clitic placement in Cypriot Greek (and generally in the so-called Tobler Mussafia clitic languages). The paper presents a parsing-oriented account of these two phenomena in the Dynamic Syntax framework, arguing that the similarities in syntactic distribution are the result of the encoding in the lexicon of processing strategies that were potentially pragmatic preferences in earlier stages of the respective languages. The account thus leans on the role played by the lexical entries for auxiliary and clitic forms, as well as the assumption that underspecification is inherent in the process of establishing meaning in context. The account is further supplemented by possible pathways of diachronic change that could have given rise to the systems found in present day varieties.
|
|
| 39. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Type Theories and Lexical Networks: using Serious Games as the basis for Multi-Sorted Typed Systems
- 2017
-
Ingår i: Journal of Language Modeling. - : Institute of Computer Science, Polish Academy of Sciences. - 2299-8470 .- 2299-856X. ; 5:2, s. 229-272
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we show how a rich lexico-semantic network which has been built using serious games, JeuxDeMots, can help us in grounding our semantic ontologies as well as different sorts of information in doing formal semantics using rich or modern type theories (type theories within the tradition of Martin Löf). We discuss the domain of base types, adjectival and verbal types, hyperonymy/hyponymy relations as well as more advanced issues like homophony and polysemy. We show how one can take advantage of this wealth in a formal compositional semantics framework. This is a way to sidestep the problem of deciding how your type ontology should look like once you have made a move to a many sorted type system. Furthermore, we show how this kind of information can be extracted from JeuxdeMots and inserted into a proof-assistant like Coq in order to perform reasoning tasks using modern type theoretic semantics.
|
|
| 40. |
- Chatzikyriakidis, Stergios, 1980, et al.
(författare)
-
Type Theories for Natural Language Semantics
- 2018
-
Ingår i: Oxford Research Encyclopedia of Linguistics / Mark Aronoff (eds.). - Oxford : Oxford University Press.
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Type theory is a regime for classifying objects (including events) into categories called types. It was originally designed in order to overcome problems relating to the foundations of mathematics relating to Russell’s paradox. It has made an immense contribution to the study of logic and computer science and has also played a central role in formal semantics for natural languages since the initial work of Richard Montague building on the typed λ-calculus. More recently, type theories following in the tradition created by Per Martin-Löf have presented an important alternative to Montague’s type theory for semantic analysis. These more modern type theories yield a rich collection of types which take on a role of representing semantic content rather than simply structuring the universe in order to avoid paradoxes.
|
|
| 41. |
- Chatzikyriakidis, Stergios, 1980
(författare)
-
Underspecification, Parsing Mismatches and Routinisation: The Historical Development of the Clitic Systems of Greek Dialects
- 2021
-
Ingår i: Journal of Logic Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 30, s. 277-304
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, the historical development of the clitic systems of Standard Modern, Cypriot and Pontic Greek is discussed. These three varieties not only present the whole range of variation one can find across clitic systems in Greek but, furthermore, derive from a common linguistic ancestor, i.e. Koine Greek. This paper argues that the transition from Koine Greek to the Medieval varieties and from the Medieval varieties to the respective modern ones can be explained by making the assumption that routinisation (in the sense of Pickering and Garrod in Behav Brain Sci 27:169-226, 2004) and parsing/hearer assymetries are two important factors behind syntactic change. The claim is that the transition from Koine to the Medieval Greek varieties involves the emergence of a clitic system with encoded syntactic constraints out of a freer one, where clitic positioning was regulated by pragmatic preferences rather than syntactic constraints. Then, the transition to the modern varieties from the respective medieval ones is explained, at least partly, on the assumption that production/parsing mismatches are capable of triggering syntactic change. This last assumption combined with: (a) the tendency to obtain more generalised parsing triggers for parsing the individual clitics and (b) the fact that the Medieval varieties in question differ in minimal but crucial ways, provides us an explanation for the transition to the modern varieties.
|
|
| 42. |
- Cooper, Robin, 1947, et al.
(författare)
-
Testing the FraCaS test suite
- 2016
-
Ingår i: Logic and Engineering of Natural Language Semantics 13 (LENLS 13), November 13th, 2016, Tokyo, Japan. - Tachikawa City, Tokyo, Japan : National Institute for Japanese Language and Linguistics. - 9784915905780
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- In this talk I will present some of the background to the project FraCaS which led to the FraCaS test suite. I will also talk about the MultiFraCaS project and some of our ideas for extending this in the future. The examples in the origi- nal test suite were created by semanticists. I will discuss a number of ways in which one could go about verifying these examples. In particular, I will present some preliminary work we have been doing using web-based forms to collect judgements via crowd-sourcing. We will discuss the implications of some prelim- inary results that we have obtained, in particular the possibility of developing a probabilistic semantics. Crowd-sourcing allows us to extend the notion of inference from strict logical inference to inference that is gradient and is prevalent in lexical meaning. The probabilities obtained through crowd-sourcing tell us the likelihood of a native speaker to make a particular conclusion. Eventually, we hope to extend the entire FraCas suite this way. The original aim of the test suite was to provide a way of evaluating compu- tational systems that perform natural language inference. I will talk about some work applying type theory to this task, with as yet partial coverage of the test suite. The crowd-sourcing methods we have been using to evaluate the test suite can also be used to give an empirical basis to predictions made by semantic theories that are difficult to ascertain by only relying on intuitions of a single linguist. I will present some work we have been doing on the semantics of verbal restructuring, a phenomenon whose semantics has been debated and disagreed upon in the literature, and discuss the preliminary results we have.
|
|
| 43. |
- Ek, Adam, 1990, et al.
(författare)
-
Can argument-predicate relationships be extracted from UD trees?
- 2021
-
Ingår i: Proceedings of the Joint 15th Linguistic Annotation Workshop (LAW) and 3rd Designing Meaning Representations (DMR) Workshop, November 2021. - Punta Cana, Dominican Republic : Association for Computational Linguistics. - 9781954085855
-
Konferensbidrag (refereegranskat)abstract
- In this paper we investigate the possibility of extracting predicate-argument relations from UD trees (and enhanced UD graphs). Concretely, we apply UD parsers on an English question answering/semantic-role labeling data set (FitzGerald et al., 2018) and check if the annotations reflect the relations in the resulting parse trees, using a small number of rules to extract this information. We find that 79.1 % of the argument-predicate pairs can be found in this way, on the basis of Udify (Kondratyuk and Straka, 2019). Error analysis reveals that half of the error cases are attributable to shortcomings in the dataset. The remaining errors are mostly due to predicate-argument relations not being extractible algorithmically from the UD trees (requiring semantic reasoning to be resolved). The parser itself is only responsible for a small portion of errors. Our analysis suggests a number of improvements to the UD annotation schema: we propose to enhance the schema in four ways, in order to capture argument-predicate relations. Additionally, we propose improvements regarding data collection for question answering/semantic-role labeling data.
|
|
| 44. |
- Ek, Adam, 1990, et al.
(författare)
-
How does Punctuation Affect Neural Models in Natural Language Inference
- 2020
-
Ingår i: Proceedings of the Probability and Meaning Conference (PaM 2020), October 14-15, 2020, s. 109-116. - : Association for Computational Linguistics. - 0891-2017.
-
Konferensbidrag (refereegranskat)abstract
- Natural Language Inference models have reached almost human-level performance but their generalisation capabilities have not been yet fully characterized. In particular, sensitivity to small changes in the data is a current area of investigation. In this paper, we focus on the effect of punctuation on such models. Our findings can be broadly summarized as follows: (1) irrelevant changes in punctuation are correctly ignored by the recent transformer models (DistilBERT) while older RNN-based models were sensitive to them. (2) All models, both transformers and RNN-based models, are incapable of taking into account small relevant changes in the punctuation.
|
|
| 45. |
- Gregoromichelaki, Eleni, et al.
(författare)
-
Affordance competition in dialogue: the case of syntactic universals
- 2020
-
Ingår i: Proceedings of SemDial (WatchDial2020), Waltham, Massachusetts, July 18-19 2020 (Online) / Sophia Malamud, James Pustejovsky & Jonathan Ginzburg (eds.). - : SemDial. - 2308-2275.
-
Konferensbidrag (refereegranskat)
|
|
| 46. |
- Gregoromichelaki, Eleni, et al.
(författare)
-
Completability vs (In)completeness
- 2020
-
Ingår i: Acta Linguistica Hafniensia. - : Informa UK Limited. - 0374-0463 .- 1949-0763. ; 52:2, s. 260-284
-
Tidskriftsartikel (refereegranskat)abstract
- © 2020 The Linguistic Circle of Copenhagen. In everyday conversation, no notion of “complete sentence” is required for syntactic licensing. However, so-called “fragmentary”, “incomplete”, and abandoned utterances are problematic for standard formalisms. When contextualised, such data show that (a) non-sentential utterances are adequate to underpin agent coordination, while (b) all linguistic dependencies can be systematically distributed across participants and turns. Standard models have problems accounting for such data because their notions of ‘constituency’ and ‘syntactic domain’ are independent of performance considerations. Concomitantly, we argue that no notion of “full proposition” or encoded speech act is necessary for successful interaction: strings, contents, and joint actions emerge in conversation without any single participant having envisaged in advance the outcome of their own or their interlocutors’ actions. Nonetheless, morphosyntactic and semantic licensing mechanisms need to apply incrementally and subsententially. We argue that, while a representational level of abstract syntax, divorced from conceptual structure and physical action, impedes natural accounts of subsentential coordination phenomena, a view of grammar as a “skill” employing domain-general mechanisms, rather than fixed form-meaning mappings, is needed instead. We provide a sketch of a predictive and incremental architecture (Dynamic Syntax) within which underspecification and time-relative update of meanings and utterances constitute the sole concept of “syntax”.
|
|
| 47. |
- Grove, Julian, 1988, et al.
(författare)
-
From compositional semantics to Bayesian pragmatics via logical inference
- 2021
-
Ingår i: Natural Logic Meets Machine Learning (NALOMA). Proceedings of the 1st and 2nd Workshops, June 16, 2021, online. - Stroudsburg, PA, USA : Association for Computational Linguistics. - 9781954085237
-
Konferensbidrag (refereegranskat)abstract
- Formal semantics in the Montagovian tradition provides precise meaning characterisations, but usually without a formal theory of the pragmatics of contextual parameters and their sensitivity to background knowledge. Meanwhile, formal pragmatic theories make explicit predictions about meaning in context, but generally without a well-defined compositional semantics. We propose a combined framework for the semantic and pragmatic interpretation of sentences in the face of probabilistic knowledge. We do so by (1) extending a Montagovian interpretation scheme to generate a distribution over possible meanings, and (2) generating a posterior for this distribution using a variant of the Rational Speech Act (RSA) models, but generalised to arbitrary propositions. These aspects of our framework are tied together by evaluating entailment under probabilistic uncertainty. We apply our model to anaphora resolution and show that it provides expected biases under suitable assumptions about the distributions of lexical and world-knowledge. Further, we observe that the model's output is robust to variations in its parameters within reasonable ranges.
|
|
| 48. |
|
|
| 49. |
|
|
| 50. |
- Kempson, Ruth, et al.
(författare)
-
Language as Mechanisms for Interaction
- 2016
-
Ingår i: Theoretical Linguistics. - : Walter de Gruyter GmbH. - 0301-4428 .- 1613-4060. ; 42:3-4, s. 203-276
-
Tidskriftsartikel (refereegranskat)abstract
- Language use is full of subsentential shifts of context, a phenomenon dramatically illustrated in conversation where non-sentential utterances displaying seamless shifts between speaker/hearer roles appear regularly. The hurdle this poses for standard assumptions is that every local linguistic dependency can be distributed across speakers, with the content of what they are saying and the significance of each conversational move emerging incrementally. Accordingly, we argue that the modelling of a psychologically-realistic grammar necessitates recasting the notion of natural language in terms of our ability for interaction with others and the environment, abandoning the competence-performance dichotomy as standardly envisaged. We sketch Dynamic Syntax, a model in which underspecification and incremental time-relative update is central, showing how interactive effects of conversation follow directly. Finally, we note the changing cognitive-science horizons to be explored once a language-as-action view is adopted.
|
|
