同意和标签可以简化为最小搜索吗?

IF 1.6 1区 文学 0 LANGUAGE & LINGUISTICS Linguistic Inquiry Pub Date : 2024-10-02 DOI:10.1162/ling_a_00481
Alan Hezao Ke
{"title":"同意和标签可以简化为最小搜索吗?","authors":"Alan Hezao Ke","doi":"10.1162/ling_a_00481","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":48044,"journal":{"name":"Linguistic Inquiry","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Can Agree and Labeling Be Reduced to Minimal Search?\",\"authors\":\"Alan Hezao Ke\",\"doi\":\"10.1162/ling_a_00481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":48044,\"journal\":{\"name\":\"Linguistic Inquiry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linguistic Inquiry\",\"FirstCategoryId\":\"98\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10715579/\",\"RegionNum\":1,\"RegionCategory\":\"文学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"LANGUAGE & LINGUISTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linguistic Inquiry","FirstCategoryId":"98","ListUrlMain":"https://ieeexplore.ieee.org/document/10715579/","RegionNum":1,"RegionCategory":"文学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"LANGUAGE & LINGUISTICS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了最小搜索的形式化定义,以评价将Agree和Labeling简化为最小搜索的思想。最小搜索中搜索算法的不同方面,即广度优先与深度优先搜索,并行与串行搜索,全局与模块化搜索进行了比较,并根据对其理论和经验结果的详细检查给出了在这些对之间进行选择的原因。基于最小搜索的形式化定义,本文认为最小搜索只能部分地统一Agree和Labeling,即最小搜索可以统一Agree和Labeling中的搜索算法,但搜索目标和搜索域的值是由Agree和Labeling独立确定的。本文(重新)定义了基于最小搜索的Agree和Labeling,以捕捉这两种操作之间的异同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Can Agree and Labeling Be Reduced to Minimal Search?
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Linguistic Inquiry
Linguistic Inquiry Multiple-
CiteScore
2.50
自引率
12.50%
发文量
54
期刊介绍: Linguistic Inquiry leads the field in research on current topics in linguistics. This key resource explores new theoretical developments based on the latest international scholarship, capturing the excitement of contemporary debate in full-scale articles as well as shorter contributions (Squibs and Discussion) and more extensive commentary (Remarks and Replies).
期刊最新文献
Inverse Linking and Extraposition VP-Preposing and Constituency “Paradox” Using Computational Models to Test Syntactic Learnability Applicative Recursion and Nominal Licensing More on (the Lack of) Reconstruction in English Tough-Constructions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1