- Dec 31, 2016
- 316
- 708
This is the output from just the weight assignment, so there might be functions that drops "empty" array elements later. My guess is that it keeps everything for "completeness" so that you could technically just merge the [x][0] array elements back together if needed. I honestly haven't looked that the whole processing code for it, it's just a idea of possibility that popped in as "something it wouldn't surprise me if a coder had done".Would you know why it doesn't drop the blank tokens altogether, i.e. the spaces? I am surprised those are even added to the list. Also, if you have the code still up, can you please let us know how this gets converted: (((test:1.3))).
Also, there's such as thing as token padding where i believe both pos and neg token gets padded to equal length, i don't know why this gets done nor what it affects. Not that unlikely the padding is just spaces so depending on where in the parsing that happens so not stripping spaces could be to maintain something related to that. Again, just a random thought.
As for your test, it comes to 1.573. every additional () after the first adds a multiplier of 1.1 to the specified weight, so since there's 2 additional () you get
1.3 * 1.1 * 1.1
. Due to computer math here's a whole bunch of 0s and a number at the end but that's not really that important in this case.