An Automata Based Text Analysis System
2009
- 527Usage
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage527
- Downloads458
- Abstract Views69
Thesis / Dissertation Description
This report describes and implements an automata based text analysis system. We have collected some of the writing samples. Each sample establishes a tree, and uses the ALERGIA algorithm to merge all compatible nodes in order to get a merged stochastic finite automaton. We store these automatons which demonstrate writing style of the sample texts in the hard drive. For a new testing piece, we can test if it has similar writing style compared to those sample texts.
Bibliographic Details
https://scholarworks.sjsu.edu/etd_projects/70; https://scholarworks.sjsu.edu/cgi/viewcontent.cgi?article=1069&context=etd_projects&unstamped=1; http://dx.doi.org/10.31979/etd.4c3t-d352; https://scholarworks.sjsu.edu/cgi/viewcontent.cgi?article=1069&context=etd_projects; https://dx.doi.org/10.31979/etd.4c3t-d352; https://scholarworks.sjsu.edu/etd_projects/70/
San Jose State University Library
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know