نتایج جستجو برای: well formedness

تعداد نتایج: 1523413  

2004
Kilian A. Foth Michael Daum Wolfgang Menzel

We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, defeasible constraints that integrate different sources of linguistic knowledge, very high robustness is achieved against all sorts of extragrammatical constructions.

2014
Thomas Williams

6 Syntactic ornaments in the binary language 21 6.1 From ornaments to projection . . . . . . . . . . . . . . . . . . . . . . . . . . 24 6.2 Syntax of the binary language . . . . . . . . . . . . . . . . . . . . . . . . . . 25 6.3 Projection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 6.4 Datatype environment . . . . . . . . . . . . . . . . . . . . . . . . . . ....

1999

Syntax The abstract syntax is presented in a UML class diagram showing the metaclasses defining theconstructs and their relationships. The diagram also presents some of the well-formedness rules,mainly the multiplicity requirements of the relationships, and whether or not the instances of aparticular sub-construct must be ordered. Finally, a short informal description in natural...

2009
Jason Ginsburg

Although Japanese, Korean, and Mandarin are all wh-in-situ languages, they differ with respect to intervention effects. I use the term ‘intervention effects’ in accord with Beck (1996) and Beck and Kim (1997) to refer to ill-formedness that results when a particular phrase, generally a quantificational and/or focus element, c-commands a wh-phrase. In this paper, I refer to intervenors as ‘quant...

2005
Sylvain Kahane François Lareau

This article presents the Meaning-Text Unification Grammar’s current state, now that its formal foundations have been clarified with the development of Polarized Unification Grammar. Emphasis is put on the model’s architecture and the role of polarization in linking its modules — semantics-syntax interface and the well-formedness grammars of each representation level.

2007
Myrto Arapinis Marie Duflot

The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper we show how to get message boundedness “for free” under a reasonable (s...

1995
Osamu Imaichi Yuji Matsumoto

This paper describes an integrated method for processing grammatically i l l formed inputs We use partial parses of the input for recov ering from parsing failure In order to select partial parses appropriate for error recovery, cost and reward are assigned to them Cost and reward represent the badness and goodness of a partial parse, respectively The most appropriate partial parse is selected ...

Journal: :Inf. Comput. 2014
Myrto Arapinis Marie Duflot

The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper we show how to get message boundedness “for free” under a reasonable (s...

Journal: :Postmodern Openings 2022

Communication occupies a key place in the professional activities of physical education instructors, who involve students culture and health activities, create conditions for them to master experience such through implementation health-preserving technologies process student-centered education. The aim research is investigate psychological pedagogical peculiarities communicative competence form...

Journal: :Glossa 2022

How do grammars assess the well-formedness of words with multiple phonotactic violations? Certain models predict that as strength restrictions decrease, forms violate should be less acceptable than expected, in a pattern we term super-linear cumulativity. We test this prediction using series Artificial Grammar Learning experiments, which vary number exceptions to patterns artificial languages. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید