Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 6,573 papers for “Contiguity”
Harjunpää, Katariina · OSF Preprints (OSF Preprints) · 2022
Contiguity is the property of an element in conversation and another element that is the “next one due” (Schegloff 2007: 15) being positioned in immediate proximity to each other.
Cited by 0Open access
Stanford University Press eBooks · 2010
Cited by 0
Stanford University Press eBooks · 2010
Cited by 0
Norvin Richards · Project Muse (Johns Hopkins University) · 2016
Cited by 0
Norman A. Govoni · Dictionary of Marketing Communications · 2004
Cited by 0
Vincent Bouchitte, Abdelmajid Hilali, Roland Jegou et al. · 1993
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict generalization of both interval orders and N--free orders, and is linearly recognizable. It is proved that computing the number of contiguity extensions is #P-complete, and that the dimension of height one contiguity orders is polynomially tractable. Moreover the membership is a comparability invariant on bi-contiguity orders. Finally for strong--contiguity orders the calculation of the dimension is NP-complete.
Cited by 0
José A. Capitán A, Alex Arenas B, Roger Guimerà E et al. · 2013
! Real food-webs are compatible with a high degree of intervality.! Models are compatible with the opposite taking body size as proxy for niche values.! Our model narrows down the range of possible values of diet contiguity.! Our model is more sensitive to changes in intervality than current models.! We conclude that the degree of intervality of real food webs must be high. a r t i c l e i n f o Article history:
Cited by 0
Bouchitté, Vincent, Hilali, Abdelmajid, Jégou, Roland et al. · SPIRE - Sciences Po Institutional REpository · 1993
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict generalization of both interval orders and N-free orders and is linearly recognizable. It is proved that computing the number of contiguity extensions is #P-complete and that the dimension of height one contiguity orders is polynomially tractable. Moreover the membership is a comparability invariant on bi-contiguity orders. Finally for strong-contiguity orders the calculation of the dimension is NP-complete.
Cited by 0
Michael Christopher Brown
Cited by 0
Arthur M. Glenberg, Margaret M. Bradley · Journal of Experimental Psychology Human Learning & Memory · 1979
Cited by 15
Norvin Richards · The MIT Press eBooks · 2016
Cited by 34
Landman, Meredith · Scholarworks (University of Massachusetts Amherst) · 2020
Cited by 4Open access
Richards, Norvin 1971-
Cited by 0
Vincent Bouchitte, Abdelmajid Hilali, Roland Jegou et al. · 1993
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict generalization of both interval orders and N-free orders, and is linearly recognizable. It is proved that computing the number of contiguity extensions is #P-complete, and that the dimension of height one contiguity orders is polynomially tractable. Moreover the membership is a comparability invariant on bi-contiguity orders. Finally for strong-contiguity orders the calculation of the dimension is NP-complete.
Cited by 0
B. J. K. Kleijn, Stefano Rizzelli · Journal of Applied Probability · 2025
Abstract Asymptotic properties of random graph sequences, like the occurrence of a giant component or full connectivity in Erdös–Rényi graphs, are usually derived with very specific choices for the defining parameters. The question arises as to what extent those parameter choices may be perturbed without losing the asymptotic property. For two sequences of graph distributions, asymptotic equivalence (convergence in total variation) and contiguity have been considered by Janson (2010) and others; here we use so-called remote contiguity to show that connectivity properties are preserved in more heavily perturbed Erdös–Rényi graphs. The techniques we demonstrate here with random graphs also extend to general asymptotic properties, e.g. in more complex large-graph limits, scaling limits, large-sample limits, etc.
Cited by 0Open access
Greg Lamontagne · 1996
Often processes which truncate or augment a string are simply reflections of prosodic organization. Principles of syllabification, for example, are the major catalyst for the string modifications in (1): In (1a), a consonant deletes due to a prohibition on syllable Codas (see Steriade,
Cited by 0
Chen Lihan · 2024
Cited by 0
Nilay Ekiz Yazici, Ayşe Borat · Journal of Fixed Point Theory and Applications · 2026
Abstract In this paper, we introduce higher analogues of the contiguity distance and its relations with the simplicial Lusternik–Schnirelmann category and discrete topological complexity. We also investigate the effect of barycentric subdivision on higher contiguity distance. Finally, we establish a connection between higher contiguity distance and higher homotopic distance via geometric realisation.
Cited by 0Open access
Leo Depuydt · 1993
Abstract This monograph comprises three intimately related studies on the grammar of hieroglyphic Egyptian and its linear descendant, Coptic, covering a period of 4000 years of language history. Depuydt approaches the subject from the standpoint of the ‘Standard Theory’ developed by his mentor, the distinguished Egyptologist, Hans Jakob Polotsky. The first essay studies the verb form called ‘conjunctive’, arguing that the function of the conjunctive is to ‘conjoin’ a chain of two or more events into a single—though compound—notion. The second essay shows how a certain syntactic construction can be used to refer to events that are contiguous, that is, events that succeed one another rapidly in time. The third essay examines verb forms that refer to events whose occurrence is contingent on the occurrence of other events implied or explicitly mentioned in the context. The respective grammatical phenomena are labelled conjunction, continguity and contingency. Taken together, these three studies constitute a significant advance in our understanding of the ancient languages of Egypt.
Cited by 3
Jason Kandybowicz · Oxford University Press eBooks · 2020
This chapter concludes the book by considering Anti-contiguity in a cross-linguistic context. It is shown that the proposal can be successfully applied to derive asymmetries in <italic>wh</italic>- in-situ distribution beyond the West African languages considered in Chapters 2–4. The chapter focuses on thirteen languages from diverse language families (Romance, Bantu, and Indo-Aryan, among others) and considers the implications of data from these languages for the final formulation of the Anti-contiguity condition. On the basis of these considerations, the Anti-contiguity constraint is parameterized. Among the languages considered against the backdrop of the Anti-contiguity proposal in this chapter are French; Spanish; Catalan; Zulu; Bàsàá; Duala; Shona; Lubukusu; Kiitharaka; Hindi-Urdu; Bangla; Iraqi Arabic; and Malayalam.
Cited by 0