https://github.com/dcavar/fomatestcpp
Foma-based morphological analysis using a simple C++ wrapper
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.8%) to scientific vocabulary
Keywords
Repository
Foma-based morphological analysis using a simple C++ wrapper
Basic Info
- Host: GitHub
- Owner: dcavar
- License: apache-2.0
- Language: C++
- Default Branch: master
- Homepage: http://damir.cavar.me/
- Size: 98.6 KB
Statistics
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
Foma example codes
Copyright 2015-2018 by Damir Cavar
Last edited: 2018-08-06, Damir Cavar
Includes and Libraries
You will need Foma and all its include and library files on your system to be able to compile this test code.
Included is a simplified and reduced English morphology compiled into a Finite State Transducer for the use with Foma.
Build the binary
To compile this example, you need to have the entire Foma collection of binaries, includes and libraries set up on your system. You will also need some C++11 compiler and various other libraries for it, for example the Boost libraries.
The project is a CMake project. Make sure that you have also CMake installed and set up on your system.
To create the running binary for the code in FomaMWT, in the folder run:
cmake CMakeList.txt
This will generate the Makefile and other files in the same folder. Run:
make
and it should compile correctly, if all the paths and folders are OK, and if the libraries were found.
If you want to test the speed of the processor, run the following command:
time ./fomatest test.txt > res.txt
Create a larger list of words in a text file and run it through the test tool. On an Intel i7 CPU with Fedora Linux I achieve something in the range of 300,000 tokens per second, with average number of ambiguous morphological analyses for each string.
Owner
- Name: Damir Cavar
- Login: dcavar
- Kind: user
- Location: Bloomington, IN
- Company: Indiana University
- Website: http://damir.cavar.me/
- Repositories: 29
- Profile: https://github.com/dcavar
GitHub Events
Total
Last Year
Committers
Last synced: 8 months ago
Top Committers
| Name | Commits | |
|---|---|---|
| Damir Cavar | d****r@g****m | 2 |
| Damir Cavar | d****r@m****m | 1 |
Committer Domains (Top 20 + Academic)
Issues and Pull Requests
Last synced: 8 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