In previous work, we presented a preliminary study to identify paraphrases between technical and lay discourse types from medical corpora dedicated to the French language. In this paper, we test the hypothesis that the same kinds of paraphrases as for French can be detected between English technical and lay discourse types and report the adaptation of our method from French to English. Starting...

It follows from work of Andrews and Bressoud that for t the number of parti tions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size t We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for rowed plane partitions The bijection yields several re nements of the identity when the partition counts are pa...

Apun is a form of wordplay in which aword suggests two or more meanings by exploiting polysemy, homonymy, or phonological similarity to another word, for an intended humorous or rhetorical effect. Though a recurrent and expected feature in many discourse types, puns stymie traditional approaches to computational lexical semantics because they violate their one-sense-percontext assumption. This ...

Let it(G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how large it(G) could be in graphs with minimum degree at least δ. They further conjectured that when n ≥ 2δ and t ≥ 3, it(G) is maximized by the complete bipartite graph Kδ,n−δ. This conjecture has drawn the attention of many researchers recently. In this short note, we prove this conjecture.