Anonymous user
Talk:Textonyms: Difference between revisions
→Correct number of Textonyms in unixdict.txt?
Line 62:
::: Another possibility is that the task specification is ambiguous. The question is: what is being counted? In the J and Go examples what we have done is count the number of unique digit combinations which correspond to more than one word. In the python example I imagine what is being counted is the number of non-unique digit combinations which correspond to more than one word. (For example, 2633 corresponds to three different words, so is counted as three textonyms in the python example and as one textonym in the J and Go examples.) The task specification is currently silent on this issue. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:07, 9 February 2015 (UTC)
:::: Good point, I don't think I can mark it "inconsistent" instead of "incorrect" tho :). I think the task is fairly clear "#{3} is the number of #{2} which represent more than one word." Only 1473 of the 22903 numbers "represent more than one word". The task should probably have included a short example that made the "correct" output more obvious. From what little I can guess from the python code, I thought/assumed that "<tt>sum(1 for w in num2words if len(w) > 1)</tt>" was counting the entries where <tt>len(w) > 1</tt>; if it's instead summing the lengths I think must be a mistake/typo given the variable name itself is <tt>morethan1word</tt> (rather than something like <tt>pairsOfTextonyms</tt>). —[[User:dchapes|dchapes]] ([[User talk:dchapes|talk]] | [[Special:Contributions/dchapes|contribs]]) 01:22, 9 February 2015 (UTC)
| |||