Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "775f6e04-88b0-42d2-a406-4ea11cdb18d7"}, "_deposit": {"created_by": 45, "id": "6849", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "6849"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006849", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Anaphora resolution which most commonly appears as pronoun resolution is the problem of\nresolving references to earlier or later items in the discourse. Anaphora resolution is an active area of\nresearch, such as text mining, text summarization, dialogue interpretations, information extraction, and so on.\nAnaphora resolution in English and other European languages has been well done in early. But Myanmar\nLanguage has not sufficiently applied. This paper presents Myanmar anaphora resolution system by using\nrule-based part of speech tagging and machine learning approach. Rule-based manner with morphological\ninformat ion is used to collect anaphora and possible antecedents. K-Nearest Neighbor (k-NN) approach is used to select the most probable candidate as the antecedent of the anaphor."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "anaphora resolution"}, {"interim": "machine learning"}, {"interim": "k-nearest neighbour"}, {"interim": "morphological features"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-15"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm.pdf", "filesize": [{"value": "468 KB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 468000.0, "url": {"url": "https://meral.edu.mm/record/6849/files/Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm.pdf"}, "version_id": "01f61146-0cbb-4003-93e9-5f39e7346304"}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "ICFCC 2019", "subitem_c_date": "27 February - 1 March, 2019", "subitem_conference_title": "The 11th International Conference on Future Computer and Communication", "subitem_place": "Yangon, Myanmar"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Khin Theink Theink Soe"}, {"subitem_authors_fullname": "Tin Htar Nwe"}, {"subitem_authors_fullname": "Khin Thandar Nwet"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Conference paper"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2019-03-01"}, "item_title": "Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm", "item_type_id": "21", "owner": "45", "path": ["1596102355557"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000006849", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-15"}, "publish_date": "2020-12-15", "publish_status": "0", "recid": "6849", "relation": {}, "relation_version_is_last": true, "title": ["Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm"], "weko_shared_id": -1}
  1. University of Information Technology
  2. Faculty of Computer Science

Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm

http://hdl.handle.net/20.500.12678/0000006849
http://hdl.handle.net/20.500.12678/0000006849
bea705d8-d373-438f-bb9a-8f451002b9f5
775f6e04-88b0-42d2-a406-4ea11cdb18d7
None
Preview
Name / File License Actions
Anaphora Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm.pdf (468 KB)
Publication type
Conference paper
Upload type
Publication
Title
Title Anaphora Resolution for Myanmar Text Using K-Nearest Neighbor Algorithm
Language en
Publication date 2019-03-01
Authors
Khin Theink Theink Soe
Tin Htar Nwe
Khin Thandar Nwet
Description
Anaphora resolution which most commonly appears as pronoun resolution is the problem of
resolving references to earlier or later items in the discourse. Anaphora resolution is an active area of
research, such as text mining, text summarization, dialogue interpretations, information extraction, and so on.
Anaphora resolution in English and other European languages has been well done in early. But Myanmar
Language has not sufficiently applied. This paper presents Myanmar anaphora resolution system by using
rule-based part of speech tagging and machine learning approach. Rule-based manner with morphological
informat ion is used to collect anaphora and possible antecedents. K-Nearest Neighbor (k-NN) approach is used to select the most probable candidate as the antecedent of the anaphor.
Keywords
anaphora resolution, machine learning, k-nearest neighbour, morphological features
Conference papers
ICFCC 2019
27 February - 1 March, 2019
The 11th International Conference on Future Computer and Communication
Yangon, Myanmar
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-12-15 16:56:30.548366
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL