Beta
Word Correlations in Text Data
Loading description...
SQL
Databases
View
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
muchachos consejos para aprender y memorizar metodos de javascript para poder mejorar la logica
Can a single word match more than one pattern?
For example, "The quicklazyexample fox jumps over the dog." if "quicklazyexample" happens to be a valid word.
If so, does it count as the relevant pattern pairs occurring in a sentence?
Is there an implied ordering within the pair (pattern1, pattern2)?
i.e. why does the example consider (lazy, quick) as a pair but not (quick, lazy)?
The description does not rule out pairs of patterns of the same pattern (
(a, a)
).It doesn't mention which pair should be selected either: when pairs
(a, b)
or(b, a)
exist, which one should be kept in the results? Note that tiebreaking withpattern_text
instead ofpattern_id
is inappropriate, as there are no guaranteedpattern_text
is unique.The filter criteria is missing too: why is pair
(lazy, example)
non-existent in the given example? (The kata probably requiresboth_count
greater than 0, which should be specified. Or did you use ajoin
whenleft join
would be more appropriate?)This sentence is outright wrong: the kata never requires us to count the number of occurrences of each pattern. We only need to count the number of sentences which a pattern occur.
All above issues are valid and I would like to add that regardsless whether we need to count occurences of patterns or number of sentences with occurences of patterns, there should be fixed and random tests with multiple matches of patterns within a single sentence.
Sample tests already have them, which is why I discovered this.
The performance constraints seem a bit unbalanced to me. I would either add less data or more (+ performance tag).
this solution solves in 4 seconds, while this solution barely makes it.
This comment has been hidden.
Somewhere in the description we read ..
And later we read ..
It's a bit of a contradiction. Specially when a pattern occurs more than once in some sentences.