Counting the amount of letters in all permutations of words in R

Posted by Rhodo on Stack Overflow See other posts from Stack Overflow or by Rhodo
Published on 2013-11-13T15:47:01Z Indexed on 2013/11/13 15:53 UTC
Read the original article Hit count: 228

Filed under:

r

|

permutation

|

counting

I have some words:

shapes<- c("Square", "Triangle","Octagon","Hexagon")

I want to arrange them in pairs:

shapescount<-combn(shapes, 2)

shapescount

[,1]       [,2]      [,3]      [,4]       [,5]       [,6]     
[1,] "Square"   "Square"  "Square"  "Triangle" "Triangle" "Octagon"
[2,] "Triangle" "Octagon" "Hexagon" "Octagon"  "Hexagon"  "Hexagon"

I want to count each of the groupings of the letters in the pairs, for instance first pair is "6" for "Square" and "8" for "Triangle" giving me "14" for the first pair, and so on.

Related posts about permutation

Fast permutation -> number -> permutation mapping algorithms

as seen on Stack Overflow - Search for 'Stack Overflow'
I have n elements. For the sake of an example, let's say, 7 elements, 1234567. I know there are 7! = 5040 permutations possible of these 7 elements. I want a fast algorithm comprising two functions: f(number) maps a number between 0 and 5039 to a unique permutation, and f'(permutation) maps the… >>> More
Doing permutation of different arrays in perl

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello! I want to do permutation in perl. For example I have three arrays. ["big", "tiny", "small"] and then I have ["red", "yellow", "green"] and also ["apple", "pear", "banana"]. How do I get: ["big", "red", "apple"] ["big", "red", "pear"] ..etc.. ["small", "green", "banana"] I understand this… >>> More
Prolog: permutations check and multiple answers

as seen on Stack Overflow - Search for 'Stack Overflow'
Continuing to learn prolog, I'm trying to write a permutation(L1, L2) predicate. It should return true, only if L1 can be made up of all elements in L2. My code so far is the following: permutation([], []). permutation([H|T], L2) :- remove(L2, H, R), permutation(T, R). Assuming that the predicate… >>> More
Generating permutation in Python with specific rule

as seen on Stack Overflow - Search for 'Stack Overflow'
Let say a=[A, B, C, D], each element has a weight w, and is set to 1 if selected, 0 if otherwise. I'd like to generate permutation in the below order 1,1,1,1 1,1,1,0 1,1,0,1 1,1,0,0 1,0,1,1 1,0,1,0 1,0,0,1 1,0,0,0 Let's w=[1,2,3,4] for item A,B,C,D ... and max_weight = 4. For each permutation… >>> More
How can I use the Fisher-Yates shuffle while ensuring my permutation is even?

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm interested making an implementation of the 14-15 puzzle: I'm creating an array with the values 0 - 15 in increasing order: S = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } Now, what I want to do is shuffle them to create a new instance of the puzzle. However, I know that if I… >>> More

Developer IT

Counting the amount of letters in all permutations of words in R - Developer IT

Counting the amount of letters in all permutations of words in R

r

permutation

counting

Related posts about r

Related posts about permutation

Fast permutation -> number -> permutation mapping algorithms

Doing permutation of different arrays in perl

Prolog: permutations check and multiple answers

Generating permutation in Python with specific rule

How can I use the Fisher-Yates shuffle while ensuring my permutation is even?

Categories cloud