Search results

Jump to navigation Jump to search
  • ...that permit a limited amount of wrapping, similar to that found in [[Head grammar]]. {{DEFAULTSORT:Discontinuous-Constituent Phrase Structure Grammar}} ...
    3 KB (437 words) - 22:09, 20 February 2022
  • {{Short description|Concept in generalized context free grammar}} .... The class of head grammars is a subset of the [[Generalized context-free grammar#Linear Context-free Rewriting Systems .28LCFRSs.29|linear context-free rewr ...
    6 KB (899 words) - 15:48, 6 April 2022
  • ...sussex.ac.uk/Users/davidw/resources/papers/dissertation.pdf}}</ref> [[Head grammar]] (and its weak equivalents) is an instance of such a GCFG which is known t ...non-terminal symbol is rewritten using rewrite rules as in a context-free grammar, eventually yielding just compositions (composition functions applied to st ...
    6 KB (973 words) - 09:34, 10 January 2022
  • ...] and [[cross-serial dependency]]. LMGs extend the class of [[context free grammar]]s (CFGs) by adding introducing pattern-matched function-like rewrite seman ...</math>, where X is a non-terminal with [[arity]] n (called a [[predicate (grammar)|predicate]] in LMG terminology), and <math>\alpha</math> is a string of "i ...
    4 KB (678 words) - 18:43, 22 October 2021
  • ...m |author-link2=Angelika Kratzer |date=1998 |title=Semantics in Generative Grammar |publisher=Wiley Blackwell | location = Oxford|at=Chapter 4}}</ref> ...m |author-link2=Angelika Kratzer |date=1998 |title=Semantics in Generative Grammar |publisher=Wiley Blackwell | location = Oxford |pages= 184–188}}</ref><ref> ...
    5 KB (577 words) - 04:50, 13 February 2024
  • ...ome grammar. The easiest description of GIGs is by comparison to [[Indexed grammar]]s. Whereas in indexed grammars, a stack of indices is associated with each ...language <math>\{ ww^{+} : w \in \{a,b\}^{*} \}</math> using the following grammar: ...
    5 KB (837 words) - 07:01, 19 September 2022
  • '''Minimalist grammars''' are a class of [[formal grammar]]s that aim to provide a more rigorous, usually proof-theoretic, formalizat ...tly in notation from Lecomte and Retoré (2001), we can define a minimalist grammar as a 3-tuple <math>G = (C, F, L)</math>, where <math>C</math> is a set of " ...
    6 KB (1,032 words) - 21:23, 18 February 2023
  • '''Range concatenation grammar''' (RCG) is a grammar formalism developed by Pierre Boullier <ref name="boullier1998">{{cite tech Though intended as a variant on Groenink's [[literal movement grammar]]s (LMGs), RCGs treat the grammatical process more as a proof than as a pro ...
    10 KB (1,609 words) - 22:55, 25 January 2024
  • ...t posits representations similar to those used in [[Combinatory categorial grammar|Combinatory categorial grammars (CCG)]], it builds those representations le While most grammar formalisms characterise properties of strings of words, in Dynamic Syntax i ...
    11 KB (1,589 words) - 16:33, 24 September 2024
  • ...mmar]]s. Much like categorial grammar (CG), PG is a kind of [[type logical grammar]]. Unlike CG, however, PG does not have a distinguished function type. Rath == Definition of a pregroup grammar == ...
    12 KB (1,833 words) - 00:18, 26 November 2023
  • ...ontextual conditions on rule application, and grammars with [[Parallelism (grammar)|parallelism]] in rule application. Because indexed grammars are so well es ...uage controlled grammars (often called just controlled grammars), [[matrix grammar]]s, vector grammars, and programmed grammars. ...
    33 KB (5,731 words) - 21:39, 14 March 2023
  • ===Frameworks and libraries=== * Attribute Grammar Evaluation ...
    11 KB (1,457 words) - 03:25, 26 April 2024
  • ...positional treatment in classic approaches to semantics such as [[Montague grammar]].<ref name = "dynsemsep" /><ref name = "drtsep">{{cite encyclopedia |last1 ...ences in [[first order logic]], one would need to translate the [[Article (grammar)#Indefinite article|indefinite noun phrase]] "a donkey" as a [[universal qu ...
    16 KB (2,222 words) - 16:38, 16 April 2023
  • ...is the branch of [[linguistics]] which uses [[formal language]]s, [[formal grammar]]s and [[first-order logic]]al expressions for the analysis of [[natural la ...rks such as [[systemic functional linguistics]] and [[functional discourse grammar]]. Computational methods have been developed by the framework [[functional ...
    15 KB (2,002 words) - 14:51, 15 February 2025
  • ...10.2458/azu_uapress_9780816540068-ch018|chapter=Probabilistic Biosignature Frameworks|author1=Sara Imari Walker|author2=Leroy Cronin|author3=Alexa Drew|author4=S * [[Smallest grammar problem]] ...
    16 KB (2,222 words) - 05:23, 16 December 2024
  • ...ect reasoning often embody [[fallacies]]. Systems of logic are theoretical frameworks for assessing the correctness of arguments. ...ade up of subpropositional parts, like [[singular term]]s and [[Predicate (grammar)|predicates]].{{sfn |Honderich |2005 |loc=philosophical logic}}{{sfnm|1a1=K ...
    145 KB (20,377 words) - 19:04, 1 March 2025
  • ...ogist [[Vyvyan Evans]] mapped out the role of [[probabilistic context-free grammar]] (PCFG) in enabling [[Natural language processing#Cognition|NLP to model c ...
    113 KB (15,819 words) - 07:09, 1 March 2025
  • ...le to know that it is true, leading to contradictions in certain epistemic frameworks.}} ...l system for modeling the syntax of natural languages, based on categorial grammar, emphasizing the role of operations and types.}} ...
    270 KB (38,241 words) - 06:11, 6 January 2025
  • ...e''. Wiesbaden: Springer Fachmedien, 1989, chapter 3; Patrick Murray, "The Grammar of Value: A Close Look at Marx's Critique of Samuel Bailey", in: Patrick Mu ...tional protectionist policies could tear apart the institutional and legal frameworks governing global trade.<ref>Chris Giles, "IMF chief warns trade war could r ...
    262 KB (39,158 words) - 12:03, 28 February 2025