An adjacency pair, used in conversational analysis, is a pair of conversational turns by two different speakers such that the production of the first turn (called a first-pair part) makes a response (a second-pair part) of a particular kind relevant. For example, a question, such as "what's your name?", requires the addressee to provide an answer in the next conversational turn. A failure to give an immediate response is noticeable and accountable. Many actions in conversation are accomplished through adjacency pair sequences, for example:
*offer-acceptance/rejection
*greeting-greeting
*complaint-excuse/remedy
*request-acceptance/denial

* [http://bank.ugent.be/da/ap.htm Adjacency pairs with (dis)preferred seconds]

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Conversation analysis — (commonly abbreviated as CA) is the study of talk in interaction (both verbal and non verbal in situations of everyday life). CA generally attempts to describe the orderliness, structure and sequential patterns of interaction, whether… …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

• Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …   Wikipedia

• Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

• Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

• Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so …   Wikipedia

• Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or …   Wikipedia

• Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …   Wikipedia

• Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …   Wikipedia