牲畜栏
发表于 2025-3-26 22:43:22
Recognizing Head Movementends these grammars with head movement (“incorporation”) and affix hopping. The grammars are presented as lexicons together with CKY-like reduction rules, so an efficient CKY-like recognition method is immediately given, and logical perspectives are briefly considered.
Feckless
发表于 2025-3-27 01:10:29
http://reply.papertrans.cn/59/5882/588126/588126_32.png
CEDE
发表于 2025-3-27 08:58:26
http://reply.papertrans.cn/59/5882/588126/588126_33.png
冰雹
发表于 2025-3-27 09:42:05
An Algebraic Analysis of Clitic Pronouns in ItalianWe analyze both pre- and post-verbal clitics in Italian in the context of infinitival phrases and declarative sentences, using a new form of categorial grammar in which one assigns to each morpheme a type, an element of the free “pregroup” generated by a partially ordered set of basic types.
伪善
发表于 2025-3-27 14:18:51
http://reply.papertrans.cn/59/5882/588126/588126_35.png
洞察力
发表于 2025-3-27 18:35:42
http://reply.papertrans.cn/59/5882/588126/588126_36.png
血统
发表于 2025-3-28 01:49:35
http://reply.papertrans.cn/59/5882/588126/588126_37.png
CALL
发表于 2025-3-28 04:26:27
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Techniqueprovide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.
使成整体
发表于 2025-3-28 08:06:52
Consistent Identification in the Limit of Any of the Classes ,-Valued Is NP-hardg some of these classes by means of a consistent learning function is NP-hard..The complexity of learning classes from one particular family, Gk-valued, was still left open. In this paper it is shown that learning any (except one) class from this family by means of a consistent learning function is NP-hard as well.
宴会
发表于 2025-3-28 13:18:44
A Framework for the Hyperintensional Semantics of Natural Language with Two Implementationsituations/indices are then prime filters of propositions in the (pre-)lattice. Truth in a world/situation is then reducible to membership of a prime filter. We showho wthi s approach can be implemented within (i) an intensional higher-order type theory, and (ii) first-order property theory.