Efficient Outside Computation
Author(s) -
Daniel Gildea
Publication year - 2020
Publication title -
computational linguistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.314
H-Index - 98
eISSN - 1530-9312
pISSN - 0891-2017
DOI - 10.1162/coli_a_00386
Subject(s) - computation , parsing , semiring , variety (cybernetics) , computer science , function (biology) , value (mathematics) , algorithm , composition (language) , theoretical computer science , mathematics , algebra over a field , mathematical optimization , artificial intelligence , discrete mathematics , pure mathematics , machine learning , linguistics , philosophy , evolutionary biology , biology
Weighted deduction systems provide a framework for describing parsing algorithms that can be used with a variety of operations for combining the values of partial derivations. For some operations, inside values can be computed efficiently, but outside values cannot. We view outside values as functions from inside values to the total value of all derivations, and we analyze outside computation in terms of function composition. This viewpoint helps explain why efficient outside computation is possible in many settings, despite the lack of a general outside algorithm for semiring operations.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom