Message board for the users of flat assembler.
> Projects and Ideas > Text statistical analysis [DONE]
This program takes textual input and makes statistical analyses on the text. It will count all the one-, two-, ..., N-letter combinations and arrange them lexically.
You can write your input text in the textbox or into a file Alt+I or "Intput" checkbox toggles that. Filenames can be relative or absolute
You can see the output in the other textbox or put it into a file with Alt+O toggling the choice.
There are three other checkboxes that change the behaviour of the program: they are Alt+A, +C and +F respective to custom "A"lfabet (I don't know why alfa sound more natural ), "C"ase sensitiveness and scanning from word beginnings or "F"rom every position of the word.
Alt+S will start the program (usually the performance is about 1MB/s). Alt+E will exit. Processing time shows the time it took in milliseconds.
Don't know if it has a better name in English, but that's what it was called in school: "Täheühendite leidmine" (compund letter search? maybe )
Implementation in ASM
(64 is only *slightly* better ~2-3%)
4MB sample file made out of fragments of "Alice" from Gutenberg project.
My updated idol http://www.agner.org/optimize/
Last edited by Madis731 on 28 May 2007, 13:43; edited 2 times in total
|27 May 2007, 22:41||
Interesting subject. Statistical analysis of text is adapted in cryptology (some old ciphers may be broken that way).
|28 May 2007, 11:04||
< Last Thread | Next Thread >
Copyright © 1999-2020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.