You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently no, the parser has no idea how to handle such a weird sentence
and there's no way to give it constraints such as only one nsubj. Clearly
it is interpreting the appositive phrase as the root phrase of the
sentence. If you create a few sentences of similar nature, we can throw
them in the training data and see if it improves these structures without
hurting the rest of the performance
https://github.com/stanfordnlp/handparsed-treebank
A very weird English tree produced by Stanza 1.6.0 in the demo:
In UD, no word is allowed to have multiple (plain)
nsubj
dependents. But "admired" has two.Is there a recommended alternate training or decoding method in Stanza that could avoid this sort of problem?
The text was updated successfully, but these errors were encountered: