i am parsing text from google queries online. When a character like ' or # etc. comes up i get the hex like \u0026#39;

Since I don't want to always search each string for all hex codes I would like to ask if somebody knows any way of cleaning up the text and replacing all those hex codes with their correlating character?

Thanks! 

i am using mimin to load a mp3 snippet (< 1sec) into processing to then play them in an regular rythm depending on some events.

I load the mp3 in the void setup() part and then play it each second within a if() within the void draw() part.

This works fine for a couple of seconds then the samples doesn't start from the beginning anymore or repeats unwanted.

this is the part within the void draw() (using cue to start from the beginning, then play, then delay for the length of the mp3 and then rewind). I already tried without cue & rewind but it doesn't change anything:

Thanks for any help or pointer towards help!

following this thread from the old forum

I started to play around with Voce 

and it seems to work even though not very accurate.

Now I would like to understand a bit more what's actually happening behind and how I can implement own grammar files (.gram) which tetermin what the application can understand etc.

Therefor I would like to start discussing here and would be very happy if people join in who already used / experimented with this lib.

My first concern would be how to design the grammar file (which software, which structure is best). I am adding here one file I have been using from the examples of Voce. It works quiet ok with "quit" and "reset" but it always also gets some "ghost input" which is a mix of other words. 

I just started using treemaps on basis of ben frys book Data Visualization. After putting together some test I was wondering how the order of the items loaded from a textfile come together, they seem sort of random (in the case I am using 10 items which are all valued the same) but still are always the same.

How could I create a left to right, top to bottom order of all items, e.g.?

Best,

Scrow