Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing
Identifieur interne : 002A92 ( Istex/Corpus ); précédent : 002A91; suivant : 002A93Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing
Auteurs : Sebastian Shaumyan ; Paul HudakSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on Applicative Universal Grammar (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings. The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.
Url:
DOI: 10.1007/3-540-48975-4_4
Links to Exploration step
ISTEX:B54BA72023100B918132126AD4CB495CDC02831ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title><author><name sortKey="Shaumyan, Sebastian" sort="Shaumyan, Sebastian" uniqKey="Shaumyan S" first="Sebastian" last="Shaumyan">Sebastian Shaumyan</name><affiliation><mods:affiliation>Department of Linguistics, Yale University, 06520, New Haven, CT, USA</mods:affiliation></affiliation></author><author><name sortKey="Hudak, Paul" sort="Hudak, Paul" uniqKey="Hudak P" first="Paul" last="Hudak">Paul Hudak</name><affiliation><mods:affiliation>Department of Computer Science, Yale University, 06520, New Haven, CT, USA</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B54BA72023100B918132126AD4CB495CDC02831A</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-48975-4_4</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002A92</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002A92</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title><author><name sortKey="Shaumyan, Sebastian" sort="Shaumyan, Sebastian" uniqKey="Shaumyan S" first="Sebastian" last="Shaumyan">Sebastian Shaumyan</name><affiliation><mods:affiliation>Department of Linguistics, Yale University, 06520, New Haven, CT, USA</mods:affiliation></affiliation></author><author><name sortKey="Hudak, Paul" sort="Hudak, Paul" uniqKey="Hudak P" first="Paul" last="Hudak">Paul Hudak</name><affiliation><mods:affiliation>Department of Computer Science, Yale University, 06520, New Haven, CT, USA</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on Applicative Universal Grammar (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings. The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Sebastian Shaumyan</name><affiliations><json:string>Department of Linguistics, Yale University, 06520, New Haven, CT, USA</json:string></affiliations></json:item><json:item><name>Paul Hudak</name><affiliations><json:string>Department of Computer Science, Yale University, 06520, New Haven, CT, USA</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-8TQWH02Z-J</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on Applicative Universal Grammar (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings. The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.</abstract><qualityIndicators><score>9.112</score><pdfWordCount>7881</pdfWordCount><pdfCharCount>44714</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>22</pdfPageCount><pdfPageSize>464 x 671 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>176</abstractWordCount><abstractCharCount>1158</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title><chapterId><json:string>4</json:string><json:string>Chap4</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1999</copyrightDate><issn><json:string>0302-9743</json:string></issn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>J. van Leeuwen</name></json:item></editor></serie><host><title>Logical Aspects of Computational Linguistics</title><language><json:string>unknown</json:string></language><copyrightDate>1999</copyrightDate><doi><json:string>10.1007/3-540-48975-4</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-48975-7</json:string></eisbn><bookId><json:string>3-540-48975-4</json:string></bookId><isbn><json:string>978-3-540-65751-4</json:string></isbn><volume>1582</volume><pages><first>70</first><last>91</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Alain Lecomte</name><affiliations><json:string>Université Pierre Mendès France (Grenoble 2), 1251 avenue Centrale, BP 47, F-38040, Grenoble Cedex, France</json:string><json:string>E-mail: Alain.Lecomte@upmf-grenoble.fr</json:string></affiliations></json:item><json:item><name>François Lamarche</name><affiliations><json:string>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</json:string><json:string>E-mail: Lamarche@loria.fr</json:string></affiliations></json:item><json:item><name>Guy Perrier</name><affiliations><json:string>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</json:string><json:string>E-mail: Perrier@loria.fr</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-8TQWH02Z-J</json:string></ark><publicationDate>1999</publicationDate><copyrightDate>1999</copyrightDate><doi><json:string>10.1007/3-540-48975-4_4</json:string></doi><id>B54BA72023100B918132126AD4CB495CDC02831A</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="1999">1999</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title><author><persName><forename type="first">Sebastian</forename><surname>Shaumyan</surname></persName><affiliation><orgName type="department">Department of Linguistics</orgName><orgName type="institution">Yale University</orgName><address><settlement>New Haven</settlement><region>CT</region><postCode>06520</postCode><country key="US">UNITED STATES</country></address></affiliation></author><author><persName><forename type="first">Paul</forename><surname>Hudak</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">Yale University</orgName><address><settlement>New Haven</settlement><region>CT</region><postCode>06520</postCode><country key="US">UNITED STATES</country></address></affiliation></author><idno type="istex">B54BA72023100B918132126AD4CB495CDC02831A</idno><idno type="ark">ark:/67375/HCB-8TQWH02Z-J</idno><idno type="DOI">10.1007/3-540-48975-4_4</idno></analytic><monogr><title level="m" type="main">Logical Aspects of Computational Linguistics</title><title level="m" type="sub">Second International Conference, LACL'97 Nancy, France, September 22-24, 1997 Selected Papers</title><title level="m" type="part">Selected papers</title><idno type="DOI">10.1007/3-540-48975-4</idno><idno type="book-id">3-540-48975-4</idno><idno type="ISBN">978-3-540-65751-4</idno><idno type="eISBN">978-3-540-48975-7</idno><idno type="chapter-id">Chap4</idno><idno type="part-id">Part2</idno><editor><persName><forename type="first">Alain</forename><surname>Lecomte</surname></persName><email>Alain.Lecomte@upmf-grenoble.fr</email><affiliation><orgName type="institution">Université Pierre Mendès France (Grenoble 2)</orgName><address><street>1251 avenue Centrale</street><postBox>BP 47</postBox><postCode>F-38040</postCode><settlement>Grenoble Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><editor><persName><forename type="first">François</forename><surname>Lamarche</surname></persName><email>Lamarche@loria.fr</email><affiliation><orgName type="institution">LORIA (Nancy)</orgName><address><street>615 rue de Jardin Botanique</street><postBox>BP 101</postBox><postCode>F-54602</postCode><settlement>Villers lès Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><editor><persName><forename type="first">Guy</forename><surname>Perrier</surname></persName><email>Perrier@loria.fr</email><affiliation><orgName type="institution">LORIA (Nancy)</orgName><address><street>615 rue de Jardin Botanique</street><postBox>BP 101</postBox><postCode>F-54602</postCode><settlement>Villers lès Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><imprint><biblScope unit="vol">1582</biblScope><biblScope unit="page" from="70">70</biblScope><biblScope unit="page" to="91">91</biblScope><biblScope unit="chapter-count">12</biblScope><biblScope unit="part-chapter-count">10</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">J.</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on <hi rend="italic">Applicative Universal Grammar</hi> (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings.</p><p>The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-1">Logics and Meanings of Programs</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-2">Artificial Intelligence (incl. Robotics)</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-3">Mathematical Logic and Formal Languages</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-48975-4</BookID><BookTitle>Logical Aspects of Computational Linguistics</BookTitle><BookSubTitle>Second International Conference, LACL'97 Nancy, France, September 22-24, 1997 Selected Papers</BookSubTitle><BookVolumeNumber>1582</BookVolumeNumber><BookSequenceNumber>1582</BookSequenceNumber><BookDOI>10.1007/3-540-48975-4</BookDOI><BookTitleID>59606</BookTitleID><BookPrintISBN>978-3-540-65751-4</BookPrintISBN><BookElectronicISBN>978-3-540-48975-7</BookElectronicISBN><BookChapterCount>12</BookChapterCount><BookHistory><OnlineDate><Year>2001</Year><Month>5</Month><Day>22</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>1999</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I1603X" Priority="1" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Alain</GivenName><FamilyName>Lecomte</FamilyName></EditorName><Contact><Email>Alain.Lecomte@upmf-grenoble.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>François</GivenName><FamilyName>Lamarche</FamilyName></EditorName><Contact><Email>Lamarche@loria.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Guy</GivenName><FamilyName>Perrier</FamilyName></EditorName><Contact><Email>Perrier@loria.fr</Email></Contact></Editor><Affiliation ID="Aff1"><OrgName>Université Pierre Mendès France (Grenoble 2)</OrgName><OrgAddress><Street>1251 avenue Centrale</Street><Postbox>BP 47</Postbox><Postcode>F-38040</Postcode><City>Grenoble Cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>LORIA (Nancy)</OrgName><OrgAddress><Street>615 rue de Jardin Botanique</Street><Postbox>BP 101</Postbox><Postcode>F-54602</Postcode><City>Villers lès Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Selected papers</PartTitle><PartChapterCount>10</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-48975-4</BookID><BookTitle>Logical Aspects of Computational Linguistics</BookTitle></PartContext></PartInfo><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>4</ChapterID><ChapterDOI>10.1007/3-540-48975-4_4</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</ChapterTitle><ChapterFirstPage>70</ChapterFirstPage><ChapterLastPage>91</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>1999</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2001</Year><Month>5</Month><Day>21</Day></RegistrationDate><OnlineDate><Year>2001</Year><Month>5</Month><Day>22</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>3-540-48975-4</BookID><BookTitle>Logical Aspects of Computational Linguistics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Sebastian</GivenName><FamilyName>Shaumyan</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Paul</GivenName><FamilyName>Hudak</FamilyName></AuthorName></Author><Affiliation ID="Aff5"><OrgDivision>Department of Linguistics</OrgDivision><OrgName>Yale University</OrgName><OrgAddress><City>New Haven</City><State>CT</State><Postcode>06520</Postcode><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>Yale University</OrgName><OrgAddress><City>New Haven</City><State>CT</State><Postcode>06520</Postcode><Country>USA</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on <Emphasis Type="Italic">Applicative Universal Grammar</Emphasis> (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings.</Para><Para>The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle><SubSeriesSubTitle Language="En">Subseries of Lecture Notes in Computer Science</SubSeriesSubTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName><GivenName>G.</GivenName><FamilyName>Carbonell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Affiliation ID="Aff3"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Postcode>USA</Postcode></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing</title></titleInfo><name type="personal"><namePart type="given">Sebastian</namePart><namePart type="family">Shaumyan</namePart><affiliation>Department of Linguistics, Yale University, 06520, New Haven, CT, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Paul</namePart><namePart type="family">Hudak</namePart><affiliation>Department of Computer Science, Yale University, 06520, New Haven, CT, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1999</dateIssued><copyrightDate encoding="w3cdtf">1999</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: We describe how type information can be used to infer grammatical structure. This is in contrast to conventional type inference in programming languages where the roles are reversed, structure determining type. Our work is based on Applicative Universal Grammar (AUG), a linguistic theory that views the formation of phrase in a form that is analogous to function application in a programming language. We descibe our overall methodology including its linguistic and philosophical underpinnings. The natural language parser that we have constructed should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy. Both computer scientists and linguists should also be interested in the convergence of the theory of functional programming languages and AUG with regard to their conceptual bases. Both have been motivated by entirely di.erent goals and have develop ed independently, but they are rooted in a common conceptual system of an applicative calculus.</abstract><relatedItem type="host"><titleInfo><title>Logical Aspects of Computational Linguistics</title><subTitle>Second International Conference, LACL'97 Nancy, France, September 22-24, 1997 Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Alain</namePart><namePart type="family">Lecomte</namePart><affiliation>Université Pierre Mendès France (Grenoble 2), 1251 avenue Centrale, BP 47, F-38040, Grenoble Cedex, France</affiliation><affiliation>E-mail: Alain.Lecomte@upmf-grenoble.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">François</namePart><namePart type="family">Lamarche</namePart><affiliation>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</affiliation><affiliation>E-mail: Lamarche@loria.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Guy</namePart><namePart type="family">Perrier</namePart><affiliation>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</affiliation><affiliation>E-mail: Perrier@loria.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1999</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic></subject><identifier type="DOI">10.1007/3-540-48975-4</identifier><identifier type="ISBN">978-3-540-65751-4</identifier><identifier type="eISBN">978-3-540-48975-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">59606</identifier><identifier type="BookID">3-540-48975-4</identifier><identifier type="BookChapterCount">12</identifier><identifier type="BookVolumeNumber">1582</identifier><identifier type="BookSequenceNumber">1582</identifier><identifier type="PartChapterCount">10</identifier><part><date>1999</date><detail type="part"><title>Selected papers</title></detail><detail type="volume"><number>1582</number><caption>vol.</caption></detail><extent unit="pages"><start>70</start><end>91</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1999</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title><subTitle>Subseries of Lecture Notes in Computer Science</subTitle></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Alain</namePart><namePart type="family">Lecomte</namePart><affiliation>Université Pierre Mendès France (Grenoble 2), 1251 avenue Centrale, BP 47, F-38040, Grenoble Cedex, France</affiliation><affiliation>E-mail: Alain.Lecomte@upmf-grenoble.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">François</namePart><namePart type="family">Lamarche</namePart><affiliation>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</affiliation><affiliation>E-mail: Lamarche@loria.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Guy</namePart><namePart type="family">Perrier</namePart><affiliation>LORIA (Nancy), 615 rue de Jardin Botanique, BP 101, F-54602, Villers lès Nancy Cedex, France</affiliation><affiliation>E-mail: Perrier@loria.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jaime</namePart><namePart type="given">G.</namePart><namePart type="family">Carbonell</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>Carnegie Mellon University, USA, Pittsburgh, PA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></relatedItem><identifier type="istex">B54BA72023100B918132126AD4CB495CDC02831A</identifier><identifier type="ark">ark:/67375/HCB-8TQWH02Z-J</identifier><identifier type="DOI">10.1007/3-540-48975-4_4</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 1999</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-8TQWH02Z-J/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002A92 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002A92 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:B54BA72023100B918132126AD4CB495CDC02831A
|texte= Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing
}}
| This area was generated with Dilib version V0.6.33. |  |