Sciweavers

10493 search results - page 304 / 2099
» Dynamic Word Problems
Sort
View
COLING
1996
15 years 8 months ago
Learning Part-of-Speech Guessing Rules from Lexicon: Extension to Non-Concatenative Operations
One of the problems in part-of-speech tagging of real-word texts is that of unknown to the lexicon words. In (Mikheev, 1996), a technique for fully unsupervised statistical acquis...
Andrei Mikheev
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 6 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
ACL
2011
14 years 10 months ago
Using Derivation Trees for Treebank Error Detection
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
Seth Kulick, Ann Bies, Justin Mott
LITP
1990
15 years 10 months ago
Infinite Traces
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's c...
Paul Gastin
FM
2006
Springer
97views Formal Methods» more  FM 2006»
15 years 10 months ago
Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions
This paper addresses the frame problem for programming theories that support both sharing and encapsulation through specification variables. The concept of dynamic frames is introd...
Ioannis T. Kassios