ACL-OCL / Base_JSON /prefixC /json /C88 /C88-1015.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "C88-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:15:49.922714Z"
},
"title": "TWO-COMPONF~ TEACHING SYSTEM THAT UNDERSTANDS ~ CORRECTS MISTAKES",
"authors": [
{
"first": "Elena",
"middle": [],
"last": "Borissova",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper presents a computer-tool teaching system supplied by a language processor. Its aim is to correct mistakes in texts written by foreign students learning Russian as a second language. Since a text",
"pdf_parse": {
"paper_id": "C88-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper presents a computer-tool teaching system supplied by a language processor. Its aim is to correct mistakes in texts written by foreign students learning Russian as a second language. Since a text",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The vocabulary containing now approximately 200 lexemes is enough for beginners",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "vord~.",
"sec_num": null
},
{
"text": "As a rule, computer-tool teaching programs ca~ do without language processors. \"I do not understand you, say it another w~\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I \u2022 Introduction",
"sec_num": null
},
{
"text": "The system can ask other questions as well.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I \u2022 Introduction",
"sec_num": null
},
{
"text": "In particular, if a pupil prints a personal name unknown to the system it asks:\"Is it a male or female?\" and then this name is inserted into the vocabulary with morphological characteristics fe~m. or mas__cc. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I \u2022 Introduction",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"uris": null,
"text": "may include grammar mistakes, the system cannot use morphological analysis to fool extent. So one must compile a programm capable of finding and correcting mistakes without traditional means of analysis. To solve this problem we prepone a system that includes a vocabalary and rules of finding and re-writing words. So the process consists of finding word stems and than correcting word endings . Semantic and syntactic information(\"a model of ruling\"/Mel'~uk 1974/~ necessary for that is written in the vocabulary of verbs as a frame. The slots of this frame contain semantic and morphological information about words that depend on this",
"num": null
},
"FIGREF1": {
"type_str": "figure",
"uris": null,
"text": "The3d step. Then the system accomplishes agreement of subject and predicate (e.g. Student sg,m~ sg.m rA student live~) according to the semantic information the verb is supplied with (e.g; JIT' 'person' STU-DENT 'person') and morphological information of the subject. The temporal and aspectual characteristics of verbs depend on adverbs (e.g. vchera CyesterdayOpast -jilAtlived~past) and some other facts. According to this information the system synthesises verbal forms and compares them with those written by the pupil. The 4th step. The agreement between adjectives and nouns is executed in the same way as the previously -by finding words accor~ ding to the semantic features (e;g; no~ Cnew~'thing','place'... dom~a hoase~,place ,) and then by changing of the forms according to the morphological information (e.g. dom m -novyi m) 3.Some notes on system exploating The result of this system's work should be a correct text with the correction of mistakes. A system based on the same principles but more complex should correct some syntactic mistakes in word order, usage if conjunctions etc. If the result of the correction allows two possible variants of a text, the computer prints:\"De you want to say\"...\" or \"...\"? (Possible variants -in inverted commas). If a sentence is not admissible by the given system, a computer prints:",
"num": null
}
}
}
}