Sökning: "crossing arcs"
Hittade 1 uppsats innehållade orden crossing arcs.
1. Dynamic Programming Algorithms for Semantic Dependency Parsing
Master-uppsats, Linköpings universitet/Interaktiva och kognitiva systemSammanfattning : Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. LÄS MER
Resultatsidor:
1