回忆录
发表于 2025-3-21 16:10:54
书目名称Grammatical Inference: Algorithms and Applications影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0387812<br><br> <br><br>书目名称Grammatical Inference: Algorithms and Applications读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0387812<br><br> <br><br>
毕业典礼
发表于 2025-3-21 23:43:32
https://doi.org/10.1007/978-3-319-59318-0es from a language, a canonical grammar for the training corpus, and a parsing task, Partition Search . Learning constructs a grammar that maximises performance on the parsing task and minimises grammar size. This paper describes Partition Search in detail, also providing theoretical background and
树上结蜜糖
发表于 2025-3-22 02:49:25
http://reply.papertrans.cn/39/3879/387812/387812_3.png
Rct393
发表于 2025-3-22 05:15:28
http://reply.papertrans.cn/39/3879/387812/387812_4.png
Mobile
发表于 2025-3-22 09:16:28
http://reply.papertrans.cn/39/3879/387812/387812_5.png
intelligible
发表于 2025-3-22 16:56:48
https://doi.org/10.1007/978-3-531-91531-9e introduced in [.] a class of automata based on properties of residual languages (RFSA) and showed in [.] and [.] that this class could be interesting for grammatical inference purpose. Here, we study properties of 0-reversible languages that can be expressed as properties of their residual languag
intelligible
发表于 2025-3-22 17:19:42
https://doi.org/10.1007/978-3-322-93584-7mple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated by residuals) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Deterministic Finite Automata (PDFA). We pre
唤起
发表于 2025-3-23 00:45:55
https://doi.org/10.1007/978-3-0348-5195-4ies. More precisely, rational transducers can be used to implement explicit fragmentation to define new identifiable regular language classes. Context conditions can be used to construe identifiable and characterizable language classes which may contain non-regular languages by means of implicit fra
拥护者
发表于 2025-3-23 03:30:56
http://reply.papertrans.cn/39/3879/387812/387812_9.png
壕沟
发表于 2025-3-23 08:45:55
,Pädagogische und politische Perspektiven,h trees which are a quite natural way to represent structured information. These trees are used afterwards to infer a stochastic tree automaton, using a well-known grammatical inference algorithm. We propose two extensions of this algorithm: use of sorts and generalization of the infered automaton a