Zobrazit minimální záznam
| dc.contributor.other |
Jongejan, Bart |
| dc.date.accessioned |
2014-07-30T21:17:28Z |
| dc.date.available |
2014-07-30T21:17:28Z |
| dc.date.issued |
2014-07-30 |
| dc.identifier.uri |
http://hdl.handle.net/11372/LRT-292 |
| dc.description |
1) Finds repeated sequences of words in documents (repetitiveness checker) 2) Finds common sequences of words in several documents (version comparison) A sequence of words consists of minimally two words. There is no upper limit of the number of words in a sequence, but sequences do not transgress sentence delimiters. There are several weight functions to choose from, each defining "good" sequences in a different way, based on word frequency, sequence lenght and number of repetitions. |
| dc.publisher |
Center for Sprogteknologi, University of Copenhagen |
| dc.source.uri |
http://cst.dk/tools/ |
| dc.title |
repetitiveness checker |
| dc.type |
toolService |
| has.files |
no |
| additional.metadata |
Nid:3696
Readily Available (field_resource_available):Yes |
| branding |
LRT + Open Submissions |
| dc.coverage.placeName |
Denmark |
| files.size |
0 |
| files.count |
0 |
Zobrazit minimální záznam
