Using multiple adaptively-weighted strategies for the resolution of demonstratives:
Abstract: "The resolution of demonstratives is an interesting topic which nonetheless has received relatively little attention. As with pronominal anaphora, there is currently no comprehensive theory of demonstrative references, although there are numerous partial or microtheories. This dissert...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Pittsburgh, Pa.
School of Computer Science
1993
|
Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1993,148 |
Schlagworte: | |
Zusammenfassung: | Abstract: "The resolution of demonstratives is an interesting topic which nonetheless has received relatively little attention. As with pronominal anaphora, there is currently no comprehensive theory of demonstrative references, although there are numerous partial or microtheories. This dissertation describes a multistrategy approach to resolving demonstrative pronouns and noun phrases, using constraint, preference, and recovery strategies implementing various microtheories and heuristics. The multistrategy approach, which has proven itself for resolving pronominal anaphora, allows easy integration of new microtheories This provides incremental improvements in performance, permitting a decreasing reliance on user intervention as the system is able to resolve a larger percentage of demonstratives. A major weakness of the multistrategy approach, the necessity to carefully choose the weights of the strategies, is overcome by automatically optimizing the weights as demonstratives are resolved. Such an adaptively-weighted multistrategy approach has been implemented in the modular and extensible Master-D system which is expected to be applicable to other linguistic phenomena in addition to the resolution of demonstratives. |
Beschreibung: | Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss. |
Beschreibung: | IV, 182 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010023723 | ||
003 | DE-604 | ||
005 | 19960508 | ||
007 | t | ||
008 | 950203s1993 d||| m||| 00||| engod | ||
035 | |a (OCoLC)28981871 | ||
035 | |a (DE-599)BVBBV010023723 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91 | ||
082 | 0 | |a 510.7808 |b C28r 93-148 | |
084 | |a DAT 714d |2 stub | ||
088 | |a CMU CS 93 148 | ||
100 | 1 | |a Brown, Ralf D. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Using multiple adaptively-weighted strategies for the resolution of demonstratives |c Ralf D. Brown |
246 | 1 | 3 | |a CMU CS 93 148 |
264 | 1 | |a Pittsburgh, Pa. |b School of Computer Science |c 1993 | |
300 | |a IV, 182 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1993,148 | |
500 | |a Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss. | ||
520 | 3 | |a Abstract: "The resolution of demonstratives is an interesting topic which nonetheless has received relatively little attention. As with pronominal anaphora, there is currently no comprehensive theory of demonstrative references, although there are numerous partial or microtheories. This dissertation describes a multistrategy approach to resolving demonstrative pronouns and noun phrases, using constraint, preference, and recovery strategies implementing various microtheories and heuristics. The multistrategy approach, which has proven itself for resolving pronominal anaphora, allows easy integration of new microtheories | |
520 | 3 | |a This provides incremental improvements in performance, permitting a decreasing reliance on user intervention as the system is able to resolve a larger percentage of demonstratives. A major weakness of the multistrategy approach, the necessity to carefully choose the weights of the strategies, is overcome by automatically optimizing the weights as demonstratives are resolved. Such an adaptively-weighted multistrategy approach has been implemented in the modular and extensible Master-D system which is expected to be applicable to other linguistic phenomena in addition to the resolution of demonstratives. | |
650 | 4 | |a Natural language processing (Computer science) | |
650 | 0 | 7 | |a Demonstrativpronomen |0 (DE-588)4136404-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Syntaktische Analyse |0 (DE-588)4058778-2 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Demonstrativpronomen |0 (DE-588)4136404-1 |D s |
689 | 0 | 1 | |a Syntaktische Analyse |0 (DE-588)4058778-2 |D s |
689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1993,148 |w (DE-604)BV006187264 |9 1993,148 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006646097 |
Datensatz im Suchindex
_version_ | 1804124403725762560 |
---|---|
any_adam_object | |
author | Brown, Ralf D. |
author_facet | Brown, Ralf D. |
author_role | aut |
author_sort | Brown, Ralf D. |
author_variant | r d b rd rdb |
building | Verbundindex |
bvnumber | BV010023723 |
classification_tum | DAT 714d |
ctrlnum | (OCoLC)28981871 (DE-599)BVBBV010023723 |
dewey-full | 510.7808 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510.7808 |
dewey-search | 510.7808 |
dewey-sort | 3510.7808 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02906nam a2200457 cb4500</leader><controlfield tag="001">BV010023723</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960508 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950203s1993 d||| m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28981871</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010023723</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 93-148</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 714d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 93 148</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brown, Ralf D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using multiple adaptively-weighted strategies for the resolution of demonstratives</subfield><subfield code="c">Ralf D. Brown</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 93 148</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="b">School of Computer Science</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 182 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1993,148</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The resolution of demonstratives is an interesting topic which nonetheless has received relatively little attention. As with pronominal anaphora, there is currently no comprehensive theory of demonstrative references, although there are numerous partial or microtheories. This dissertation describes a multistrategy approach to resolving demonstrative pronouns and noun phrases, using constraint, preference, and recovery strategies implementing various microtheories and heuristics. The multistrategy approach, which has proven itself for resolving pronominal anaphora, allows easy integration of new microtheories</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This provides incremental improvements in performance, permitting a decreasing reliance on user intervention as the system is able to resolve a larger percentage of demonstratives. A major weakness of the multistrategy approach, the necessity to carefully choose the weights of the strategies, is overcome by automatically optimizing the weights as demonstratives are resolved. Such an adaptively-weighted multistrategy approach has been implemented in the modular and extensible Master-D system which is expected to be applicable to other linguistic phenomena in addition to the resolution of demonstratives.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Demonstrativpronomen</subfield><subfield code="0">(DE-588)4136404-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Syntaktische Analyse</subfield><subfield code="0">(DE-588)4058778-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Demonstrativpronomen</subfield><subfield code="0">(DE-588)4136404-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Syntaktische Analyse</subfield><subfield code="0">(DE-588)4058778-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1993,148</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1993,148</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006646097</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV010023723 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:45:07Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006646097 |
oclc_num | 28981871 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | IV, 182 S. graph. Darst. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | School of Computer Science |
record_format | marc |
series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
spelling | Brown, Ralf D. Verfasser aut Using multiple adaptively-weighted strategies for the resolution of demonstratives Ralf D. Brown CMU CS 93 148 Pittsburgh, Pa. School of Computer Science 1993 IV, 182 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1993,148 Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss. Abstract: "The resolution of demonstratives is an interesting topic which nonetheless has received relatively little attention. As with pronominal anaphora, there is currently no comprehensive theory of demonstrative references, although there are numerous partial or microtheories. This dissertation describes a multistrategy approach to resolving demonstrative pronouns and noun phrases, using constraint, preference, and recovery strategies implementing various microtheories and heuristics. The multistrategy approach, which has proven itself for resolving pronominal anaphora, allows easy integration of new microtheories This provides incremental improvements in performance, permitting a decreasing reliance on user intervention as the system is able to resolve a larger percentage of demonstratives. A major weakness of the multistrategy approach, the necessity to carefully choose the weights of the strategies, is overcome by automatically optimizing the weights as demonstratives are resolved. Such an adaptively-weighted multistrategy approach has been implemented in the modular and extensible Master-D system which is expected to be applicable to other linguistic phenomena in addition to the resolution of demonstratives. Natural language processing (Computer science) Demonstrativpronomen (DE-588)4136404-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Syntaktische Analyse (DE-588)4058778-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Demonstrativpronomen (DE-588)4136404-1 s Syntaktische Analyse (DE-588)4058778-2 s Algorithmus (DE-588)4001183-5 s DE-604 School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1993,148 (DE-604)BV006187264 1993,148 |
spellingShingle | Brown, Ralf D. Using multiple adaptively-weighted strategies for the resolution of demonstratives School of Computer Science <Pittsburgh, Pa.>: CMU-CS Natural language processing (Computer science) Demonstrativpronomen (DE-588)4136404-1 gnd Algorithmus (DE-588)4001183-5 gnd Syntaktische Analyse (DE-588)4058778-2 gnd |
subject_GND | (DE-588)4136404-1 (DE-588)4001183-5 (DE-588)4058778-2 (DE-588)4113937-9 |
title | Using multiple adaptively-weighted strategies for the resolution of demonstratives |
title_alt | CMU CS 93 148 |
title_auth | Using multiple adaptively-weighted strategies for the resolution of demonstratives |
title_exact_search | Using multiple adaptively-weighted strategies for the resolution of demonstratives |
title_full | Using multiple adaptively-weighted strategies for the resolution of demonstratives Ralf D. Brown |
title_fullStr | Using multiple adaptively-weighted strategies for the resolution of demonstratives Ralf D. Brown |
title_full_unstemmed | Using multiple adaptively-weighted strategies for the resolution of demonstratives Ralf D. Brown |
title_short | Using multiple adaptively-weighted strategies for the resolution of demonstratives |
title_sort | using multiple adaptively weighted strategies for the resolution of demonstratives |
topic | Natural language processing (Computer science) Demonstrativpronomen (DE-588)4136404-1 gnd Algorithmus (DE-588)4001183-5 gnd Syntaktische Analyse (DE-588)4058778-2 gnd |
topic_facet | Natural language processing (Computer science) Demonstrativpronomen Algorithmus Syntaktische Analyse Hochschulschrift |
volume_link | (DE-604)BV006187264 |
work_keys_str_mv | AT brownralfd usingmultipleadaptivelyweightedstrategiesfortheresolutionofdemonstratives AT brownralfd cmucs93148 |