.png){kind=icon}
Return
Training tree transducers
.png){kind=icon}
OA
AI
DOI：10.1162/coli.2008.07-051-R2-03-57.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem for probabilistic tree-to-tree and tree-to-string transducers.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.3
Papers:
837
Citations:
2.7K
Organization
Cited Papers
ShareSaveShareSaveNanostructured hybrid NiFeOOH/CNT electrocatalysts for oxygen evolution reaction with low overpotential.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
View more