• <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"></dl>
  • <li id="w8qua"></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"><menu id="w8qua"><small id="w8qua"></small></menu></dl>
  • <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
  • <li id="w8qua"></li>
  • <dl id="w8qua"><ins id="w8qua"></ins></dl>
  • <sup id="w8qua"></sup>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <sup id="w8qua"><menu id="w8qua"></menu></sup><sup id="w8qua"></sup>
    <li id="w8qua"><s id="w8qua"></s></li>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <li id="w8qua"><s id="w8qua"><thead id="w8qua"></thead></s></li>
  • <div id="w8qua"></div>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <div id="w8qua"></div>
    <div id="w8qua"></div>
    <dl id="w8qua"></dl>
  • <sup id="w8qua"><menu id="w8qua"></menu></sup>
    <li id="w8qua"></li>
  • <div id="w8qua"></div>
  • <li id="w8qua"><s id="w8qua"></s></li>
    <sup id="w8qua"><bdo id="w8qua"></bdo></sup>
    <dl id="w8qua"><s id="w8qua"></s></dl>
  • <dl id="w8qua"></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <acronym id="w8qua"><small id="w8qua"></small></acronym>
    <rt id="w8qua"></rt>

    The 8th CCF International Conference on Natural Language Processing and Chinese Computing (NLPCC 2019)

    閱讀量:228
    2019-05-15

    Submission Deadlines:

    ·     Chinese Track: Extended to Wednesday, May 22, 2019

    ·     Main Track: Extended to Wednesday, May 22, 2019

    October 9-14, 2019, Dunhuang, Gansu Province, China 

    http://tcci.ccf.org.cn/conference/2019/

    The CCF International Conference on Natural Language Processing and Chinese Computing (NLPCC) is the annual meeting of the CCF TCCI (Technical Committee of Chinese Information, China Computer Federation). As a leading international conference specialized in the fields of Natural Language Processing and Chinese Computing, NLPCC is recognized by CCF as a category C conference recently. It serves as a main forum for researchers and practitioners from academia, industry, and government to share their ideas, research results and experiences, and to promote their research and technical innovations in the fields. Previous NLPCC conferences were successfully held in Beijing (2012), Chongqing (2013), Shenzhen (2014), Nanchang (2015), Kunming (2016), Dalian (2017), and Hohhot (2018).

    Today, NLP and CC technologies are among the most active research and development areas due to rapid advancement of the Internet as well as the worldwide proliferation of mobile devices and social media. The fields are facing many new challenges arising from intelligent applications and big data, such as business intelligence, social analytics, etc. The Eighth Conference of NLPCC will focus on Natural Language Analysis and Understanding in Big Data and Artificial Intelligence including Fundamental Research in Language Computing, Multilingual Access, Web Mining/Text Mining, Machine Learning for NLP, Knowledge Graph, Information Extraction, Question Answering, Information Retrieval, Chatbot, as well as the Applications of Language Computing.

    NLPCC 2019 welcomes original technical papers on new concepts, innovative research, systems, standards, testing & evaluation, applications, and industrial case studies related to NLP & CC. Authors are invited to submit complete and unpublished papers in English or in Chinese in the following categories:

    ●     Applications/tools

    ●     Empirical/data-driven approaches

    ●     Resources and evaluation

    ●     Theoretical

    ●     Survey papers

    Papers currently under review in other conferences or journals are acceptable; however, commitment to the conference must be made upon acceptance.

    Relevant topics of NLPCC 2019 include, but are not limited to, the following:

    ●     Fundamentals of Language Computing

    ●     Word Segmentation & Named Entity Recognition

    ●     Syntactic Parsing, Semantic Analysis, Discourse Analysis

    ●     NLP for Minority and Low-resource Languages

    ●     Applications of Natural Language Processing

    ●     Digital Publishing, Document Engineering, OCR & Fonts Computing

    ●     NLP for Mobile Computing

    ●     Machine Translation & Multilingual Information Access

    ●     Machine Learning for NLP

    ●     Web/Text Mining & Big Data

    ●     Information Retrieval & Extraction

    ●     Knowledge Representation & Acquisition

    ●     Personalization & Recommendation

    ●     Semantic Web & Knowledge Base

    ●     NLP for Search & Advertisements

    ●     Query & Document Understanding

    ●     Topic Detection & Tracking

    ●     Social Computing, Sentiment analysis

    ●     Opinion Mining & Rumour Detection

    ●     Question Answering, Chatbot & User Interaction

    ●     Ethics and Privacy

    Submission Guidelines

    The proceedings of the conference will be published as a volume in the Springer LNAI series (EI & ISTP indexed, for English papers), and the ACTA Scientiarum Naturalium Universitatis Pekinensis (EI & Scopus indexed, for Chinese papers), respectively. English submissions should follow the LNCS formatting instructions, without exceeding twelve (12) pages, inclusive of references and possible appendices. The submissions must therefore be formatted in accordance with the standard Springer style sheets ([LaTeX][Microsoft Word]). Submissions in Chinese should follow the formatting instructions of the ACTA Scientiarum Naturalium Universitatis Pekinensis [Format Template], without exceeding eight (8) pages in A4 (210 × 297 mm) size.

    Manuscripts should be submitted electronically through the submission website. Email submissions will not be accepted. English papers should be submitted to the Main Track (https://www.softconf.com/NLPCC2019/Main-English), and Chinese papers should be submitted to the Chinese Track (https://www.softconf.com/NLPCC2019/Main-Chinese). Authors of Chinese submissions are required to provide Chinese titles in the submission system. All student first authors are encouraged to contact <[email protected]>, indicating their names, affiliations, and the titles of their submissions, in order to be eligible for nomination for best student paper award.

    All submissions should be in PDF format.

    Double-Blind Reviewing

    Anonymity Requirements for Double-Blind Reviewing: Every research paper submitted to NLPCC 2019 will undergo a "double-blind" reviewing process: the PC members and referees who review the paper will not know the identity of the authors. To ensure anonymity of authorship, authors must prepare their manuscript as follows:

    1. Authors' names and affiliations must not appear on the title page or elsewhere in the paper.

    2. Funding sources must not be acknowledged on the title page or elsewhere in the paper.

    3. Research group members, or other colleagues or collaborators, must not be acknowledged anywhere in the paper.

    4. The paper's file name must not identify the authors of the paper. It is strongly suggested that the submitted file be named with the assigned submission number.

    5. You must also use care when referring to related previous work, particularly your own work, in the paper. For example, if you are Jane Smith, the following text gives away the authorship of the submitted paper:

      1. In our previous work [1,2], we presented two algorithms for ... In this paper, we build on that work by ... Bibliography

      2. [1] Jane Smith, "A Simple Algorithm for ...," Proceedings of ACL 2007, pp. 1-8.

      3. [2] Jane Smith, "A More Complicated Algorithm for ...," Proceedings of ACL 2008, pp.33-40.

              The solution is to reference your past work in the third person (just as you would any other                piece of work that is related to the submitted paper). This allows you to set the context for the            submitted paper, while at the same time preserving anonymity:

      1. In previous work [1,2], algorithms were presented for ... In this paper, we build on that work by ... Bibliography

      2. [1] Jane Smith, "A Simple Algorithm for ...," Proceedings of ACL 2007, pp. 1-8.

      3. [2] Jane Smith, "A More Complicated Algorithm for ...," Proceedings of ACL 2008, pp.33-40.

    It is the responsibility of authors to do their very best to preserve anonymity. Papers that do not follow the guidelines here, or otherwise potentially reveal the identity of the authors, are subject to rejection without review. Submission details are provided on the conference website: http://tcci.ccf.org.cn/conference/2019.

    For more information about paper submission, contact program co-chair ([email protected]).

    Events

    In addition to technical contributions, NLPCC 2019 invites proposals for workshops, panels, technical evaluations and industry presentations. For workshops, NLPCC 2019 will provide administrative support for workshop room booking, registration and publication. All papers accepted by NLPCC 2019 workshops will be published in a combined volume of the NLPCC 2019 Proceedings. Proposals or industry papers should be sent as e-mail attachments to the general secretary of NLPCC, Dongyan Zhao <[email protected]> before June 1st, 2019.

    Important dates

    Paper Submission Deadlines:

    ●     Extended to May 22, 2019 (23:59, Beijing Time)

    Main Track: https://www.softconf.com/NLPCC2019/Main-English/

    Chinese Track: https://www.softconf.com/NLPCC2019/Main-Chinese/

    ●     Notification: July 30th, 2019

    ●     Camera ready: August 10th, 2019

    All deadlines are 23:59 PM, Beijing.

    Awards and Grants

    Best Paper Awards and Best Student Awards

    Award committee will be appointed by the Program Committee Co-Chairs to select best papers in a separate round of review. The best paper awards and best student awards are sponsored by Microsoft Research.

    Travel Grants

    Grants are available for students with first-author accepted long papers. Preference will be given to applicants being employed or studying in the western or middle regions of China and overseas students. In addition, first authors of published papers in (or accepted by) leading international conferences or journals within the last 12 months of the conference date (October 9, 2019) can apply for free registration for NLPCC 2019.

    Expo and Industrial Demo Grants

    All participants who will attend the Industrial Expo of NLPCC 2019 can apply for the Expo Grants. The grants will provide free booth and exhibition registration to selected participants who demonstrates outstanding novel technology or product. Contact: <[email protected]>.

    Organization

    Organizer:

    China Compute Federation (CCF)

    Hosts:

    Northwest Minzu University

    Dunhuang Academy

    National State Key Laboratory of Digital Publishing, Founder Group

    Publishers:

    Lecture Notes on Artificial Intelligence (LNAI), Springer Verlag

    ACTA Scientiarum Naturalium Universitatis Pekinensis

    Organizing Committee:

    General Co-Chairs:  

    Ken CHURCH, Baidu Inc

    Qun LIU, Huawei Noah's Ark Lab

    PC Co-Chairs:

    Min-Yen KAN, National University of Singapore

    Jie TANG, Tsinghua University

    Student Workshop Co-Chairs:

    Yue ZHANG, Westlake University

    Jiajun ZHANG, Institute of Automation, Chinese Academy of Sciences

    Evaluation Co-Chairs:

    Weiwei SUN, Peking University

    Nan DUAN, Microsoft Research

    ADL/Tutorial Co-Chairs:

    Xiaojun WAN, Peking University

    Qi ZHANG, Fudan University

    Hua WU, Baidu Inc

    Publication Co-Chairs:

    Sujian LI, Peking University

    Hongying ZAN, Zhengzhou University

    Sponsorship Co-Chairs:

    Ming ZHOU, Microsoft Research

    Tiejun ZHAO, Harbin Institute of Technology

    Publicity Co-Chairs:

    Ruifeng XU, Harbin Institute of Technology (Shenzhen)

    Wanxiang CHE, Harbin Institute of Technology

    Organization Committee Co-Chairs:

    Dongyan ZHAO, Peking University

    Hongzhi YU, Northwest Minzu University

    Zhijun SUN, Dunhuang Academy

    Area Chairs

    - Conversational Bot/QA/IR/Dialogue:

    Yunhua HU, abitai.com

    Wenjie LI, The Hong Kong Polytechnic University

    - Fundamentals of NLP (Syntax, Semantics, Discourse):

    Yangfeng JI, University of Virginia

    Meishan ZHANG, Heilongjiang University

    - Knowledge Graph:

    Yangqiu SONG, Hong Kong University of Science and Technology

    Haofen WANG, Gowild.cn

    - Machine Learning for NLP:

    Caiming XIONG, Salesforce Research

    Xu SUN, Peking University

    - Machine Translation:

    Derek WONG, University of Macau

    Jiajun ZHANG, Chinese Academy of Sciences

    - NLP Applications, Privacy and Ethics:

    Ping LUO, Chinese Academy of Sciences

    Xiang REN, University of Southern California

    - Text Mining:

    Michalis VAZIRGIANNIS, Ecole Polytechnique

    Furu WEI, Microsoft Research

    Jun XU, Renmin University

    - Social Networks:

    Wei GAO, Victoria University of Wellington

    Chuan SHI, Beijing University of Posts and Telecommunications

    Treasurer

    Aixia JIA, Peking University

    Webmaster

    Ding WANG, Northwest Minzu University


    最准平肖平码资料大全
  • <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"></dl>
  • <li id="w8qua"></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"><menu id="w8qua"><small id="w8qua"></small></menu></dl>
  • <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
  • <li id="w8qua"></li>
  • <dl id="w8qua"><ins id="w8qua"></ins></dl>
  • <sup id="w8qua"></sup>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <sup id="w8qua"><menu id="w8qua"></menu></sup><sup id="w8qua"></sup>
    <li id="w8qua"><s id="w8qua"></s></li>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <li id="w8qua"><s id="w8qua"><thead id="w8qua"></thead></s></li>
  • <div id="w8qua"></div>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <div id="w8qua"></div>
    <div id="w8qua"></div>
    <dl id="w8qua"></dl>
  • <sup id="w8qua"><menu id="w8qua"></menu></sup>
    <li id="w8qua"></li>
  • <div id="w8qua"></div>
  • <li id="w8qua"><s id="w8qua"></s></li>
    <sup id="w8qua"><bdo id="w8qua"></bdo></sup>
    <dl id="w8qua"><s id="w8qua"></s></dl>
  • <dl id="w8qua"></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <acronym id="w8qua"><small id="w8qua"></small></acronym>
    <rt id="w8qua"></rt>
  • <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"></dl>
  • <li id="w8qua"></li>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <dl id="w8qua"><menu id="w8qua"><small id="w8qua"></small></menu></dl>
  • <li id="w8qua"><s id="w8qua"><strong id="w8qua"></strong></s></li>
  • <li id="w8qua"></li>
  • <dl id="w8qua"><ins id="w8qua"></ins></dl>
  • <sup id="w8qua"></sup>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <sup id="w8qua"><menu id="w8qua"></menu></sup><sup id="w8qua"></sup>
    <li id="w8qua"><s id="w8qua"></s></li>
    <dl id="w8qua"><ins id="w8qua"></ins></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <li id="w8qua"><s id="w8qua"><thead id="w8qua"></thead></s></li>
  • <div id="w8qua"></div>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
    <li id="w8qua"><s id="w8qua"></s></li>
  • <li id="w8qua"></li>
  • <li id="w8qua"><s id="w8qua"></s></li>
  • <div id="w8qua"></div>
    <div id="w8qua"></div>
    <dl id="w8qua"></dl>
  • <sup id="w8qua"><menu id="w8qua"></menu></sup>
    <li id="w8qua"></li>
  • <div id="w8qua"></div>
  • <li id="w8qua"><s id="w8qua"></s></li>
    <sup id="w8qua"><bdo id="w8qua"></bdo></sup>
    <dl id="w8qua"><s id="w8qua"></s></dl>
  • <dl id="w8qua"></dl>
    <dl id="w8qua"><menu id="w8qua"></menu></dl>
  • <acronym id="w8qua"><small id="w8qua"></small></acronym>
    <rt id="w8qua"></rt>
    最快北京pk10开奖结果 福建时时彩开奖记录 百宝彩票陕西快乐十分 时时网页缩水手机版 北京赛场pk直播 小鱼儿玄机马会开奘结果30马 谁有极速时时计划 481今天开奖号码 黑龙江十一选五走势图一定牛 北京快三计划精准版 时时彩看计划稳赢 江苏时时官网 湖北快三在线计划网站 友乐广西麻将 香港6合宝典资料大ⅰ全 赛车pk开奖直播手机板