ELLIPSIS AND HIGHER-ORDER UNIFICATION + ELLIPTIC CONSTRUCTIONS IN NATURAL-LANGUAGE

被引：162

作者：

DALRYMPLE, M

SHIEBER, SM

PEREIRA, FCN

机构：

[1] HARVARD UNIV,DIV APPL SCI,CAMBRIDGE,MA 02138

[2] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1007/BF00630923

中图分类号：

H0 [语言学];

学科分类号：

030303 ; 0501 ; 050102 ;

摘要：

引用

页码：399 / 452

页数：54

共 50 条

[1] Deaccenting and higher-order unification
Gardent C.
[J]. Journal of Logic, Language and Information, 2000, 9 (3) : 313 - 338
[2] Corrections and higher-order unification
Gardent, C
Kohlhase, M
van Leusen, N
[J]. NATURAL LANGUAGE PROCESSING AND SPEECH TECHNOLOGY: RESULTS OF THE 3RD KONVENS CONFERENCE, 1996, : 268 - 279
[3] Ramified higher-order unification
GoubaultLarrecq, J
[J]. 12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 410 - 421
[4] UNIFICATION-FAILURE FILTER FOR NATURAL-LANGUAGE
MAEDA, AM
TOMABECHI, H
AOE, J
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (01) : 19 - 26
[5] Higher-order CPM Constructions
Gogioso, Stefano
[J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (287): : 145 - 162
[6] Decidability of bounded higher-order unification
Schmidt-Schauss, M
Schulz, KU
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 2005, 40 (02) : 905 - 954
[7] HIGHER-ORDER UNIFICATION VIA COMBINATORS
DOUGHERTY, DJ
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 114 (02) : 273 - 298
[8] HIGHER-ORDER UNIFICATION, POLYMORPHISM, AND SUBSORTS
NIPKOW, T
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 436 - 447
[9] Optimizing higher-order pattern unification
Pientka, B
Pfenning, F
[J]. AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 473 - 487
[10] Decidability of bounded higher-order unification
Schmidt-Schauss, M
Schulz, KU
[J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2002, 2471 : 522 - 536