A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Dependency Analysis via Contractions and Weighted FSTs
[chapter]
2012
Shall We Play the Festschrift Game?
Arc contractions in syntactic dependency graphs can be used to decide which graphs are trees. The paper observes that these contractions can be expressed with weighted finite-state transducers (weighted FST) that operate on stringencoded trees. The observation gives rise to a finite-state parsing algorithm that computes the parse forest and extracts the best parses from it. The algorithm is customizable to functional and bilexical dependency parsing, and it can be extended to non-projective
doi:10.1007/978-3-642-30773-7_10
dblp:conf/birthday/Yli-Jyra12
fatcat:kkrof4kqsvaevhfj26qgr5pxti