Cryptography substitution frequency analysis I am trying to find the plain text for the following cipher text using a frequency analysis

vr pvst yqlp mq nvf


But for the letters above this is really difficult, as if I use the alphabetic substitution technique, where I assume that v corresponds to e as this occurs most in the english alphabet. What about p, this also occurs three times, does this mean it corresponds to e. Same for r,s,t,y,l,m,n,j,f which occur only once. Is there an algorithm which looks at such duplicated frequencies, or do I guess:

v and p corresponds to e
q corresponds to t 
r to f correspond to a

?

even using the bigram method for something like this is difficult as a bigram of pv is found, 
if p = t
and v = h
that means p doesn't correspond to t anymore? 

Thanks in advance!
I'm by no means an expert but it seems to me that your sample is far too short to be amenable to frequency analysis or, indeed, to cryptanalysis of any kind. Assuming a substitution cypher, you have only the information that eleven letters are used, and characters 1, 4 and 14; 3 and 10; and 8 and 11 are the same. There are fifteen unused characters so there's a huge amount of freedom. You only have a little more information than a one-time pad would give you.

In a long sample of text, it is likely but is not guaranteed that the most frequent character is 'e'; in a fifteen character sample, it's perfectly possible that there are no e's at all. ("Look at my odd words" is a sixteen-letter example.) Frequency analysis helps you figure out the substitutions but it doesn't guarantee to give you the answer with no more work.

Assuming the spaces are significant, your message could be "My emus love no imp". Or it could be something completely different.