Re: Computing n-grams

• To: mathgroup at smc.vnet.net
• Subject: [mg88954] Re: [mg88913] Computing n-grams
• From: Curtis Osterhoudt <cfo at lanl.gov>
• Date: Thu, 22 May 2008 02:36:33 -0400 (EDT)
• Organization: LANL
• References: <200805211849.OAA10371@smc.vnet.net>

```  Partition[ myList, n, 1]

Hope that helps!
C.O.

On Wednesday 21 May 2008 12:49:40 Coleman, Mark 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

--
==========================================================
Curtis Osterhoudt
cfo at remove_this.lanl.and_this.gov
PGP Key ID: 0x4DCA2A10
Please avoid sending me Word or PowerPoint attachments
See http://www.gnu.org/philosophy/no-word-attachments.html
==========================================================

```

• References:
• Prev by Date: Re: Redundant manipulate
• Next by Date: Re: Computing n-grams
• Previous by thread: Re: Computing n-grams
• Next by thread: Re: Computing n-grams