<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="lager-1999-tbl">
    <titleInfo>
        <title>The \ensuremathμ-TBL System: Logic Programming Tools for Transformation-Based Learning</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Torbjörn</namePart>
        <namePart type="family">Lager</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1999</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>EACL 1999: CoNLL-99 Computational Natural Language Learning</title>
        </titleInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The \ensuremathμ-TBL system represents an attempt to use the search and database capabilities of the Prolog programming language to implement a generalized form of transformation-based learning. In the true spirit of logic-programming, the implementation is ‘derived’ from a declarative, logical interpretation of transformation rules. The \ensuremathμ-TBL system recognizes four kinds of rules, that can be used to implement various kinds of disambiguators, including Constraint Grammar disambiguators as well as more traditional ‘Brill-taggers’. Results from a number of experiments and benchmarks are presented which show that the system is both flexible and efficient.</abstract>
    <identifier type="citekey">lager-1999-tbl</identifier>
    <location>
        <url>https://aclanthology.org/W99-0705/</url>
    </location>
    <part>
        <date>1999</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T The \ensuremathμ-TBL System: Logic Programming Tools for Transformation-Based Learning
%A Lager, Torbjörn
%S EACL 1999: CoNLL-99 Computational Natural Language Learning
%D 1999
%F lager-1999-tbl
%X The \ensuremathμ-TBL system represents an attempt to use the search and database capabilities of the Prolog programming language to implement a generalized form of transformation-based learning. In the true spirit of logic-programming, the implementation is ‘derived’ from a declarative, logical interpretation of transformation rules. The \ensuremathμ-TBL system recognizes four kinds of rules, that can be used to implement various kinds of disambiguators, including Constraint Grammar disambiguators as well as more traditional ‘Brill-taggers’. Results from a number of experiments and benchmarks are presented which show that the system is both flexible and efficient.
%U https://aclanthology.org/W99-0705/

Markdown (Informal)

[The μ-TBL System: Logic Programming Tools for Transformation-Based Learning](https://aclanthology.org/W99-0705/) (Lager, CoNLL 1999)

• The μ-TBL System: Logic Programming Tools for Transformation-Based Learning (Lager, CoNLL 1999)

ACL

• Torbjörn Lager. 1999. The μ-TBL System: Logic Programming Tools for Transformation-Based Learning. In EACL 1999: CoNLL-99 Computational Natural Language Learning.