Constraint Satisfaction Inference

Non-probabilistic Global Inference for Sequence Labelling

S.V.M. Canisius, A. van den Bosch, W. Daelemans

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    32 Downloads (Pure)

    Abstract

    We present a new method for performing sequence labelling based on the idea of using a machine-learning classifier to generate several possible output sequences, and then applying an inference procedure to select the best sequence among those. Most sequence labelling methods following a similar approach require the base classifier to make probabilistic predictions. In contrast, our method can be used with virtually any type of classifier. This is illustrated by implementing a sequence classifier on top of a (nonprobabilistic) memory-based learner. In a series of experiments, this method is shown to outperform two other methods; one naive baseline approach, and another more sophisticated method.
    Original languageEnglish
    Title of host publicationProceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications
    EditorsR. Basili, A. Moschitti
    Place of PublicationTrento, Italy
    PublisherACL
    Pages9-16
    Number of pages8
    Publication statusPublished - 2006

    Fingerprint

    Labeling
    Classifiers
    Learning systems
    Data storage equipment
    Experiments

    Cite this

    Canisius, S. V. M., van den Bosch, A., & Daelemans, W. (2006). Constraint Satisfaction Inference: Non-probabilistic Global Inference for Sequence Labelling. In R. Basili, & A. Moschitti (Eds.), Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications (pp. 9-16). Trento, Italy: ACL.
    Canisius, S.V.M. ; van den Bosch, A. ; Daelemans, W. / Constraint Satisfaction Inference : Non-probabilistic Global Inference for Sequence Labelling. Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications. editor / R. Basili ; A. Moschitti. Trento, Italy : ACL, 2006. pp. 9-16
    @inproceedings{aefe4f6fdb5a4415903b2f123ba7007c,
    title = "Constraint Satisfaction Inference: Non-probabilistic Global Inference for Sequence Labelling",
    abstract = "We present a new method for performing sequence labelling based on the idea of using a machine-learning classifier to generate several possible output sequences, and then applying an inference procedure to select the best sequence among those. Most sequence labelling methods following a similar approach require the base classifier to make probabilistic predictions. In contrast, our method can be used with virtually any type of classifier. This is illustrated by implementing a sequence classifier on top of a (nonprobabilistic) memory-based learner. In a series of experiments, this method is shown to outperform two other methods; one naive baseline approach, and another more sophisticated method.",
    author = "S.V.M. Canisius and {van den Bosch}, A. and W. Daelemans",
    note = "Pagination: 8",
    year = "2006",
    language = "English",
    pages = "9--16",
    editor = "R. Basili and A. Moschitti",
    booktitle = "Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications",
    publisher = "ACL",

    }

    Canisius, SVM, van den Bosch, A & Daelemans, W 2006, Constraint Satisfaction Inference: Non-probabilistic Global Inference for Sequence Labelling. in R Basili & A Moschitti (eds), Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications. ACL, Trento, Italy, pp. 9-16.

    Constraint Satisfaction Inference : Non-probabilistic Global Inference for Sequence Labelling. / Canisius, S.V.M.; van den Bosch, A.; Daelemans, W.

    Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications. ed. / R. Basili; A. Moschitti. Trento, Italy : ACL, 2006. p. 9-16.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    TY - GEN

    T1 - Constraint Satisfaction Inference

    T2 - Non-probabilistic Global Inference for Sequence Labelling

    AU - Canisius, S.V.M.

    AU - van den Bosch, A.

    AU - Daelemans, W.

    N1 - Pagination: 8

    PY - 2006

    Y1 - 2006

    N2 - We present a new method for performing sequence labelling based on the idea of using a machine-learning classifier to generate several possible output sequences, and then applying an inference procedure to select the best sequence among those. Most sequence labelling methods following a similar approach require the base classifier to make probabilistic predictions. In contrast, our method can be used with virtually any type of classifier. This is illustrated by implementing a sequence classifier on top of a (nonprobabilistic) memory-based learner. In a series of experiments, this method is shown to outperform two other methods; one naive baseline approach, and another more sophisticated method.

    AB - We present a new method for performing sequence labelling based on the idea of using a machine-learning classifier to generate several possible output sequences, and then applying an inference procedure to select the best sequence among those. Most sequence labelling methods following a similar approach require the base classifier to make probabilistic predictions. In contrast, our method can be used with virtually any type of classifier. This is illustrated by implementing a sequence classifier on top of a (nonprobabilistic) memory-based learner. In a series of experiments, this method is shown to outperform two other methods; one naive baseline approach, and another more sophisticated method.

    M3 - Conference contribution

    SP - 9

    EP - 16

    BT - Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications

    A2 - Basili, R.

    A2 - Moschitti, A.

    PB - ACL

    CY - Trento, Italy

    ER -

    Canisius SVM, van den Bosch A, Daelemans W. Constraint Satisfaction Inference: Non-probabilistic Global Inference for Sequence Labelling. In Basili R, Moschitti A, editors, Proceedings of the EACL 2006 Workshop on Learning Structured Information in Natural Language Applications. Trento, Italy: ACL. 2006. p. 9-16