Git Product home page Git Product logo

mmi-tagger's Introduction

Maximal Mutual Information (MMI) Tagger

This is a minimalist PyTorch implementation of the label inducer in [1]. For the full codebase used in experiments, refer to the repository at [2].

Requirement

The code is in Python 3.6 and uses PyTorch version 1.0.1.post2. Tested with Geforce RTX 2080 Ti and CUDA version 10.1.105.

Data

You can get the universal treebank v2.0 at [3] (McDonald et al., 2013), which provides both fine-grained and coarse-grained labels.

Running the code

python main.py example-model example.words --train --epochs 10 --num_labels 3
python main.py en45-model ${EN45PATH}/en.words --train --num_labels 45 --epochs 5 --cuda --clusters clusters.txt --pred pred.txt

Output logged in file en45-model.log

| epoch   1 | loss  -1.08 |   1.55 bits | acc  77.95 | vm  72.51 | time 0:02:38
| epoch   2 | loss  -1.55 |   2.23 bits | acc  79.17 | vm  73.25 | time 0:02:41
| epoch   3 | loss  -1.73 |   2.50 bits | acc  79.47 | vm  73.45 | time 0:02:42
| epoch   4 | loss  -1.86 |   2.69 bits | acc  79.37 | vm  73.44 | time 0:02:38
| epoch   5 | loss  -1.96 |   2.83 bits | acc  79.28 | vm  73.35 | time 0:02:41

Training time 0:13:23
=========================================================================================
| Best | acc 79.47 | vm 73.45
=========================================================================================

References

[1] Mutual Information Maximization for Simple and Accurate Part-Of-Speech Induction (Stratos, 2018)

[2] https://github.com/karlstratos/iaan

[3] https://github.com/ryanmcd/uni-dep-tb

mmi-tagger's People

Contributors

karlstratos avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

mmi-tagger's Issues

A question about the maximal matching

Hi~ Thanks for sharing the source code.

I noticed that you obtain the maximal matching by simply taking the tag with the maximal cooccurrence of each token.

mmi-tagger/evaluate.py

Lines 61 to 66 in 40e2299

def get_majority_mapping(tseqs, zseqs):
cooccur = count_cooccurence(tseqs, zseqs)
mapping = {}
for z in cooccur:
mapping[z] = max(cooccur[z].items(), key=lambda x: x[1])[0]
return mapping

But, since the motivation of this paper is to maximize mutual information, would it perform better if you search for the matching which maximizes the mutual information? i.e., $\arg\max_{(T,Z)}{\operatorname{MI}{(T,Z)}}$.

Maybe minimum cost max flow algorithm can be applied to search for it, I'm not sure.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.