Giter Site home page Giter Site logo

idiap / finitestatetransducers.jl Goto Github PK

View Code? Open in Web Editor NEW
3.0 4.0 1.0 258 KB

Play with Weighted Finite State Transducers (WFST) in the Julia language.

License: Other

Julia 98.54% F* 0.69% Shell 0.77%
wfst finite-state-transducers speech-recognition hidden-markov-models

finitestatetransducers.jl's Introduction

FiniteStateTransducers.jl

codecov DOI

Play with Weighted Finite State Transducers (WFSTs) using the Julia language.

WFSTs provide a powerful framework that assigns a weight (e.g. probability) to conversions of symbol sequences. WFSTs are used in many applications such as speech recognition, natural language processing and machine learning.

This package takes a lot of inspiration from OpenFST.

FiniteStateTransducers is still in an early development stage, see the documentation for currently available features and the issues for the missing ones. An application of WFSTs can be found in the data preparation of the TIDIGITS recipe.

finitestatetransducers.jl's People

Contributors

davidavdav avatar nantonel avatar

Stargazers

 avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar

Forkers

davidavdav

finitestatetransducers.jl's Issues

TagBot trigger issue

This issue is used to trigger TagBot; feel free to unsubscribe.

If you haven't already, you should update your TagBot.yml to include issue comment triggers.
Please see this post on Discourse for instructions and more details.

If you'd like for me to do this for you, comment TagBot fix on this issue.
I'll open a PR within a few hours, please be patient!

Commulative vs commutative

Hello,

Thanks for this package, I use it for building a decoder for ASR.

In semirings.jl you define iscommulative, which apparently means that multiplication is commutative. I didn't know the word, searching for it doesn't give much information. It may be semiring jargon, but since a semiring's addition is commutative by definition, would it not be better to call the function iscommutative?

OpenFST feature parity

See OpenFST docs

  • Arcmap
  • ArcSort
  • Closure
  • Compose
  • Concat
  • Connect
  • Decode
  • Determinize
  • Difference
  • Disambiguate
  • Encode
  • EpsNormalize
  • Equivalent
  • Intersect
  • Invert
  • Isomorphic
  • Minimize
  • Project
  • Prune
  • Push
  • RandEquivalent
  • RandGen
  • Relabel
  • Replace
  • Reverse
  • Reweight
  • RmEpsilon
  • ShortestDistance
  • ShortestPath
  • StateMap
  • Synchronize
  • TopSort
  • Union
  • Verify
  • Lazy/Delayed implementations

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.