https://github.com/dcavar/juliafoma

Julia NLP with Foma: Finite State Transducer for Morphological Analysis

https://github.com/dcavar/juliafoma

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
  • DOI references
  • Academic publication links
  • Committers with academic emails
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (8.3%) to scientific vocabulary

Keywords

finite-state-transducer foma julia morphology nlp
Last synced: 4 months ago · JSON representation

Repository

Julia NLP with Foma: Finite State Transducer for Morphological Analysis

Basic Info
  • Host: GitHub
  • Owner: dcavar
  • License: mit
  • Language: Julia
  • Default Branch: master
  • Homepage: http://damir.cavar.me/
  • Size: 93.8 KB
Statistics
  • Stars: 3
  • Watchers: 3
  • Forks: 1
  • Open Issues: 0
  • Releases: 0
Topics
finite-state-transducer foma julia morphology nlp
Created over 7 years ago · Last pushed over 7 years ago
Metadata Files
Readme License

README.md

Julia Foma Interface

(C) 2018 by Damir Cavar

Version: 0.1

This is part of my Julia code and libs for Natural Language Processing (NLP). I am using Julia 1.0 or newer.

This is the beginning of an interface to the Foma library in Julia.

The code here is accompanied by an example morphology in form of a Foma Finite State Transducer.

english.fst

There are a few morphemes and words in this morphology, just for testing purposes.

Make sure that Foma is installed on your machine, and in particular the dynamic libraries. These libraries need to be in your system's library path such that Julia can find them.

This is an extremely fast morphological analyzer. This combination of Julia and Foma FST-based morphological analysis can process more than 300,000 tokens per second on modern Intel i7 CPUs on a single thread.

I will extend the library and functions soon.

Example

For any token that you process using the FST, the output will be of the form:

call+N+Pl
call+V+3P+Sg

This is the output for the input token "calls". The two lines mean that:

  • there are two analyses for calls
  • the lemma for calls is in both cases call
  • the main part of speech is N (noun) and V (verb)
  • the noun calls has a morphosyntactic feature +Pl (+plural)
  • the verb calls has two morphosyntactic features, that is +3P (third person) and Sg (singular)

Test some more examples using the compiled mini-morphology for English in english.fst.

Owner

  • Name: Damir Cavar
  • Login: dcavar
  • Kind: user
  • Location: Bloomington, IN
  • Company: Indiana University

GitHub Events

Total
Last Year

Committers

Last synced: 9 months ago

All Time
  • Total Commits: 4
  • Total Committers: 2
  • Avg Commits per committer: 2.0
  • Development Distribution Score (DDS): 0.25
Past Year
  • Commits: 0
  • Committers: 0
  • Avg Commits per committer: 0.0
  • Development Distribution Score (DDS): 0.0
Top Committers
Name Email Commits
Damir Cavar d****r@g****m 3
Damir Cavar d****r@m****m 1
Committer Domains (Top 20 + Academic)
me.com: 1

Issues and Pull Requests

Last synced: 9 months ago

All Time
  • Total issues: 0
  • Total pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Total issue authors: 0
  • Total pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Top Authors
Issue Authors
Pull Request Authors
Top Labels
Issue Labels
Pull Request Labels