How to embed noncrossing trees in Universal Dependencies treebanks in a low-complexity regular language
A recently proposed balanced-bracket encoding (Yli-Jyrä and GómezRodríguez 2017) has given us a way to embed all noncrossing dependency graphs into the string space and to formulate their exact arcfactored inference problem (Kuhlmann and Johnsson 2015) as the best string problem in a dynamically con...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2019-09-01
|
| Series: | Journal of Language Modelling |
| Subjects: | |
| Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/213 |