Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/stanfordnlp/stanza.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJohn Bauer <horatio@gmail.com>2022-11-08 00:50:05 +0300
committerJohn Bauer <horatio@gmail.com>2022-11-08 00:50:05 +0300
commitc0d8fe9749c28e29ab341922b0920ff27f39e714 (patch)
treecae9c40e8e3d490904e4d1f89717e13e29a7752a
parent4a5969cdddc318f13f9d7071ec55f822b1663246 (diff)
Slightly update a score
-rw-r--r--stanza/models/constituency/parse_transitions.py5
1 files changed, 3 insertions, 2 deletions
diff --git a/stanza/models/constituency/parse_transitions.py b/stanza/models/constituency/parse_transitions.py
index d525f80b..e87fcaeb 100644
--- a/stanza/models/constituency/parse_transitions.py
+++ b/stanza/models/constituency/parse_transitions.py
@@ -23,9 +23,10 @@ class TransitionScheme(Enum):
TOP_DOWN = 1
# unary transitions are modeled as one entire transition
# version that uses one transform per item,
- # score on experiment described above: 0.8157
+ # score on experiment described above:
+ # 0.8157
# score using one combination step for an entire transition:
- # 0.8174
+ # 0.8178
TOP_DOWN_COMPOUND = 2
# unary is a separate transition. doesn't help
# score on experiment described above: