Sciweavers

143 search results - page 27 / 29
» From Prosodic Trees to Syntactic Trees
Sort
View
ACTAC
2006
126views more  ACTAC 2006»
13 years 9 months ago
Named Entity Recognition for Hungarian Using Various Machine Learning Algorithms
In this paper we introduce a statistical Named Entity recognizer (NER) system for the Hungarian language. We examined three methods for identifying and disambiguating proper nouns...
Richárd Farkas, György Szarvas, Andr&a...
MST
2007
168views more  MST 2007»
13 years 9 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
PLDI
2010
ACM
14 years 7 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
KER
2007
90views more  KER 2007»
13 years 9 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
STACS
2010
Springer
14 years 4 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey