Abstact. In modern grammars of Slavic languages, syntactically non-segmented word-combinations are not separated into a separate type, but represented in single list different types free word combinations. Today, it is important to understand the place grammatical system language. The purpose paper characterize basis valence word-combination as new type syntactic constructions.. New approaches ...

In this paper we describe function tagging using Transformation Based Learning (TBL) for Myanmar that is a method of extensions to the previous statistics-based function tagger. Contextual and lexical rules (developed using TBL) were critical in achieving good results. First, we describe a method for expressing lexical relations in function tagging that statistical function tagging are currentl...

This article reflects a collaboration between the Universities of Groningen and Reading of which Frans Zwarts was the promoter. One of the outcomes was a close attention to the learning of various aspects of argument structure by children with specific language impairment (SLI) in Dutch and English. At that time and since, the focus on deficits in grammatical morphology in these children has le...

Paraphrases, which stem from the variety of lexical and grammatical means of expressing meaning available in a language, pose challenges for a sentence generation system. In this paper, we discuss the generation of paraphrases from predicate/argument structure using a simple, uniform generation methodology. Central to our approach are lexico-grammatical resources which pair elementary semantic ...

Scaling wide-coverage, constraint-based grammars such as Lexical-Functional Grammars (LFG) (Kaplan and Bresnan, 1982; Bresnan, 2001) or Head-Driven Phrase Structure Grammars (HPSG) (Pollard and Sag, 1994) from fragments to naturally occurring unrestricted text is knowledge-intensive, time-consuming and (often prohibitively) expensive. A number of researchers have recently presented methods to a...

Video structuring, in particular applied to TV programs which have strong editing structures, mostly relies on supervised approaches either to retrieve a known structure for which a model has been obtained or to detect key elements from which a known structure is inferred. In this paper, we propose an unsupervised approach to recurrent TV program structuring, exploiting the repetitiveness of ke...