Sciweavers

3145 search results - page 104 / 629
» A Computational Psycholinguistic Model of Natural Language P...
Sort
View
LICS
2009
IEEE
16 years 2 days ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
UML
2005
Springer
15 years 11 months ago
Domain Models Are Aspect Free
Abstract. Proponents of aspect orientation have successfully seeded the impression that aspects—like objects—are so fundamental a notion that they should pervade all phases and...
Friedrich Steimann
INLG
2010
Springer
15 years 3 months ago
Named Entity Generation Using Sampling-based Structured Prediction
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
Guillaume Bouchard
INLG
2010
Springer
15 years 3 months ago
Generating Referring Expressions with Reference Domain Theory
In this paper we present a reference generation model based on Reference Domain Theory which gives a dynamic account of reference. This reference model assumes that each referring...
Alexandre Denis
EMNLP
2010
15 years 3 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura