File size: 41,683 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 | {
"paper_id": "P79-1011",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:11:36.382370Z"
},
"title": "ON THE AUTOMATIC TRANSFORMATION OF CLASS MEMBERSHIP CRITERIA",
"authors": [
{
"first": "Barbara",
"middle": [
"C"
],
"last": "Sangster",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Rutgers University",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P79-1011",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "membership in such a way as to permit the intelligent handling ~f inexact, as well as exact matches. An inexact match is a comparlson between an instance and a set of criteria (or a second instance) which has the result that some, but not all, of the criteria described (or exemplified) in the second are found to be satisfied in the first. An exact match is such a comparison for which all of the criteria of the second are found to be satisfied in the first. The approach presented in this paper is t~ transform the set of criteria for class membership into an exemplary instance of a member of the class, which exhibits a set ~f characteristics whose presence is necessary and sufficient for membership in that class.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Use of this exemplary instance during the matching process appears to permit important functions associated with inexact matching to be easi]y performed, and also",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "to have a beneficial effect on the overaJ] efficiency of the matching process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "An important common element ~f many projects in Artificial",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "Intelligence is the determination of whether a particular instance satisfies the criteria for membership in a particular class.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "Frequently, this task is a component of a larger one involving a set of instances, or a set of classes, or both. This determination need not necessarily call for an exact match between an instance and a set of criteria, but only for the \"best ,\" or \"closest ,\" match, by some definition of goodness or closeness.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "One important specification for such tasks is the capability for efficient matching procedures; another is the ability to perform inexact, as we]] as exact matches.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "One step towards achieving efficient matching procedures is 50 represent criteria for class membership in the same way as descriptions ~f instances.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "This may be done by transforming the set of criteria, through a process of symbolic instantiation, into a kind of prototypical instance, or exemplary member of the class. This permits the use of a simple matching algorithm, such as one that merely checks whether required components of the definition of the class are also present in the description of the instance. This also permits easy representation of modifications to the definition, whenever the capability of inexact matching is desired.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "Other ways of representing definitions of ciasses might be needed for other purposes, however. For example, the knowledge-representation language AIMDS would normally be expected to represent definitions in a more complex manner, involving the use of pattern-directed inference rules. These rules may be used, e.g. An algorithm has been devised for automatically trans]ating a definition in one of the two directions -from the form using the pattern-directed inference rules intn a simpler, symboJical]y instantiated form [11] . This algorithm has been shown to work correctly for any well-formed definition in a clearly-defined syntactic class [10] .",
"cite_spans": [
{
"start": 522,
"end": 526,
"text": "[11]",
"ref_id": "BIBREF4"
},
{
"start": 645,
"end": 649,
"text": "[10]",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "The use of the symbolically instantiated form for b~th exact and inexact matches is outlined here;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "using a hand-created symbolic instantiation, a run demonstrating an exact match is presented. The paper conc]udes with a discussion ~f some implications of this apprnach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": "1."
},
{
"text": "The research project presented in this paper was motivated by the need for determining automatically whether a set of facts comprising the description of a legal case satisfies the conditions expressed in a legs/ definition, and, if not, in what respects it fails to satisfy those conditions [8] , [9] , [I0], [11] , [13] . The need to perform this task is central to a larger project whose purpose is the representation of the definitions of certain legal concepts, and of decisions based on those concepts. inexact matching arises in the legal/judlclal domain when a legal class must be assigned to the facts of the case at hand, but when an exact match cannot be roland between those facts and any of the definitions of possible legal classes.",
"cite_spans": [
{
"start": 292,
"end": 295,
"text": "[8]",
"ref_id": "BIBREF0"
},
{
"start": 298,
"end": 301,
"text": "[9]",
"ref_id": "BIBREF2"
},
{
"start": 310,
"end": 314,
"text": "[11]",
"ref_id": "BIBREF4"
},
{
"start": 317,
"end": 321,
"text": "[13]",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "In that situation, a reasonable first-order approximation to the way real decisions are made may be to say that the class whose definition offers the \"best\" or \" closest\" match to the facts of the case at hand is the class that should be assigned to the facts in question.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "That is the approach taken in the current project. In the domain of syntax, an inexact matching capability makes possible the correct interpretation of utterances that are not fully grammatical with respect to the grammar being used [7].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "In the domains of speech understanding and character recognition, the ability to perform inexact matching makes it possible to disregard errors caused by such factors as noise or carelessness of the speaker or writer.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "When an inexact match of an instance has been identified, the first step is to attempt to deal with any criteria ~nich were not found to be satisfied in the instance, but were not found not to be satisfied either --i.e., the unknowns.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "At that point, if an exact match still has not been achieved, two modes of action are possible:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "the modification of the instance whose characterization is being sought, or the modification of the criteria by means of which a characterization is found.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "The choice between these two responses (or of the way in which they are combined) appears to be a function of the domain and sometimes also of the particular item in question. In general, in the lesallJudlcial domain, the facts of the case, once determined, are fixed (~nless new evidence is introduced), hut the criteria For assigning a legal characterization to those facts may be modified.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INRXAC T MATCHING",
"sec_num": "2."
},
{
"text": "~ A p.mh+mtM~my",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "Because of. the importance of inexact ~atchlnE in the legal/judlclal domain, it is desirable to utilize a matehir~ procedure that permits useful functions related to inexant matching to be performed conveniently. Such functions include a way of. easily determining all the respects in which attempted exact matches to a particular definition might fail , a wey of. easily determinln~ what chlln~es to a definition would be suf.f.icient For an exact match with a particular case to be permitted, and a wey of ensuring that a contemplated modif.lcation to a def.inition will not introduce inconsistencies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "Two f.eatures of. a representational scheme that would appear to help in performin~ these functions conveniently are SPEC1) that the scheme permit a distinction to be made between those propositions that must be t~ be true of. any instance satlsfylng the def.lnltion and any other propositions that might also be true of. the instance, and SPEC2) that the scheme permit the former set of. propositions to be expressed in a simple, ulilf.led wey, so as to redune or even eliminate the need for inf.erencing and other processing activities when the ~ntlons outlined above are performed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "By satlsfyi~ SPECl, we permit the propositions which are central to the matohiDg process to he distir~ulshed from any others;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "by satisfying SPEC2, we permit those propositions to be accessed and manipulated (e,go, for the inexact matching Functions listed above) in an efficient and straightforward manner. Thus, the Fulfillment of 3PECI and SPEC2 slgniflcantly strengthens our ability to perform Functions central to the inexact matching process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "A representational scheme that meets these specifications has been designed, and an experimental implementation performed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "The approach used is to precede the matching activity proper with a one-tlme preprocessing phase, duping Milch the definition is automatically transformed from the form in which it is originally expressed into a representational scheme which appears to be more suitable to the matching task at hand. The transformation algorithm makes use of a distlnntion between those components of the definition wl~ich must be Found to be true and those whose truth either may be inferred or else is irrelevant to the matching process. The transformation is performed by means of a process of ~ inmtRntlat~nn OF the deflnition --the translation of the de/initlon f~'om a set of criteria for satisfying the definition into an exemplary instance of the concept itself. The transformed definition resulting fro m this process appears to meet the speclf.ications given above. : CONPONENT1 for a staple n.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "definition, as well as other pr~positions that do not have this quality.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "The output from the trans{ormation process that is used for matching with an instance is a symbolically instantiated form of the definition called the KERNEL fo~ the definition. It consists solely of a set of propositions expressing relations between instances. These are precisely those propositions whose truth must be observed in any instance satisfying the definition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "Constraints on instantiation (COMPONENT2 above) are reflected in the choice of values for the instances in these propositions. Thus the KERNEL structure has the properties set forth in SPECI and SPEC2 above, and its use during the matching process may consequently be expected to help in w~rking with inexact matches.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "For similar reasons, use of the KERNEL structure appears also to permit a significant improvement in efficiency of the overall matching",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "process [I0]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": ", [11] .",
"cite_spans": [
{
"start": 2,
"end": 6,
"text": "[11]",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "The propositions input to the transformation process (i.e., COMPONENTI) are illustrated, for the definition of a kind of corporate reorganization called a BREORGANIZATION, in Figure I ; the arcs represent relations, and the nodes represent the types of the instances between which the relations may ho]d. Several of the pattern-directed inference rules input to the transformation process (COMPONENT2) for part of the same definition are illustrated in Figure 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 175,
"end": 184,
"text": "Figure I",
"ref_id": null
},
{
"start": 454,
"end": 462,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "The KERNEL structure for that definition output by the transformation process is illustrated in Figure 3 . The propositions shown there are the ones whose truth is necessary and sufficient for the definition to have been met. Bindings constraints between nodes are reflected in the labels of the nodes; the nodes in Figure 3 represent instances. Thus, the two components represented in Figures I and 2 are transformed, for the purposes of matching, into the structure represented in Figure 3 , The transformation process is described in more detail in [I0] and [11] ; [10] also contains an informal proof that the transformation algorithm will work correctly for all definitions in a well-defined syntactic class.",
"cite_spans": [
{
"start": 561,
"end": 565,
"text": "[11]",
"ref_id": "BIBREF4"
},
{
"start": 568,
"end": 572,
"text": "[10]",
"ref_id": "BIBREF3"
}
],
"ref_spans": [
{
"start": 96,
"end": 104,
"text": "Figure 3",
"ref_id": null
},
{
"start": 316,
"end": 324,
"text": "Figure 3",
"ref_id": null
},
{
"start": 386,
"end": 401,
"text": "Figures I and 2",
"ref_id": null
},
{
"start": 483,
"end": 491,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "I~Z~~E t~",
"sec_num": "3."
},
{
"text": "Once the transformation of a definition has been performed, it need never again be repeated (unless the definition itself should change), and the compiled KERNEL structure may be used directly whenever a set of ((EXCHANOE X) |FF",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "~. ~X~CUTIONOFTHEMATCHINOPR~CESS",
"sec_num": null
},
{
"text": "TRANS2 (TRN~S 1\"2) (X (TRANSFEROR2 AOENTOF) T2) (X (TRANSPRQP~ OBJECTOF) T2) (X (TRANSFEROR2 OLDONt4ERQF) T2) (X (TRANSFERORt NEWOWNEROF) ~)3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "((EXCHANOE X) IFF C(EXCHANOE X) ZFF ((EXCHANOE X) {FF TRANSI (TRAI4S T|) (X (TRANSFEROR1ACENTOF) T1) (X (TRANSPROP20BJECTQF) T1) (X (TRANSFEROR10LDO~NEROF) T|) (X (TRANSFEROR2 NEWOWNEROF) TI)]",
"sec_num": null
},
{
"text": "Ffi_\u2022u_re ~: A portion of COMPONENT2 or a sample definition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "facts comprising a description of a legal c;Jse L~ presented-for comparison with the def(nit~n.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "In order to control possib]e combinat~ric diffLcu]+[es, the KERNEL structure is decomposed tnt~ a se t ~r small networks, against each of which a]] substructures ~f the same type in the case description are tes+ed f~r a structural match (STAGEI).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "DMATCH [15] , a functL~n written by D. Touretzky, performed structural ma+chLng in the experimental implementation. The hope LS the + \"small networks\" can be selected from the KERNEL in such a way that matching to any single small n~twork wi|] involve a minimal degree of combinator[c compiexEty. For an exact match, the substructures that survive STAGEI (and no others) are then combined in all p~ssibie valid ways into larger networks ~f s~me degree ~f increase in complexity.",
"cite_spans": [
{
"start": 7,
"end": 11,
"text": "[15]",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "A structural match ~f each ~f these structures with the corresponding substructure ~f the KERNEL is then attempted, and bindings c~nstraints between formerly separate components of the new network are thereby tested.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "This process is repeated wLth surviving substructures until the structural match is conducted against the KERNEL structure itself. When +he criterion for matching at each stage Ls an exact match, as described above, the survivors of the final s~age ~f structural matching represent all and ~n]y the subcases in the case description that meet the c~ndi+i~ns expressed in the definition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "The execution of the marcher in the manner described above is illustrated in Figure 4 . For this example, five instances of the type TRANS (TI, T2, T3, T4, TL), two instances of the type CONTROL (CI, C2), and ~wo instances of PROPERTY (06, 09) were used. The value of MAKEFULLLIST shows the survivors of STAGEI.",
"cite_spans": [],
"ref_spans": [
{
"start": 77,
"end": 85,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "The value of BGO shows the single valid instance of a BREORGANIZATION that can be created fr-m these components.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "An inexact matching capability, not currently implemented, would determine, when at any stage a match failed, I) why it had failed, and 2) how close it ned come to being an exact ms+oh.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "At the next stage, a combination of substructures would be submitted for consideration by the marcher only Lf it had met some criterion of proximity t~ an exact match -either on an absolute scale, or relative to the ~ther candidates for matching. When the final stage ~f the matching process had been completed, that candidate (or those candidates) that permitted the most nearly exact match could then be Selected.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "In order to perform the inexact matching function outlined in the preceding paragraph, an a]g-rithm for computing distance from a exact match must be formulated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "For the reasons given above, we anticipate that I) the transformation of definitions into the corresponding KERNEL structures will make that task easier, and that 2) once a distance algorit~ has been formulated, the use of the KERNEL structLLPe will contribute to performing the inexact matching f~/nction wlth efficiency and conceptual clarity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "TRANSFEROR! (ACTOR A) (X (TRANSI AOENT) A) (X (TRANSI OLDOWNER) A) (X (TRANS2 NENOWNER) A)] TRANSFEROR= (ACTOR A) (X (TRANS2 AOENr) A) (X (TRAN~2 OLDO~,qER) A) (X (THANS| NEiJO~NER) A)]",
"sec_num": null
},
{
"text": "The capability for the intelligent handling of inexact matches ham been shown to be an important requirement for the representation of certain classification +.asks. A procedure has been outlined ~nereby a set of criteria for membership in a particular class may be transformed into an exemplary instance of a member of that class.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "CONCLUSIONS",
"sec_num": "5."
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Reflections on TAXMAN: An",
"authors": [
{
"first": "L",
"middle": [
"T"
],
"last": "Mccarty",
"suffix": ""
}
],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCarty, L. T. 1977. \"Reflections on TAXMAN: An",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "HarvmrdL~w Review, vo1. 90",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "837--893",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Reasoning\". HarvmrdL~w Review, vo1. 90, pp. 837-893.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The Implementation of TAXMAN II: An Experiment in Artificial Intelligence and Legal Reasoning",
"authors": [
{
"first": "B",
"middle": [
"T"
],
"last": "Mccarty",
"suffix": ""
},
{
"first": "N",
"middle": [
"3"
],
"last": "Sridharan",
"suffix": ""
},
{
"first": "B",
"middle": [
"C"
],
"last": "Sangster",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCarty, b. T., N. 3. Sridharan, and B. C. Sangster. 1979. \"The Implementation of TAXMAN II: An Experiment in Artificial Intelligence and Legal Reasoning\". Rutgers University Report #LCSR-TR-3.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "An Automatically Cempilable Hierarchical Definition Marcher",
"authors": [
{
"first": "B",
"middle": [
"C"
],
"last": "Sangster",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sangster, B. C. 1979a. \"An Automatically Cempilable Hierarchical Definition Marcher\". Rutgers University Report #LRP-TR-3.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "An Overview of an Automatically Compilab]e Hierarchical Definition Hatcher",
"authors": [
{
"first": "B",
"middle": [
"C"
],
"last": "Sangster",
"suffix": ""
}
],
"year": 1979,
"venue": "Promeedln~fthe TJCAI-7q",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sangster, B. C. 1979b. \"An Overview of an Automatically Compilab]e Hierarchical Definition Hatcher\". Promeedln~fthe TJCAI-7q.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "AIMDS User Manual, Version 2",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sridharan, N. S. 1978a. (Ed.) \"AIMDS User Manual, Version 2.\" Rutgers University Report #CBM-TR-89.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Some Relationships between BELIEVER and TAXMAN",
"authors": [
{
"first": "N",
"middle": [
"S"
],
"last": "Sridharan",
"suffix": ""
}
],
"year": 1978,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sridharan, N. S. 1978b. \"Some Relationships between BELIEVER and TAXMAN\". Rutgers University Report #LCSR-TR-2.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The Architecture of Coherent Information System: A General Problem 3olving System",
"authors": [
{
"first": "C",
"middle": [
"V"
],
"last": "Srinivasan",
"suffix": ""
}
],
"year": 1976,
"venue": "T~E Trana~tion~on~",
"volume": "25",
"issue": "",
"pages": "390--402",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Srinivasan, C. V. 1976. \"The Architecture of Coherent Information System: A General Problem 3olving System\". T~E Trana~tion~on~, VOl. 25, pp. 390-402.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Learning from Examples in a Frame-Based System",
"authors": [
{
"first": "D",
"middle": [],
"last": "Touretzky",
"suffix": ""
}
],
"year": 1978,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Touretzky, D. 1978. \"Learning from Examples in a Frame-Based System\". Rutgers University Report #CBM-TR-87.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "What's in a Link: Fot~ldations for Sema/ltio Networks",
"authors": [
{
"first": "W",
"middle": [
"A"
],
"last": "Woods",
"suffix": ""
}
],
"year": 1975,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Woods, W. A. 1975. \"What's in a Link: Fot~ldations for Sema/ltio Networks\". In Renresentation Under~tAndinl, ed. by D. G. Bobrow and A. Collins. Academic Press.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "The input to the transformation process is a definition expressed in two parts: CCHPONENTI) a set of propositions eonslsting of relations between typed variables organized in frame form, and CCI4POMENT2) a set of' pattern-directed inference rules expressing constraints on how the propositions in CCHPONEMTI .my be Instantlated.'rite propositions in COHPONENTI include propositions that must be found to be true of. any instance satisfying the +,,,,,=-,nor ~o,~\" .... ~' ;' +' +. ' ' ' ' +' . ,"
}
}
}
} |