APPROACH TO NATURAL LANGUAGE PARSING.

被引：0
|
作者：
Park, Jack
机构：
来源：
The Journal of Forth application and research | 1986年 / 4卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
7
引用
收藏
页码：67 / 84
相关论文
共 50 条
  • [1] ESTIMATING THE SPEEDUP IN PARALLEL PARSING.
    Cohen, Jacques
    Kolodner, Stuart
    IEEE Transactions on Software Engineering, 1985, SE-11 (01) : 114 - 124
  • [2] PDP approach to deterministic natural language parsing
    Kwasny, Stan C.
    Neural Networks, 1988, 1 (1 SUPPL)
  • [3] An example based approach for parsing natural language sentences
    Chatterjee, Niladri
    Goyal, Shailly
    ICCTA 2007: INTERNATIONAL CONFERENCE ON COMPUTING: THEORY AND APPLICATIONS, PROCEEDINGS, 2007, : 451 - +
  • [4] TABULAR COMPILATION SYSTEM FOR AUGMENTED PROCEDENCE PARSING.
    Cook, Robert P.
    Proceedings of the Texas Conference on Computing Systems, 1979, : 15 - 4
  • [5] Connectionist natural language parsing
    Palmer-Brown, D
    Tepper, JA
    Powell, HM
    TRENDS IN COGNITIVE SCIENCES, 2002, 6 (10) : 437 - 442
  • [6] Weighted semantic parsing: A robust approach to interpretation of natural language queries
    Ballim, A
    Pallotta, V
    FLEXIBLE QUERY ANSWERING SYSTEMS: RECENT ADVANCES, 2001, : 243 - 254
  • [7] Dependency Parsing of Natural Russian Language with Usage of Semantic Mapping Approach
    Balandinaa, Anita
    Kostkina, Anastasiya
    Chernyshov, Artem
    Klimov, Valentin V.
    POSTPROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL CONFERENCE ON BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES (BICA 2018), 2018, 145 : 77 - 83
  • [8] Genetic programming for natural language parsing
    Araujo, L
    GENETIC PROGRAMMING, PROCEEDINGS, 2004, 3003 : 230 - 239
  • [9] Natural language parsing for semantic science
    Hawizy, Lezan
    Lowe, Daniel
    Barjat, Hannah
    Jessop, David
    Murray-Rust, Peter
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2012, 244
  • [10] Discriminative reranking for natural language parsing
    Collins, M
    Koo, T
    COMPUTATIONAL LINGUISTICS, 2005, 31 (01) : 25 - 69
12345