Discontinuous Combinatory Constituency Parsing
AbstractWe extend a pair of continuous combinator-based constituency parsers (one binary and one multi-branching) into a discontinuous pair. Our parsers iteratively compose constituent vectors from word embeddings without any grammar constraints. Their empirical complexities are subq...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
The MIT Press
2023-01-01
|
| Серія: | Transactions of the Association for Computational Linguistics |
| Онлайн доступ: | https://direct.mit.edu/tacl/article/doi/10.1162/tacl_a_00546/115348/Discontinuous-Combinatory-Constituency-Parsing |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|