A quantifier scoping algorithm without a free variable constraint:
Abstract: "Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The f...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
509 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in order to determine possible scopings I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be considered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning the use of logical form syntax are avoided. |
| Beschreibung: | 5 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452912 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24437321 | ||
| 035 | |a (DE-599)BVBBV010452912 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Lewin, Ian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A quantifier scoping algorithm without a free variable constraint |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 509 | |
| 520 | 3 | |a Abstract: "Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in order to determine possible scopings | |
| 520 | 3 | |a I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be considered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning the use of logical form syntax are avoided. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Grammatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Grammar, Comparative and general | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 509 |w (DE-604)BV010450646 |9 509 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006965741 | |
Datensatz im Suchindex
| _version_ | 1809403021060210688 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Lewin, Ian |
| author_facet | Lewin, Ian |
| author_role | aut |
| author_sort | Lewin, Ian |
| author_variant | i l il |
| building | Verbundindex |
| bvnumber | BV010452912 |
| ctrlnum | (OCoLC)24437321 (DE-599)BVBBV010452912 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010452912</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24437321</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452912</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lewin, Ian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A quantifier scoping algorithm without a free variable constraint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 S.</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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">509</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in order to determine possible scopings</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be considered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning the use of logical form syntax are avoided.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grammatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grammar, Comparative and general</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">509</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">509</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965741</subfield></datafield></record></collection> |
| id | DE-604.BV010452912 |
| illustrated | Not Illustrated |
| indexdate | 2024-09-06T00:06:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965741 |
| oclc_num | 24437321 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 5 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Lewin, Ian Verfasser aut A quantifier scoping algorithm without a free variable constraint Edinburgh 1990 5 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 509 Abstract: "Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in order to determine possible scopings I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be considered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning the use of logical form syntax are avoided. Computer software sigle Mathematics sigle Grammatik Mathematik Algorithms Grammar, Comparative and general Department of Artificial Intelligence: DAI research paper University <Edinburgh> 509 (DE-604)BV010450646 509 |
| spellingShingle | Lewin, Ian A quantifier scoping algorithm without a free variable constraint Computer software sigle Mathematics sigle Grammatik Mathematik Algorithms Grammar, Comparative and general |
| title | A quantifier scoping algorithm without a free variable constraint |
| title_auth | A quantifier scoping algorithm without a free variable constraint |
| title_exact_search | A quantifier scoping algorithm without a free variable constraint |
| title_full | A quantifier scoping algorithm without a free variable constraint |
| title_fullStr | A quantifier scoping algorithm without a free variable constraint |
| title_full_unstemmed | A quantifier scoping algorithm without a free variable constraint |
| title_short | A quantifier scoping algorithm without a free variable constraint |
| title_sort | a quantifier scoping algorithm without a free variable constraint |
| topic | Computer software sigle Mathematics sigle Grammatik Mathematik Algorithms Grammar, Comparative and general |
| topic_facet | Computer software Mathematics Grammatik Mathematik Algorithms Grammar, Comparative and general |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT lewinian aquantifierscopingalgorithmwithoutafreevariableconstraint |