Sciweavers

205 search results - page 5 / 41
» A CCG Approach to Free Word Order Languages
Sort
View
COLING
2002
13 years 6 months ago
The Computation of Word Associations: Comparing Syntagmatic and Paradigmatic Approaches
It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze th...
Reinhard Rapp
AAAI
2008
13 years 9 months ago
Using Answer Set Programming and Lambda Calculus to Characterize Natural Language Sentences with Normatives and Exceptions
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
Chitta Baral, Juraj Dzifcak, Tran Cao Son
TSD
1999
Springer
13 years 11 months ago
Handling Word Order in a Multilingual System for Generation of Instructions
Slavic languages are characteristic by their relatively high degree of word order freedom. In the process of automatic generation from an underlying representation of the content, ...
Ivana Kruijff-Korbayová, Geert-Jan M. Kruij...
ANLP
2000
124views more  ANLP 2000»
13 years 8 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
ICALP
2010
Springer
13 years 11 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin