Re: Computing n-grams

*To*: mathgroup at smc.vnet.net*Subject*: [mg88971] Re: [mg88913] Computing n-grams*From*: "Richard Palmer" <rhpalmer at gmail.com>*Date*: Thu, 22 May 2008 02:39:47 -0400 (EDT)*References*: <200805211849.OAA10371@smc.vnet.net>

Try Partition[list,n,1] where list is the list to be partitioned On 5/21/08, Coleman, Mark <Mark.Coleman at libertymutual.com> wrote: > > Greetings, > > Imagine one has a list such as {a,b,c,d,e,f,g}. I'm trying to find an > efficient way in Mathematica to compute the n-grams of the list. That is, > for > n=2, the n-grams are all the lists of length 2 consisting of consecutive > elements, e.g., > > {a,b},{b,c},{c,d},{d,e},... > > While for n=3, > > {a,b,c},{b,c,d},{c,d,e},..., and so on. > > As I understand it, the built-in Mathematica commands such as Subsets or > Permutations compute all possible list of size n, without regard to the > order of the list elements. > > Thanks, > > Mark > > > -- Richard Palmer Home 508 877-3862 Cell 508 982-7266

**References**:**Computing n-grams***From:*"Coleman, Mark" <Mark.Coleman@LibertyMutual.com>